Automatically Spotting Information-Rich Nodes in Graphs. - Xiao He 002; Jing Feng 003; Claudia Plant (ICDM Workshops, 2011)

Summarization-based mining bipartite graphs. - Jing Feng 003; Xiao He 002; Bettina Konte; Christian Böhm 001; Claudia Plant (KDD, 2012)

Compression-Based Graph Mining Exploiting Structure Primitives. - Jing Feng 003; Xiao He 002; Nina C. Hubig; Christian Böhm 001; Claudia Plant (ICDM, 2013)

Active Density-Based Clustering. - Son T. Mai; Xiao He 002; Nina C. Hubig; Claudia Plant; Christian Böhm 001 (ICDM, 2013)

Robust Synchronization-Based Graph Clustering. - Junming Shao; Xiao He 002; Qinli Yang; Claudia Plant; Christian Böhm 001 (PAKDD (1), 2013)

Efficient Anytime Density-based Clustering. - Christian Böhm 001; Jing Feng 003; Xiao He 002; Son T. Mai (SDM, 2013)

Synchronization-Inspired Partitioning and Hierarchical Clustering. - Junming Shao; Xiao He 002; Christian Böhm 001; Qinli Yang; Claudia Plant (IEEE Trans. Knowl. Data Eng., 2013)

Finding the Optimal Subspace for Clustering. - Sebastian Goebl; Xiao He 002; Claudia Plant; Christian Böhm 001 (ICDM, 2014)

Relevant overlapping subspace clusters on categorical data. - Xiao He 002; Jing Feng 003; Bettina Konte; Son T. Mai; Claudia Plant (KDD, 2014)

Multi-purpose exploratory mining of complex data. - Xiao He 002 (2014)

Anytime density-based clustering of complex data. - Son T. Mai; Xiao He 002; Jing Feng 003; Claudia Plant; Christian Böhm 001 (Knowl. Inf. Syst., 2015)