paper-with-me

Papers

Relaxed Oracles for Semi-Supervised Clustering

2017-11-20 · Taewan Kim, Joydeep Ghosh

Pairwise "same-cluster" queries are one of the most widely used forms of supervision in semi-supervised clustering. However, it is impractical to ask human oracles to answer every query correctly. In this paper, we study the influence of allowing "not-sure" answers from a weak oracle and propose an effective algorithm to handle such uncertainties in query responses. Two realistic weak oracle models are considered where ambiguity in answering depends on the distance between two points. We show that a small query complexity is adequate for effective clustering with high probability by providing better pairs to the weak oracle. Experimental results on synthetic and real data show the effectiveness of our approach in overcoming supervision uncertainties and yielding high quality clusters.

📄 PDF Abstract BibTeX arXiv:1711.07433

Code (1)

twankim/weaksemi 공식 구현

Tasks

Clustering

Similar Papers 제목 키워드 기반

Embedding Graph Auto-Encoder for Graph Clustering

2020-02-20 · Hongyuan Zhang, Rui Zhang, Xuelong Li

Graph clustering, aiming to partition nodes of a graph into various groups via an unsupervised approach, is an attractive topic in recent years. To improve the representative ability, several graph auto-encoder (GAE) mod…

ClusteringDecoderGraph Clustering

Semi-Supervised Active Clustering with Weak Oracles

2017-09-11 · Taewan Kim, Joydeep Ghosh

Semi-supervised active clustering (SSAC) utilizes the knowledge of a domain expert to cluster data points by interactively making pairwise "same-cluster" queries. However, it is impractical to ask human oracles to answer…

Clustering

Minimal Dirichlet energy partitions for graphs

2013-08-22 · Braxton Osting, Chris D. White, Edouard Oudet

Motivated by a geometric problem, we introduce a new non-convex graph partitioning objective where the optimality criterion is given by the sum of the Dirichlet eigenvalues of the partition components. A relaxed formulat…

Clusteringgraph partitioning

Semi-Supervised Nonlinear Distance Metric Learning via Forests of Max-Margin Cluster Hierarchies

2014-02-23 · David M. Johnson, Caiming Xiong, Jason J. Corso

Metric learning is a key problem for many data mining and machine learning applications, and has long been dominated by Mahalanobis methods. Recent advances in nonlinear metric learning have demonstrated the potential po…

ClusteringImage RetrievalMetric LearningRetrieval

Smile-GANs: Semi-supervised clustering via GANs for dissecting brain disease heterogeneity from medical images

2020-06-27 · Zhijian Yang, Junhao Wen, Christos Davatzikos

Machine learning methods applied to complex biomedical data has enabled the construction of disease signatures of diagnostic/prognostic value. However, less attention has been given to understanding disease heterogeneity…

ClusteringDiagnostic