◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

N. Sidiropoulos

39 papers hereh-index 6219.4k citations315 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author1
  • middle author13
  • last author25

Across the 39 of 39 papers where every author was matched, so the position is known.

fields
  • cs.LG8
  • stat.ML8
  • eess.SP7
  • cs.IT5
  • cs.SI4
  • math.OC2
same name
  • N. Sidiropoulos — 24 papers, h 25
  • N. Sidiropoulos — 5 papers, h 11
  • N. Sidiropoulos — 1 paper, h 6

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

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 cs.SIShow all

4 papers · 1 filter

cs.SI2021

Exploring the Subgraph Density-Size Trade-off via the Lovász Extension

Aritra Konar, Nicholas D. Sidiropoulos

Given an undirected graph, the Densest-k-Subgraph problem (DkS) seeks to find a subset of k vertices such that the sum of the edge weights in the corresponding subgraph is maximize…

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.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…

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…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.