Clustering

Enumerating Maximal k-Plexes with Worst-Case Time Guarantee AAAI 2020 Explainable Data Decompositions AAAI 2020 Fair k-Centers via Maximum Matching ICML 2020 Fast and Accurate k-means++ via Rejection Sampling NeurIPS 2020 FlowScope: Spotting Money Laundering Based on Graphs AAAI 2020 Fragmentation Coagulation Based Mixed Membership Stochastic Blockmodel AAAI 2020 From Paris to Berlin: Discovering Fashion Style Influences Around the World CVPR 2020 From Trees to Continuous Embeddings and Back: Hyperbolic Hierarchical Clustering NeurIPS 2020 Hermitian matrices for clustering directed graphs: insights and applications AISTATS 2020 Hierarchical Clustering: A 0.585 Revenue Approximation COLT 2020 I miss you babe: Analyzing Emotion Dynamics During COVID-19 Pandemic EMNLP 2020 Interactive Rare-Category-of-Interest Mining from Large Datasets AAAI 2020 KFC: A Scalable Approximation Algorithm for k−center Fair Clustering NeurIPS 2020 Latent Simplex Position Model: High Dimensional Multi-view Clustering with Uncertainty Quantification JMLR 2020 Learning Mixed Latent Tree Models JMLR 2020 LOGAN: Local Group Bias Detection by Clustering EMNLP 2020 Making Existing Clusterings Fairer: Algorithms, Complexity Results and Insights AAAI 2020 Multi-View Clustering in Latent Embedding Space AAAI 2020 Multi-View Multiple Clusterings Using Deep Matrix Factorization AAAI 2020 Multi-View Spectral Clustering with Optimal Neighborhood Laplacian Matrix AAAI 2020 MuMod: A Micro-Unit Connection Approach for Hybrid-Order Community Detection AAAI 2020 Online Dense Subgraph Discovery via Blurred-Graph Feedback ICML 2020 On Metric DBSCAN with Low Doubling Dimension IJCAI 2020 Outlier Detection Ensemble with Embedded Feature Selection AAAI 2020 Partially Observable Markov Decision Process Modelling for Assessing Hierarchies ACML 2020