A clustering approach using weighted similarity majority margins

Authors:
Raymond Bisdorff;Patrick Meyer;Alexandru-Liviu Olteanu
Affiliations:
CSC/ILIAS, FSTC, University of Luxembourg, Luxembourg;Institut Télécom, Télécom Bretagne, UMR CNRS 3192, Lab-STICC, Technopôle Brest Iroise, Brest Cedex 3, France;CSC/ILIAS, FSTC, University of Luxembourg, Luxembourg
Venue:
ADMA'11 Proceedings of the 7th international conference on Advanced Data Mining and Applications - Volume Part I
Year:
2011

Citing 13
Cited 0

Algorithms for clustering data

Algorithms for clustering data
BIRCH: an efficient data clustering method for very large databases

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Self-organizing maps

Self-organizing maps
CURE: an efficient clustering algorithm for large databases

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
OPTICS: ordering points to identify the clustering structure

SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Data clustering: a review

ACM Computing Surveys (CSUR)
Logical foundation of fuzzy preferential systems with application to the electre decision aid methods

Computers and Operations Research - Special issue on artificial intelligence and decision support with multiple criteria
Enumerating all connected maximal common subgraphs in two graphs

Theoretical Computer Science
Algorithm 457: finding all cliques of an undirected graph

Communications of the ACM
WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
A Fast Algorithm for Density-Based Clustering in Large Database

PAKDD '99 Proceedings of the Third Pacific-Asia Conference on Methodologies for Knowledge Discovery and Data Mining
Community detection in large-scale social networks

Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis
Metaheuristics: From Design to Implementation

Metaheuristics: From Design to Implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a meta-heuristic algorithm for clustering objects that are described on multiple incommensurable attributes defined on different scale types. We make use of a bipolar-valued dual similarity-dissimilarity relation and perform the clustering process by first finding a set of cluster cores and then building a final partition by adding the objects left out to a core in a way which best fits the initial bipolar-valued similarity relation.