activity
20082023
most citedTowards K-means-friendly Spaces: Simultaneous Deep Learning and Clustering

607 citations · 1.2k across the 34 of their papers we have counts for

collaborators
Showing 2020Show all

7 papers · 1 filter

cs.LG2020

eTREE: Learning Tree-structured Embeddings

Faisal M. Almutairi, Yunlong Wang, Dong Wang +2

Matrix factorization (MF) plays an important role in a wide range of machine learning and data mining models. MF is commonly used to obtain item embeddings and feature representati…

cs.SI2020

GAGE: Geometry Preserving Attributed Graph Embeddings

Charilaos I. Kanatsoulis, Nicholas D. Sidiropoulos

Node embedding is the task of extracting concise and informative representations of certain entities that are connected in a network. Various real-world networks include informatio…

cs.LG2020★ 10 cited

Information-theoretic Feature Selection via Tensor Decomposition and Submodularity

Magda Amiridi, Nikos Kargas, Nicholas D. Sidiropoulos

Feature selection by maximizing high-order mutual information between the selected feature vector and a target variable is the gold standard in terms of selecting the best subset o…

cs.SI2020

TeX-Graph: Coupled tensor-matrix knowledge-graph embedding for COVID-19 drug repurposing

Charilaos I. Kanatsoulis, Nicholas D. Sidiropoulos

Knowledge graphs (KGs) are powerful tools that codify relational behaviour between entities in knowledge bases. KGs can simultaneously model many different types of subject-predica…

eess.SP2020

PHASED: Phase-Aware Submodularity-Based Energy Disaggregation

Faisal M. Almutairi, Aritra Konar, Ahmed S. Zamzam +1

Energy disaggregation is the task of discerning the energy consumption of individual appliances from aggregated measurements, which holds promise for understanding and reducing ene…

cs.SI2020

Mining Large Quasi-cliques with Quality Guarantees from Vertex Neighborhoods

Aritra Konar, Nicholas D. Sidiropoulos

Mining dense subgraphs is an important primitive across a spectrum of graph-mining tasks. In this work, we formally establish that two recurring characteristics of real-world graph…