Fuzzifying clustering algorithms: The case study of MajorClust

Eugene Levner, David Pinto, Paolo Rosso, David Alcaide, R. R.K. Sharma

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

Among various document clustering algorithms that have been proposed so far, the most useful are those that automatically reveal the number of clusters and assign each target document to exactly one cluster. However, in many real situations, there not exists an exact boundary between different clusters. In this work, we introduce a fuzzy version of the MajorClust algorithm. The proposed clustering method assigns documents to more than one category by taking into account a membership function for both, edges and nodes of the corresponding underlying graph. Thus, the clustering problem is formulated in terms of weighted fuzzy graphs. The fuzzy approach permits to decrease some negative effects which appear in clustering of large-sized corpora with noisy data.

Original languageEnglish
Title of host publicationMICAI 2007
Subtitle of host publicationAdvances in Artificial Intelligence - 6th Mexican International Conference on Artificial Intelligence, Proceedings
PublisherSpringer Verlag
Pages821-830
Number of pages10
ISBN (Print)9783540766308
DOIs
StatePublished - 2007
Externally publishedYes
Event6th Mexican International Conference on Artificial Intelligence, MICAI 2007 - Aguascalientes, Mexico
Duration: 4 Nov 200710 Nov 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4827 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th Mexican International Conference on Artificial Intelligence, MICAI 2007
Country/TerritoryMexico
CityAguascalientes
Period4/11/0710/11/07

Fingerprint

Dive into the research topics of 'Fuzzifying clustering algorithms: The case study of MajorClust'. Together they form a unique fingerprint.

Cite this