A Clustering Approach Using Weighted Similarity Majority Margins

  • Raymond Bisdorff
  • Patrick Meyer
  • Alexandru-Liviu Olteanu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7120)


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.


Maximal Clique Community Detection Discrimination Threshold Cluster Core Cluster Object 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    The Times Higher Education World University Rankings (2010-2011)Google Scholar
  2. 2.
    Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data (2005)Google Scholar
  3. 3.
    Ankerst, M., Breunig, M.M., Kriegel, H., Sander, J.: Optics: ordering points to identify the clustering structure. In: International Conference on Management of Data, pp. 49–60 (1999)Google Scholar
  4. 4.
    Berend, D., Tassa, T.: Improved bounds on bell numbers and on moments of sums of random variables. Probability and Mathematical Statistics 30, 185–205 (2010)MathSciNetzbMATHGoogle Scholar
  5. 5.
    Bisdorff, R.: Logical foundation of fuzzy preferential systems with application to the electre decision aid methods. Computers & Operations Research 27, 673–687 (2000)CrossRefzbMATHGoogle Scholar
  6. 6.
    Bisdorff, R.: Electre-like clustering from a pairwise fuzzy proximity index. European Journal of Operational Research 138(2), 320–331 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Bisdorff, R.: On clustering the criteria in an outranking based decision aid approach. In: Modelling, Computation and Optimization in Information Systems and Management Sciences, pp. 409–418. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  8. 8.
    Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575–577 (1973)CrossRefzbMATHGoogle Scholar
  9. 9.
    Cheeseman, P., Stutz, J.: Bayesian Classification (AutoClass): Theory and Results, ch. 6, pp. 62–83. AAAI Press, MIT Press (1996)Google Scholar
  10. 10.
    Du, N., Wu, B., Pei, X., Wang, B., Xu, L.: Community detection in large-scale social networks. In: WebKDD/SNA-KDD 2007: Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 Workshop on Web Mining and Social Network Analysis, pp. 16–25. ACM (2007)Google Scholar
  11. 11.
    Fortunato, S.: Community detection in graphs. Physics Reports 486(3-5), 75–174 (2010)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Frank, A., Asuncion, A.: UCI machine learning repository (2010)Google Scholar
  13. 13.
    Guha, S., Rastogi, R., Shim, K.: CURE: an efficient clustering algorithm for large databases. In: Haas, L., Drew, P., Tiwary, A., Franklin, M. (eds.) SIGMOD 1998: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, pp. 73–84. ACM Press (1998)Google Scholar
  14. 14.
    Jaccard, P.: Nouvelles recherches sur la distribution florale. Bulletin de la Societe Vaudoise de Sciences Naturelles 44, 223–370 (1908)Google Scholar
  15. 15.
    Jain, A., Dubes, R.: Algorithms for clustering data. Prentice-Hall, Inc. (1988)Google Scholar
  16. 16.
    Jain, A., Murty, M., Flynn, P.: Data clustering: A review. ACM Computing Survey 31(3), 264–323 (1999)CrossRefGoogle Scholar
  17. 17.
    Kaufman, L., Rousseeuw, P.J.: Finding Groups in Data An Introduction to Cluster Analysis. Wiley Interscience (1990)Google Scholar
  18. 18.
    Koch, I.: Enumerating all connected maximal common subgraphs in two graphs. Theoretical Computer Science 250(1-2), 1–30 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Kohonen, T.: Self-organising maps. Information Sciences (1995)Google Scholar
  20. 20.
    MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1 (1967)Google Scholar
  21. 21.
    McLachlan, G., Krishnan, T.: The EM algorithm and extensions. Wiley Series in Probability and Statistics, 2nd edn. Wiley (2008)Google Scholar
  22. 22.
    Meyer, P., Marichal, J.-L., Bisdorff, R.: Disaggregation of bipolar-valued outranking relations. In: An, L.T.H., Bouvry, P., Tao, P.D. (eds.) MCO. CCIS, vol. 14, pp. 204–213. Springer, Heidelberg (2008)Google Scholar
  23. 23.
    Moon, J., Moser, L.: On cliques in graphs. Israel Journal of Mathematics 3(1), 23–28 (1965)MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Mousseau, V.: Elicitation des préférences pour l’aide multicritére á la décision (2003)Google Scholar
  25. 25.
    Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Physical Review E 69(2) (2004)Google Scholar
  26. 26.
    Palla, G., Derenyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814–818 (2005)CrossRefGoogle Scholar
  27. 27.
    Sheikholeslami, G., Chatterjee, S., Zhang, A.: Wavecluster: A multi-resolution clustering approach for very large spatial databases. In: Proceedings of 24rd International Conference on Very Large Data Bases VLDB 1998, pp. 428–439. Morgan Kaufmann (1998)Google Scholar
  28. 28.
    Talbi, E.: Metaheuristics - From Design to Implementation. Wiley (2009)Google Scholar
  29. 29.
    Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: an efficient data clustering method for very large databases. In: SIGMOD 1996: Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, pp. 103–114. ACM Press (1996)Google Scholar
  30. 30.
    Zhou, B., Cheung, D.W., Kao, B.: A fast algorithm for density-based clustering in large database. In: Zhong, N., Zhou, L. (eds.) PAKDD 1999. LNCS (LNAI), vol. 1574, pp. 338–349. Springer, Heidelberg (1999)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Raymond Bisdorff
    • 1
  • Patrick Meyer
    • 2
    • 3
  • Alexandru-Liviu Olteanu
    • 1
    • 2
    • 3
  1. 1.CSC/ILIAS, FSTCUniversity of LuxembourgLuxembourg
  2. 2.Institut Télécom, Télécom Bretagne, UMR CNRS 3192Lab-STICC, Technopôle Brest IroiseBrest Cedex 3France
  3. 3.Université Européenne de BretagneFrance

Personalised recommendations