Task-oriented Embedding Counts: Heuristic Clustering-driven Feature Fine-tuning for Whole Slide Image Classification
In the field of whole slide image (WSI) classification, multiple instance learning (MIL) serves as a promising approach, commonly decoupled into feature extraction and aggregation. In this paradigm, our observation reveals that discriminative embeddings are crucial for aggregation to the final prediction. Among all feature updating strategies, task-oriented ones can capture characteristics specifically for certain tasks. However, they can be prone to overfitting and contaminated by samples assigned with noisy labels. To address this issue, we propose a heuristic clustering-driven feature fine-tuning method (HC-FT) to enhance the performance of multiple instance learning by providing purified positive and hard negative samples. Our method first employs a well-trained MIL model to evaluate the confidence of patches. Then, patches with high confidence are marked as positive samples, while the remaining patches are used to identify crucial negative samples. After two rounds of heuristic clustering and selection, purified positive and hard negative samples are obtained to facilitate feature fine-tuning. The proposed method is evaluated on both CAMELYON16 and BRACS datasets, achieving an AUC of 97.13% and 85.85%, respectively, consistently outperforming all compared methods.
Code (0)
등록된 구현이 없습니다.
Tasks
Clusteringimage-classificationImage ClassificationMultiple Instance LearningSimilar Papers 제목 키워드 기반
Balanced Order Batching with Task-Oriented Graph Clustering
Balanced order batching problem (BOBP) arises from the process of warehouse picking in Cainiao, the largest logistics platform in China. Batching orders together in the picking process to form a single picking route, red…
ClusteringDeep ClusteringGraph ClusteringAnalysis of Utterance Embeddings and Clustering Methods Related to Intent Induction for Task-Oriented Dialogue
The focus of this work is to investigate unsupervised approaches to overcome quintessential challenges in designing task-oriented dialog schema: assigning intent labels to each dialog turn (intent clustering) and generat…
ClusteringA Survey on Role-Oriented Network Embedding
Recently, Network Embedding (NE) has become one of the most attractive research topics in machine learning and data mining. NE approaches have achieved promising performance in various of graph mining tasks including lin…
ClusteringGraph MiningLink PredictionNetwork Embedding+3Resolving Event Coreference with Supervised Representation Learning and Clustering-Oriented Regularization
We present an approach to event coreference resolution by developing a general framework for clustering that uses supervised representation learning. We propose a neural network architecture with novel Clustering-Oriente…
Clusteringcoreference-resolutionCoreference ResolutionEvent Coreference Resolution+1Unit Commitment with Cost-Oriented Temporal Resolution
Time-adaptive unit commitment (UC) has recently been investigated to reduce the scheduling costs by flexibly varying the temporal resolution, which is usually determined by clustering the net load patterns. However, ther…
Bilevel OptimizationClusteringScheduling