Name Venue Year citations
Weakly Supervised Anomaly Detection via Dual-Tailed Kernel. ICML 2025 0
MNN-Closure Meets Local Maxima: A Double-Knee Approach to Anomaly Detection. ICDM 2025 0
DMDHC: Discovery of Multi-Density Hierarchical Cluster Structures. SDM 2025 0
Scalable Graph Classification via Random Walk Fingerprints (Extended Abstract). IJCAI 2025 0
SHADE: Deep Density-based Clustering. ICDM 2024 1
ADOD: Adaptive Density Outlier Detection. ICDM 2024 3
DynoGraph: Dynamic Graph Construction for Nonlinear Dimensionality Reduction. ICDM 2024 0
Scalable Graph Classification via Random Walk Fingerprints. ICDM 2024 4
Application of Deep Clustering Algorithms. CIKM 2023 0
k-SubMix: Common Subspace Clustering on Mixed-Type Data. ECML/PKDD 2023 0
Extension of the Dip-test Repertoire - Efficient and Differentiable p-value Calculation for Clustering. SDM 2023 4
Interpretable Subgraph Feature Extraction for Hyperlink Prediction. ICDM 2023 2
Influence without Authority: Maximizing Information Coverage in Hypergraphs. SDM 2023 4
DBHD: Density-based clustering for highly varying density. ICDM 2022 2
The DipEncoder: Enforcing Multimodality in Autoencoders. KDD 2022 11
Deep Clustering With Consensus Representations. ICDM 2022 7
Automatic Parameter Selection for Non-Redundant Clustering. SDM 2022 0
Density-Based Clustering for Adaptive Density Variation. ICDM 2021 13
Details (Don't) Matter: Isolating Cluster Information in Deep Embedded Spaces. IJCAI 2021 16
Dip-based Deep Embedded Clustering with k-Estimation. KDD 2021 27
Community Attention Network for Semi-supervised Node Classification. ICDM 2020 3
Deep Embedded Non-Redundant Clustering. AAAI 2020 28
Data Compression as a Comprehensive Framework for Graph Drawing and Representation Learning. KDD 2020 8
Online Semi-supervised Multi-label Classification with Label Compression and Local Smooth Regression. IJCAI 2020 20
Deep Embedded Cluster Tree. ICDM 2019 15
Network Structure and Transfer Behaviors Embedding via Deep Prediction Model. AAAI 2019 11
Clustering of Mixed-Type Data Considering Concept Hierarchies. PAKDD 2019 0
Discovering Non-Redundant K-means Clusterings in Optimal Subspaces. KDD 2018 27
Towards an Optimal Subspace for K-Means. KDD 2017 27
Learning from Labeled and Unlabeled Vertices in Networks. KDD 2017 13
Attributed Graph Clustering with Unimodal Normalized Cut. ECML/PKDD 2017 23
Multi-core K-means. SDM 2017 19
FUSE: Full Spectral Clustering. KDD 2016 34
MeGS: Partitioning Meaningful Subgraph Structures Using Minimum Description Length. ICDM 2016 16
Gaussian Component Based Index for GMMs. ICDM 2016 5
Finding the Optimal Subspace for Clustering. ICDM 2014 27
Active Density-Based Clustering. ICDM 2013 34
Massively parallel expectation maximization using graphics processing units. KDD 2013 20
Robust Synchronization-Based Graph Clustering. PAKDD 2013 20
Efficient Anytime Density-based Clustering. SDM 2013 27
Compression-Based Graph Mining Exploiting Structure Primitives. ICDM 2013 13
Summarization-based mining bipartite graphs. KDD 2012 23
Weighted Graph Compression for Parameter-free Clustering With PaCCo. SDM 2011 10
INCONCO: interpretable clustering of numerical and categorical objects. KDD 2011 41
Detection of Arbitrarily Oriented Synchronized Clusters in High-Dimensional Data. ICDM 2011 28
Integrative Parameter-Free Clustering of Data with Mixed Type Attributes. PAKDD 2010 23
Clustering by synchronization. KDD 2010 87
SkyDist: Data Mining on Skyline Objects. PAKDD 2010 5
ITCH: Information-Theoretic Cluster Hierarchies. ECML/PKDD 2010 10
Synchronization Based Outlier Detection. ECML/PKDD 2010 15
Density-based clustering using graphics processors. CIKM 2009 98
Probabilistic skyline queries. CIKM 2009 45
CoCo: coding cost for parameter-free outlier detection. KDD 2009 50
Robust Clustering in Arbitrarily Oriented Subspaces. SDM 2008 33
Robust, Complete, and Efficient Correlation Clustering. SDM 2007 70
Approximate reverse k-nearest neighbor queries in general metric spaces. CIKM 2006 16
Deriving quantitative models for correlation clusters. KDD 2006 40
Finding Hierarchies of Subspace Clusters. ECML/PKDD 2006 60
Robust information-theoretic clustering. KDD 2006 56
DeLi-Clu: Boosting Robustness, Completeness, Usability, and Efficiency of Hierarchical Clustering by a Closest Pair Ranking. PAKDD 2006 68
Online Hierarchical Clustering in a Data Warehouse Environment. ICDM 2005 24
Density Connected Clustering with Local Subspace Preferences. ICDM 2004 191
High Performance Data Mining Using the Nearest Neighbor Join. ICDM 2002 46
High Performance Clustering Based on the Similarity Join. CIKM 2000 66
Copyright ©2019 Universität Würzburg

Impressum | Privacy | FAQ