Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > HCAC: Semi-supervised hierarchical clustering using confidence-based active learning
Publication

Publications

HCAC: Semi-supervised hierarchical clustering using confidence-based active learning

Title
HCAC: Semi-supervised hierarchical clustering using confidence-based active learning
Type
Article in International Conference Proceedings Book
Year
2012
Authors
Nogueira, BM
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Jorge, AM
(Author)
FCUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page Without ORCID
Rezende, SO
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Conference proceedings International
Pages: 139-153
15th International Conference on Discovery Science, DS 2012
Lyon, 29 October 2012 through 31 October 2012
Indexing
Other information
Authenticus ID: P-008-726
Abstract (EN): Despite their importance, hierarchical clustering has been little explored for semi-supervised algorithms. In this paper, we address the problem of semi-supervised hierarchical clustering by using an active learning solution with cluster-level constraints. This active learning approach is based on a new concept of merge confidence in agglomerative clustering. When there is low confidence in a cluster merge the user is queried and provides a cluster-level constraint. The proposed method is compared with an unsupervised algorithm (average-link) and two state-of-the-art semi-supervised algorithms (pairwise constraints and Constrained Complete-Link). Results show that our algorithm tends to be better than the two semi-supervised algorithms and can achieve a significant improvement when compared to the unsupervised algorithm. Our approach is particularly useful when the number of clusters is high which is the case in many real problems. © 2012 Springer-Verlag Berlin Heidelberg.
Language: English
Type (Professor's evaluation): Scientific
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same authors

Hierarchical confidence-based active clustering (2012)
Article in International Conference Proceedings Book
Nogueira, BM; Jorge, AM; Rezende, SO
Comparing relational and non-relational algorithms for clustering propositional data (2013)
Article in International Conference Proceedings Book
Motta, R; Nogueira, BM; Jorge, AM; De Andrade Lopes, A; Rezende, SO; De Oliveira, MCF
Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-08-11 at 10:13:32 | Privacy Policy | Personal Data Protection Policy | Whistleblowing