Finding density-based subspace clusters in graphs with feature vectors

DOI10.1007/S10618-012-0272-ZMaRDI QIDQ1944987zbMATH OpenOpenAlexFDO

Authors Stephan Günnemann, Brigitte Boden, Thomas Seidl

Publication date 28 March 2013

Published in Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10618-012-0272-z

zbMATH Keywords

graph clusteringnetworksdense subgraphs

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Dense community detection in multi-valued attributed networks
• Mining explainable local and global subgraph patterns with surprising densities
• SIAS-miner: mining subjectively interesting attributed subgraphs
• Attributed graph clustering with subspace stochastic block model
• Finding dense subgraphs with maximum weighted triangle density

Cites work

• A simple solution to the k‐core problem
• Managing and mining graph data
• \(k\)-core architecture and \(k\)-core percolation on complex networks

Cited in

(3)

• Mining communities and their descriptions on attributed graphs: a survey
• Attributed graph clustering with subspace stochastic block model
• Dense community detection in multi-valued attributed networks

Describes a project that uses

Uses Software

• Inc-cluster
• SA-cluster

This page was built for publication: Finding density-based subspace clusters in graphs with feature vectors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1944987)