Publikationen
4 Ergebnisse
Sort by: Jahr | Publikationstypen
2012
Günnemann S., Boden B., Seidl T.:
Finding Density-Based Subspace Clusters in Graphs with Feature Vectors
Data Mining and Knowledge Discovery Journal (DMKD), Vol. 25, Nr. 2 S.243-269 (2012)
Finding Density-Based Subspace Clusters in Graphs with Feature Vectors
Data Mining and Knowledge Discovery Journal (DMKD), Vol. 25, Nr. 2 S.243-269 (2012)
2011
Günnemann S., Boden B., Seidl T.:
DB-CSC: A density-based approach for subspace clustering in graphs with feature vectors
Proc. European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD 2011), Athens, Greece S.565-580 (2011) ECML PKDD 2011 Best Paper Award in Data Mining
[ECML PKDD 2011] [Full Text PDF]
DB-CSC: A density-based approach for subspace clustering in graphs with feature vectors
Proc. European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD 2011), Athens, Greece S.565-580 (2011) ECML PKDD 2011 Best Paper Award in Data Mining
[ECML PKDD 2011] [Full Text PDF]
2010
Günnemann S., Färber I., Boden B., Seidl T.:
Subspace Clustering Meets Dense Subgraph Mining: A Synthesis of Two Paradigms
Proc. IEEE International Conference on Data Mining (ICDM 2010), Sydney, Australia S.845-850 (2010)
[ICDM 2010] [Supplementary material]
Subspace Clustering Meets Dense Subgraph Mining: A Synthesis of Two Paradigms
Proc. IEEE International Conference on Data Mining (ICDM 2010), Sydney, Australia S.845-850 (2010)
[ICDM 2010] [Supplementary material]
Boden B.:
Synthese von Subspace Clustering und Subgraph Mining zur Analyse von Graphen mit Knotenbeschriftungen
GI Informatiktage 19./20. März 2010 in Bonn S.141-144 (2010)
[Informatiktage]
Synthese von Subspace Clustering und Subgraph Mining zur Analyse von Graphen mit Knotenbeschriftungen
GI Informatiktage 19./20. März 2010 in Bonn S.141-144 (2010)
[Informatiktage]
