CLUSTERING

APPROACHES/METHODS

  • I. Basic Problems
    1.1. Clustering
    1.2. Classification
    1.3. Sorting (multicriteria ranking)
    1.4. Hard clustering
    1.5. Fuzzy clustering
    1.6. Approximate clustering
    1.7. Dynamic clustering
    1.8. Clustering in large-scale data sets/networks
    1.9. Time-series clustering
  • II. Basic Approaches/Methods/Measurement issues
    2.1. Hierarchical clustering
    2.2. K-means clustering
    2.3. Spectral clustering
    2.4. Consensus clustering (voting-based consensus of cluster ensembles, consensus partitions)
    2.5. Cross-entropy method for clustering
    2.6. Clustering as assignment
    2.7. Support vector clustering
    2.8. Symbolic clustering
    2.9. Conceptual clustering
    2.10. Probabilistic methods in clustering
    2.11. Graph-based clustering (combinatorial approaches/models)
    2.12. Knowledge-based clustering, preference based clustering, interactive man-machine methods
    2.13. Neural networks based methods for clustering
    2.14. Region-based clustering
    2.15. Segmentation problems
    2.16. Clustering ensemble algorithms
    2.17. Measures of clustering quality
  • III. Combinatorial Aprpoaches/Methods
    3.1. Set partitioning
    3.2. Minimum spanning tree based clustering
    3.3. Clique/based clustering, clique-oriented aprpoaches (maximum clique problem, multi-partite clique proble, clique in multipartite grapgh, morphological clique)
    3.4.Correlation clustering
    3.5.Network communities based clustering (modularity, cliques, etc.)
    3.6. Cluster editing problems
    3.7. Dominant set based clustering
    3.8. Covering based clustering
  • IV. Other approaches to clustering
    4.1. Mulicriteria/multi-objective clustering
    4.2. Clustering of multi-type objects
    4.3. Multidimensional scaling
  • V. Main criteria for clustering solutuions
    5.1. Intra-cluster distance/proximity
    5.2. Size of cluster
    5.3. Number of clusters
    5.4. Inter-cluster distance/proximity
    5.5. Correlation clustering functional
    5.6. Quality of modularity
    5.7. Multicriteria quality
    5.8. Measurement methods for sorting solutions

    MAIN APPLICATIONS

    1. Data mining and knowledge discovery
    2. Chemistry, biology, gene expression, etc.
    3. Web systems, web services, information retireval
    4. Pattern recognition, image processing
    5. Medical/technical diagnosis
    6. Anomaly detection
    7. VLSI design
    8. Network design and management (communicaiton netwokrs, sensor networks)
    9. Routing in communication networks
    10. Economics/management (planning, marketing)
    11. Social network analysis
    12. Clustering in/of data streams
    13. Systems monitoring
    14. Education (evaluation, analysis, etc. )

    Researchers

  • 1. Prof. J.K. Jain (Michigan State Univ., College of Engineering, Dept. of CS and Engineering) (clustering, computer vision, pattern recognition, machine learning, image processing)
  • 2. Prof. Mark E.J. Newman (Michigan Univ., Dept. of Physics, Center of Study of Complex Systems) (network communities strcutures, network analysis)
  • 3. Prof. Donald C. Wunsch II, (Missouri Univ. nof Sceince and Technology, Dept. of Electrical and Computer Eng.) (clustering, neural networks, dynamic programming, evolutionary computation, fuzzy systems, etc.)
  • 4. Prof. Boris G. Mirkin (Birkbeck College, London, UK) (clustering, statistics, data mining, text analysis)
  • 5. Prof. Daniel Keim (Univ. of Konstanz, Germany) (clustering, data mining, multimedia databases, high-dimensional spaces, visualization, etc.)
  • 6. Pror. Hans-Peter Kriegel (Ludwig-Maximilians Universitat Munchen - LMU Munich, Germany) (data mining, clustering, correlation clustering, high dimensional data, ensemble methods)
  • 7. Prof. Tomas Seidl, RWTH Aachen Univ., Germany (Clustering, data mining, databases)
  • 8. Prof. Jorg Sander (Univ. of Alberta, Canada) (data mining, spatial and temporal data, clustering)
  • 9. Dr. Arthur Zimek (Ludwig-Maximilians Universitat Munchen - LMU Munich, Germany) (data mining, clustering, high dimensional data, ensemble methods)
  • 10. Prof. Nabil Becalel, National Research Council Canada (Information and Communications Technologies)
  • 11. Prof. Vladimir Batagelj, Univ. of Lubljana, Slovenia (clustering, social network analysis)
  • 12. Prof. Anuska Ferligoj, Univ. of Lubljana, Slovenia (clustering, social network analysis)
  • 13. Prof. Eva Tardos (Cornell Univ.) (general, approximation algorithms, networking, network design, routing, clustering, facility location, etc.)
  • 14. Prof. Jon Kleinberg (Cornell Univ.) (general, networking, etc.)
  • 15. Prof. Michael Trick (CMU, Tepper School of Business) (general, graph coloring, timetabling, combinatorial Benders approaches, etc.)
  • 16. Prof. James F. Peters (Univ. of Manitoba, Winnipeg, Canada) (topology of digital mages, visual patterns, pattern discovery, proximity spaces, near sets, etc.)
  • 17. Prof. Clara Rocha (Instituto Politecnico de Coimba, Portugal)
  • 18. Prof. Michel X. Goemans (MIT) (approximation algorithms, primal-dual algorithms, randomized algorithms, TSP, spanning trees, covering, general assignment problem, networking, scheduling, semidefinite programming, etc.)
  • 19. Prof. Michael O. Ball (Univ. of Maryland) (cliques, networking, transportation, logistics, etc.)
  • 20. Prof. Gilbert Laporte (HEC Montreal) (general, etc.)
  • 21. Prof. Matthias Erhgott (The Univ. of Auckland) (multicriteria combinatorial optimization, approximation algorithms, etc.)
  • 22. Prof. Xavier Gandibleux (The Univ. of Nantes) (multicriteria combinatorial optimization, global optimization, evolutionary multiobjective optimization, approximation algorithms, application in transportation, communication, etc.)
  • 23. Prof. Vangelis Th. Paschos (LAMSADE, Univ. Paris-Dauphine) (general, graph coloring, Steiner problem, TSP, approximation algorithms, on-line algorithms, reoptimization, etc.)
  • 24. Prof. Lior Rokach (Ben-Gurion Univ., Dept. of Information Systems Engineering, Israel) (machine learning, information retrieval, recommender systems, etc.)
  • 25. Prof. Nenad Mladenovic (Brunel Univ., UK) (AI, metaheuristics, location, clustering)
  • 26. Prof. Alexander V. Kelmanov (Sobolev Inst. of Mathematics, Russian Acad. of Sci.) (discrete olptimization, clusteting, pattern recognition, etc.)
  • 27. Prof. Shai Ben-David (Dept. of CS, Univ. of Waterloo) (foundations of clustering, classification tasks, machine learning, etc.)
  • 28. Prof. Margareta Ackerman (Dept. of CS, Florida State Univ.) (theoretical foundations of clustering, information retrieval, etc.)

    Research Groups, and Centers

  • Center for Discrete Mathematics & Theoretical Computer Science (DIMACS) (New Jersey, USA)
  • LANCS INITIATIVE Foundational Operational Research: Building Theory for Practice (UK Universities: Lancaster Univ., Nottingham Univ., Cardiff Univ., Southhampton Univ.)

    Journals

  • J. of Classification
  • Journal of Heuristcs
  • ACM Computing Surveys
  • ACM Trans. on KDD
  • SIAM Reviews
  • SIAM J. on Discrete Mathematics
  • SIAM J. on Optimization
  • SIAM J. on Computing
  • Applied Discrete Mathematics
  • INFOR
  • Networks
  • Naval Research Logistics
  • Operations Research Letters
  • Information Research Letters
  • Journal of Global Optimization
  • Journal of Algorithms
  • Omega
  • Discrete Optimization
  • TOP
  • Information Processing Letters
  • Theoretical Computer Science
  • Algorithmic Operations Research
  • International Transactions in Operational Research
  • Informatica (Lith.)
  • Data Mining and Knowledge Discovery
  • Pattern Recognition
  • Pattern Recognition Letters
  • Information Systems
  • Data Mining and Knowledge Discovery
  • Data and Knowledge Engineering
  • Fuzzy Sets and Systems
  • Int. Journal of Pattern Recognition and Artificial Intelligence
  • Journal of Machine Learning Research
  • Machine Learning
  • IEEE Trans. on KDE
  • IEEE Trans. on PAMI
  • IEEE Trans. on Fuzzy Systems
  • IEEE Trans. on SMC
  • IEEE Trans. on Mobile Computing
  • IEEE Trans. on Neural Networks
  • IEEE Trans. on Service Computing
  • Proc. of the IEEE
  • The Computer Journal
  • Computer Communications
  • Ad Hoc Networks
  • Int. Journal of Artificial Intelligence Tools
  • Annals of Operations Research
  • Computers and Industrial Engineering
  • Knowledge Information Systems
  • Journal of Combinatorial Optimization
  • Operations Research
  • Eur. Journal of Operational Research
  • Journal of the Operational Research Society
  • Computers and Operations Research
  • Algorithmica

    Bibliography

  • Basic Books
    1. M.R. Anderberg, Cluster Analysis for Applications. Academic Press, New York, 1973.
    1. Th. H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, Introduction to Algorithms. The MIT Press, 2009.
    2. M.R. Garey, and D.S. Johnson, Computers and Intractability. The Guide to the Theory of NP-Completeness.
    San-Francisco: W.H. Freeman and Company, 1979.
    3. A. Gordon, Classification. 2nd ed., Chapman and Hall, London, 1999.
    4. A.K. Jain, R.C. Dubes, Algorithms for clustering data. Prentice Hall, Upper Saddle River, NJ, 1988.
    5. B.G. Mirkin, Group Choice. Winston, New York, 1979.
    6. B.G. Mirkin, Mathematical Classification and Clustering. Kluwer, 1996.
    7. B.G. Mirkin, Clustering for Data Mining: A Data Recovery Approach. Chapman & Hall/CRC, Boca Raton, FL, 2005.
    8. M.E.J. Newman, Networks: an Introduction. Oxford Univ. Press, Oxford, 2010.
    9. J.V. de Oliveira, W. Pedrycz, Advances in Fuzzy Clustering and Its Applications. Wiley, 2007.
    10. W. Pedrycz, Knowledge-Based Clustering: From Data to Information Granules. Wiley, Hoboken, NJ, 2005.
    11. B. Roy, Multicriteria Methodology for Decision Aiding. Kluwer, Dordrecht, 1996.
    12. R.Y. Rubinstein, D.P. Kroese, The Cross Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation and Machine Learning. Springer, 2004.

  • Collective Monographs
    1. F. Aleskerov, B. Goldengorin, P.M. Pardalos (Eds.) Clusters, Orders, and Trees: Methods and Applciations. Springer, 2014.
    2. P. Arabie, L.J. Hubert, G. De Soete (Eds.), Clustering and Classification. World Scientific, 1996.
    3. S.K. Halgamuge, L. Wang (eds), Classification and Clustering for Knowledge Discovery. Springer, 2005.
    4. D.S. Johnson, and M.A. Trick, (Eds.), Cliques, Coloring, and Satisfiability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 26, Providence: AMS, 1996.
    5. J. Van Ryzin (Ed.), Classification and Clustering. Academic Press, New York, 1977.

  • Books
    1. A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms. Addison Welsey, Reading, MA, 1974.
    2. R. Baeza-Yates, B. Ribeiro-Neto, Modern Information Retrieval. Addison-Wesley, 1999.
    3. P. Baldi, G. Hatfield, DNA Microarrays and Gene Expression. Cambridge Univ. Press, 2002.
    4. S. Bandyopadhyay, S. Saha, Unsupervised Classification: Similarity Measures, Classical and Metaheuristic Approaches. Springer, 2013.
    5. M.J.A. Berry, G. Linoff, Data Mining Techniques for Marketing, Sales and Customer Support. Wiley, 1996.
    6. M.W. Berry, M. Browne, Understanding Search Engines: Mathematical Modeling and Text Retrieval. SIAM, 1999.
    7. L. Billard, E. Diday, Symbolic Data Analysis. Wiley, 2007.
    8. I. Borg, P.J.F. Groenen, Modern Multidimensional Scaling: Theory and Applications. 2nd ed., Springer, New York, 2005.
    9. W.P. Cook, M. Kress, Ordinal Information and Preference Structures: Decision Models and Applications. Prentice-Hall, Englewood Cliffs, 1992.
    10. T.F. Cox, M.A.A. Cox, Multidimensional Scaling. CRC Press, 2000.
    11. M.L. Davidson, Multidimensional Scaling. Wiley, 1983.
    12. B. Duran, P. Odell, Cluster Analysis: A Survey. Springer, New York, 1974.
    13. B. Goldengorin, D. Krushinsky, P.M. Pardalos, Cell Formation in Industrial Engineering: Theory, Algorithms and Experiments. Springer, 2013.
    14. B.I. Goldengorin, Requiremments of Standards: Optimization Models and Algorithms. Hoogezand, The Netherlands: Operations Research Co., 1995.
    15. P.E. Green, F.J. Carmone Jr., S.M. Smith, Multidimensional Scaling: Concepts and Applications. Allyn and Bacon, Boston, 1989.
    16. J. Han, M. Kamber, Data Mining: Concepts and Techniques. 2nd ed., Morgan Kaufmann, 2005.
    17. D.J. Hand, H. Mannila, P. Smyth, Principles of Data Mining. The MIT Press, 2001.
    18. J.A. Hartigan, Clustering algorithms. Wiley, New York, 1975.
    19. F. Hoppner, F. Klawonn, R. Kruse, Fuzzy Cluster Analysis: Methods for Classification, Data Analysis, and Image Recognition. Wiley, New York, 1999.
    20. L.J. Hubert, Assignment Methods in Combinatorial Data Analysis. M. Dekker, New York, 1987.
    21. L. Kaufman, P.J. Rousseeuw, Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, 1990.
    22. V. Kumar, M. Steinbach, P.-N. Tan, Introduction to Data Mining. Addison-Wesley, 2005.
    23. M. Last, A. Kandel, Data mining in time series databases. World Sceintific, 2004.
    24. C.D. Manning, P. Raghavan, H. Schutze, Introduction to Information Retrieval. Cambridge Univ. Press, 2008.
    25. S. Miyamoto, Fuzzy Sets in Information Retrieval and Cluster Analysis. Kluwer, Dordrecht, 1990.
    26. F. Murtagh, Multidimensional Clustering Algorithms. Physica-Verlag, Vienna, 1985.
    27. S. Wassserman, K. Faust, Social Network Analysis: Methods and Applications. Cambridge Univ. Press, Cambridge, 1994.
    28. P. Willett, Similarity and Clustering in Chemical Information Systems. Research Studies Press, Letchworth, 1987.
    29. R. Xu, D. Wunsch, Clustering. Wiley-IEEE Press, 2009.
    30. F.W. Yuang, Multidimensional Scaling: History, Theory, and Applications. Psychology Press, 2013.
    31. J. Zupan, Clustering of Large Data Sets. Research Studies Press Ltd., Taunton, UK, 1982.

  • Bibliography Surveys
    1. Matthias Ehrgott, A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spectrum, 22(4), 425-460, 2000.
    2. V. Kumar, S. Minz, Feature selection: a literature review. Smart Comput. Review 4(3), 211--229, 2014.
    3. E.W.T. Ngai, L. Xiu, D.C.K. Chau, Application of data mining techniques in customer relationship management: A literature review and classification. ESwA 36(2), 2592--2602, 2009.

  • Surveys
    1. S. Aghabozorgi, A.S. Shirkhorshidi, T.Y. Wah, Tme-series clustering - A decade review. Information Systems 53, 16--38, 2015.
    2. E. Balas, M. Padberg, Set partitioniong: survey. SIAM Rev., 18(4), 710-760, 1976.
    3. A. Baraldi, P. Blonda, A survey of fuzzy clustering algorithms for pattern recognition - Part I and II. IEEE Trans. SMC, Part B, 29(6), 778--801, 1999.
    4. P. Berkhin, A survey of clustering data mining techniques. In: Grouping Multidimensional Data, Springer, 25--71, 2006.
    5. A.K. Jain, M.N. Murty, P.J. Flynn, Data clustering: a review, ACM Computing Surveys, 1999, vol 31, no. 3, pp. 264-323.
    6. B. Mirkin, I. Muchnik, Combinatorial optimization in clustering. In: D.-Z. Du, P.M. Pardalos (Eds.), Handbook of Combinatorial Optimization. vol. 2, Springer, New York, pp. 261--329, 1999.
    7. A.A. Abbasi, M. Younis, A survey on clustering algorithms for wireless sensor networks. Computer Communications 30(14), 2826--2841, 2007.
    8. H. Bock, Probabilistic models in cluster analysis. Comput. Statist. Data Anal. 23, 5--28, 1996.
    9. C. Carpineto, S. Osinski, R. Romano, D. Weiss, A survey of Web clustering engines. ACM Comput. Surv. 41, 1--38, 2009.
    10. V. Chandola, A. Banerjee, V. Kumar, Anomaly detection: A survey. ACM Computing Surveys 41(3), Article no. 15, 2009.
    8. R. Dave, R. Krishnapuram, Robust clustering methods: A unified view. IEEE Trans. Fuzzy Syst. 5(2), 270--293, 1997.
    11. P.T. de Boer, D.K. Kroese, S. Mannor, R.Y. Rubinstein. A tutorial on the cross-entropy method. Annals of Operations Research 134, 19--67, 2005.
    12. A.A. Dorofeyuk, Methods for automatic classification: A review. Automation and Remote Control 32(12), 1928--1958, 1971.
    13. G.M. Downs, J.M. Barnard, Clustering methods and their uses in computational chemistry. In: K.B. Lipkowitz, D.B. Boyd (eds), Reviews in Computational Chemistry, vol. 18, Wiley, 1--40, 2002.
    14. A. Ferligoj, V. Batagelj, Direct multicriteria clustering algorithms. J. of Classification 9(1), 43--61, 1992.
    15. J. Ghosh, A. Acharya, Cluster ensembles. Data Mining \& Knowledge Discovery, 1(4), 305--315, 2011.
    16. L. He, L.D. Wu, Y.C. Cai, Survey of clustering algorithms in data mining. Application Research in Computers 1, 55--57, 2007.
    17. E.R. Hruschka, R.G.B. Campello, A.A. Freitas, A.P.L. Carvalho, A survey of evolutionary algorithms for clustering. IEEE Trans SMC, Part C 39(2), 133-–155, 2009.
    18. L. Hubert, P. Arabie, Comparing partitions. J. of Classification 2, 193--218, 1985.
    19. A.K. Jain, Data clustering: 50 years beyond k-means. Pattern Recogn. Lett. 31(8), 651--666, 2010.
    20. A.K. Jain, R. Duin, J. Mao, Statistical pattern recognition: A review. IEEE Trans. PAMI 22(1), 4-37, 2000.
    21. A.K. Jain, M.N. Murty, P.J. Flynn, Data clustering: a review. ACM Computing Surveys 31(3), 264--323, 1999.
    22. D. Jiang, C. Tang, A. Zhang, Cluster analysis for gene expression data: A survey. IEEE Trans. KDE 16(11), 1370--1386, 2004.
    23. R. Kannan, S. Vempala, A. Vetta, On clustering: Good, bad and spectral. J. of the ACM 51(3), 497--515, 2004.
    24. S.B. Kotsiantis, Supervised machine learning: A review of classification techniques. Informatica 31(3), 249--2658, 2007.
    25. H.-P. Kriegel, P. Kroger, A. Zimek, Clustering high dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM Trans. KDD, 3(1), 1--58, 2009.
    26. M.Sh. Levin, Combinatorial clustering: literature review, methods, examples. Electronic Scientific Journal "Information Processes", 15(2), 212-248, 2015 (in Russian)
    27. B. Mirkin, I. Muchnik, Combinatorial optimization in clustering. In: D.-Z. Du, P.M. Pardalos (Eds.), Handbook of Combinatorial Optimization. volume 2, Springer, New York, 261--329, 1999.
    28. S. Ronen, O. Shenkar, Clustering countries on attitudinal dimensions: A review and synthesis. Academy of Management Review, 435--454, 1985.
    29. H.M. Selim, R.G. Askin, A.J. Vakharia, Cell formation in group technology: review, evaluation and direction for future research. Computers & Industrial Engineering 34(1), 3--20, 1998.
    30. P. Willett, Recent trends in hierarchical document clustering: a critical review. Information Processing & Management 24(5), 577--597, 1988.
    31. J. Xie, S. Kelley, B.K. Szymanski, Overlapping community detection in networks: The state-of-the-art and comparative study. ACM Computing Surveys 45(4), art. 443, 2013.
    32. R. Xu, D. Wunsch II, Survey on clustering algorithms. IEEE Trans. Neural Networks 16(3), 645--678, 2005.
    33. J. Yang, J. Leskovec, Overlapping communities explain core-periphery organization of networks. Proc. of the IEEE 102(12), 1892--1902, 2014.
    34. O. Younis, S. Fahmy, HEED: A hybrid, energy-efficient, distributed clustering approach for Ad Hoc sensor networks. IEEE Trans. Mob. Comput. 3(4), 366--379, 2004.
    35. M. Zait, H. Messatfa, A comparative study of clustering methods. Future Generation Computer Systems 13(2-3), 149--159, 1997.
    36. C. Zopounidis, M. Doumpos, Multicriteria classification and sorting methods: a literature review. EJOR 138(2), 229--246, 2002.

  • Some basic papers
    1. M. Ball and M. Magazine, The design and analysis of heuristics. Networks, 11(2), 215-219, 1981.
    2. N. Bansal, A. Blum, S. Chawla, Correlation clustering. Machine Learning 56(1-3), 89--113, 2004.
    3. C. Fraley, A.E. Raftery, How many clusters? Which clustering method? Answers via model-based cluster analysis. The Computer J. 41(8), 578--588, 1998.
    4. J. Gower, G. Ross, Minimum spanning trees and single linkage cluster analysis. J. of the Royal Statistical Society, Series C (Applied Statistics) 18(1), 54--64, 1969.
    7. R.M. Karp. Reducibility among combinatorial problems. In: Complexity of Computer Computations, 85-103, Plenum Press, 1972.
    8. R.M. Karp, Combinatorics, Complexity, and Randomness. Comm. of the ACM, 29(2), 98-109, 1986.
    9. D. Knuth, A. Ratghunathan, The problem of compatible representatives. SIAM J. on Discr. Math., 5(3), 422-427, 1992.
    10. W. Rand, Objective criteria for the evaluation of clustering methods. J. of the American Statistical Association 66, 846--850, 1971.
    11. R.Y. Rubinstein, Cross-entropy and rare-events for maximal cut and partition problems. ACM Trans. on Modeling and Computer Simulation 12(1), 27--53, 2002.
    12. R. Shamir, R. Sharan, D. Tsur, Cluster graph modification problems. Discrete Applied Mathematics 144 (1–2), 173–-182, 2004.
    13. R.N. Shepard, Multidimensional scaling: Tree-fitting, and clustering. Science 210(4468), 390--398, 1980.
    14. S.P. Smith, R.C. Dubes, Stability of hierarchical clustering. Pattern Recognition 12(3), 177--187, 1980.
    15. D.A. Spielman, S.-H. Teng, A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning. SIAM J. Comput. 42(1), 1--26, 2013.
    16. W.S. Torgerson, Multidimensional scaling: I. Theory and method. Psychometrica 17, 401--419, 1952.
    17. C.S. Wallace, D.M. Boulton, An information measure for classification. The Computer J. 11, 185--194, 1968.
    18. R. Yager, Intelligent control of the hierarchical agglomerative clustering process. IEEE Trans. SMC 30(6), 835--845, 2000.

  • Papers
    1. M. Ackerman, S. Ben-David, Measures of clustering quality: A working set of axioms for clustering. In: Advances in Neural Information Processing Systems (NIPS), MIT Press, 121--128, 2008.
    2. G. Agarwal, D. Kempe, Modularity maximizing network communities using mathematical programming. The European Physical Journal B, 66, 409--418, 2008.
    3. R. Agrawal, J. Gehrke, D. Gunopulos, P. Raghavan, Automatic subspace clustering of high dimensional data. Data Mining and Knoweldge Discovery, 11(5), 5--33, 2005.
    4. K. Al-Sultan, A Tabu search algorithm to the clustering problem. Pattern Recogn. 28(9), 1443--1451, 1995.
    5. G. Alexe, S. Alexe, P.L. Hammer, Pattern-based clustering and attribute analysis. Soft Computing 10(5), 442--452, 2006.
    6. P. Arabie, J.D. Carrol, W.S. DeSarbo, J. Wind, Overlapping clustering: A new method for product positioning. J. of Marketing Research 18, 310-317, 1981.
    7. P. Arabie, L.J. Hubert, Cluster analysis in marketing research. In: Advanced Methods in marketing Research. Blackwell, Oxford, 160--189, 1994.
    8. J.G. Augston, J. Minker, An analysis of some graph theoretical clustering techniques. J. of the ACM 17(4), 571--588, 1970.
    9. H. Ayad, M.S. Kamel, On voting-based consensus of cluster ensembles. Pattern Recognition 43(5), 1943--1953, 2010.
    10. G. Babu, M. Nurty, Clustering with evolution strategy. Pattern Recogn. Lett. 14(10), 763--769, 1993.
    11. F. Bach, M.I. Jordan, Learning spectral clustering with applications to speach separation. J. of Machine Learning Research 7, 1963--2001, 2006.
    12. S. Bandyopadhyay, E.J. Coyle, Minimizing communication costs in hierarchically-clustered networks of wireless sensors. Computer Networks 44(1), 1--16, 2004.
    13. W. Barbakh, C. Fife, Online clustering algorithms. Int. J. of Neural Systems 18(03), 185--194, 2008.
    14. J.-P. Barthelemy, B. Leclerc, B. Monjardet, On the use of ordered sets in problems of comparison and consensus of classifications. J. of Classification, 3(2), 17--24, 1986.
    15. M.P. Beck, B.W. Lin, Some heuristics for the consensus ranking problem. Computers and Operations Research 10(1), 183, 1--7, 1983.
    16. A. Benslimane, T. Taleb, R. Sivaraj, Dynamic clustering-based adaptive mobile gateway management in integrated VANET -3G heterogeneous wireless networks. IEEE J. on Selected Areas in Communications 29(3), 559--570, 2011.
    17. A. Ben-Dor, R. Shamir, Z. Yakhini, Clustering gene expression patterns. J. of Computational Biology 6(3–4), 281--292, 1999.
    18. A. Ben-Hur, D. Horn, H. Siegelman, V. Vapnik, Support vector clustering. J. Mach. Learn. Res. 2(0), 125--137, 2001.
    19. J. Beringer, E. Hullermeier, Online clustering of parallel data streams. Data \& Knowledge Engineering 58(2), 180--204, 2006.
    20. J. Bezdek, N. Pal, Some new indexes of cluster validity. IEEE Trans. SMC, Part B, 28(3), 301--315, 1998.
    21. S. Boker, S. Briesemeister, G.W. Klau, Going weighted: Exact algoroithms for cluster editing: Evaluation and experiments. Algorithmica, 60(2), 316--334, 2011.
    22. D. Boley, M. Gini, R. Gross, S. Han, K. Hastings, G. Kapyris, V. Kumar, B. Mobasher, J. Moor, Partitioning-based clustering of web document categorization. DSS 25(3), 329--341, 1999.
    23. I.M. Bomze, M. Budinich, P.M. Pardalos, M. Pelillo, The maximum clique problem. In: D.-Z. Du, P.M. Pardalos (Eds.), Handbook of Combinatorial Optimization. (Supp. vol. A), Springer, New York, 659-729, 1999.
    24. V.L. Brailovsky, A probabilistic approach to clustering. Pattern Recogn. Lett. 12(4), 193--198, 1991.
    25. U. Brandes, D. Delling, M. Gaertler, R. Gorke, M. Hoefer, Z. Nikolosk, D. Wagner, On modularity clustering. IEEE Trans KDE 20, 172--188, 2008.
    26. M.M. Bronstein, A.M. Bronstein, R. Kimmel, I. Yavneh, Multigrid multidimensional scaling. Numerical Linear Algebra with Applications 13(2-3), 149--171, 2006.
    27. D. Brown, C. Huntley, A practical application of simulated annealing to clustering. Pattern Recogn. 25(4), 401--412, 1992.
    28. I. Charon, O. Hundry, Optimal clustering in multipartite graph. Discrete Applied Mathematics 156(8), 1330--1347, 2008.
    29. M. Chatterjee, S.K. Das, D.A. Turgut, WCA: A weighted clustering algorithm for mobile Ad Hoc networks. Cluster Computing 5(2), 193--204, 2002.
    30. B. Chazelle, A functional approach to data structures and its use in multidimensional scaling. SIAM J. on Computing 17, 427--462, 1988.
    31. W.-P. Chen, J.C. Hou, L. Sha, Dynamic clustering for acoustic target tracking in wireless sensor networks. IEEE Trans. Mobile Computing 3(3), 258--271, 2004.
    32. P. Chen, S. Redner, Community structure of the physical review citation network. J. of Informetrics 4(3), 278--290, 2010.
    33. Y. Chen, J.H. Lv, F.L. Han, X.H. Yu, On the cluster consensus of discrete-time multi-agent systems. Systems and Control Lettes 60, 517--523, 2011.
    34. C.H. Cheng, A branch-and-bound clustering algorithm. IEEE Trans. SMC 25, 895--898, 1995.
    35. T.W. Cheng, D.B. Goldgof, L.O. Hall, Fast fuzzy clustering. Fuzzy Sets and Systems 93(1), 49--56, 1998.
    36. C. Chiu, A case-based customer classification approach for direct marketing. ESwA 22(2), 163--168, 2002.
    37. C.H. Chu, Cluster analysis in manufactruring cellular formation. Omega 17(3), 289--295, 1989.
    38. C.-W. Chu, J.D. Holliday, P. Willett, Combining multiple classification of chemical structures using consensus clustering. Bioorganic \& Medicinal Chemistry 20(18), 5366-5371, 2012.
    39. M.C. Clark, L.O. Hall, D.B. Goldgof, R. Velthuizen, F.R. Murtagh, M.S. Silbiger, Automatic timor segmentation using knowledge-based techniques. IEEE Trans. on Medical Imaging 17(2), 187-201, 1998
    40. A. Clauset, M. E. J. Newman, and C. Moore, Finding community structure in very large networks. Physical Review E, vol. 70, no. 066111, 2004.
    41. J. Coble, D.J. Cook, L.B. Holder, Structure discovery in sequentially-connected data streams. Int. J. on Artificial Intelligence Tools 15(6), 917--944, 2006.
    42. A. Condon, R.M. Karp, Algorithms for graph partitioning on the planted partition model. Random Structures and Algorithms 18, 116--140, 2001.
    43. R. Coppi, P. D'Urso, Fuzzy K-means clustering models for triangular fuzzy time trajectories. Statist. Methods Appl. 11(1), 21--40, 2002.
    44. D.G. Corneil, Y. Perl, Clustering and domination in perfect graphs. Discrete Applied Mathematics 9(1), 27--39, 1984.
    45. J.A. Costa, N. Patwari, A.O. Hero III, Distributed weighted multidimensional scaling for node localization in sensor networks. ACM Trans. on Sensor Networks 2(1), 39--64, 2006.
    46. M.C. Cowgill, R.J. Harvey, L.T. Watson, A genetic algorithm approach to cluster analysis. Comput. Math. Appl. 37(7), 99--108, 1999.
    47. F. Crespo, R. Weber, A methodology for dynamic data mining based on fuzzy clustering. Fuzzy Sets and Systems 150(2), 267--284, 2005.
    48. P. Damaschke, Fixed-parameter enumerability of cluster editing and related problems. Theory Computing Sys. 46, 261--283.
    49. S. Dasgupta, P.M. Long, Performance guarantees for hierarchical clustering. J. of Computer and System Sciences 70(4), 555---569, 2005.
    50. M. Dawande, P. Keskinocak, J.M. Swaminathan, S. Tayur, On bipartite and multipartite clique problems. J. of Algorithms 41(2), 388--403, 2001.
    51. S.G. de Amorim, J.-P. Barthelemy, C.C. Ribeiro, Clustering and clique partitioning: Simulated annealing and tabu search approaches. J. of Classification 9(1), 17--41, 1992.
    52. E.D. Demaine, D. Emanuel, A. Fiat, N. Immorlica, Correlation clustering in general weighted graphs. Theoretical Computer Science 361(2), 172--187, 2006.
    53. E. Diday, The symbolic approach in clustering. In: K.S. Fu (ed), Digital Pattern Recongnition, Springer, 47--94, 1988.
    54. U. Dorndorf, E. Pesch, Fast clustering algorithms. ORSA J. of Computing 6(2), 141-153, 1994.
    55. D. Duan, Y. Li, R. Li, Z. Lu, Incremantal K-clique clustering in dynamic social networks. Artificial Intelligence Review 38(2), 129--147, 2012.
    56. J. Duch, A. Arenas, Community detection in complex networks using extremal optimization. Physical Review E, vol. 72, no. 027104, 2005.
    57. P. D'Urso, P. Giordani, A weighted fuzzy c-means clustering model for fuzzy data. Computational Statistics & Data Analysis 50, 1496--1523, 2006.
    58. T. Eltoft, R. de Figueiredo, A new neural netowrk for cluster-detection-and-labeling. IEEE Trans. Neural Netw. 9(5), 1021--1035, 1998.
    59. G. Even, J. Naor, S. Rao, B. Schieber, Fast approximate graph partitioning algorithms. SIAM J. on Computing 28(6), 2187--2214, 1999.
    60. N. Fanizzi, C. d'Amato, F. Esposito, Metric-based stochastic conceptual clustering for ontologies. Information Systems 34(8), 792--806, 2009.
    61. M.R. Fellows, J. Guob, C. Komusiewicz, R. Niedermeier, J. Uhlmann, Graph-based data clustering with overlaps. Discrete Optimization 8(1), 2–-17, 2011.
    62. M. Friedman, M. Last, Y. Makover, A. Kandel, Anomaly detection in web documents using crisp and fuzzy-based cosine clustering methodology. Inf. Sci. 177(2), 467--475, 2007.
    63. H. Frigui, R. Krishnapuram, A robust competitive clustering algorithm with applications in computer vision. IEEE Trans. PAMI 21(5), 450--465, 1999.
    64. S. Ghiasi, A. Srivastava, X. Yang, M. Sarrafzadeh, Optimal energy aware clustering in sensor networks. Sensors 2(7), 258--269, 2002.
    65. J. Goldberger, T. Tassa, A hierarchical clustering algorithm based on the Hungarian method. Pattern Recognition Letters 29(11), 1632--1638, 2008.
    66. T.F. Gonzalez, Clustering to minimize the maximum intercluster distance. Theoret. Comput. Sci. 38, 293--306, 1985.
    67. P.K. Gopalan, D.M. Blei, Efficient discovery of overlapping communities in massive networks. PNAS 110(36), 14534--14539, 2013.
    68. K.C. Gowda, E. Diday, Symbolic clustering using a new simalirity measure. IEEE Trans. SMC 22(2), 368--378, 1992.
    69. J. Gramm, J. Guo, F. Huffner, R. Niedermeier, Graph-modeled data clustering: Fixed-parameter algorithm for clique generation. Theory of Computing Systems 38(4), 373--392, 2005.
    70. D. Graves, W. Pedrycz, Kernel-based fuzzy clustering and fuzzy clustering: A comparative experimental study. Fuzzy Sets and Systems 161(4), 522--543, 2010.
    71. S. Grossman, M. Miller, K. Cone, D. Fischel, D. Ross, Clustering and competition in asset markets. J. of Low and Economics 40, 23--60, 1997.
    72. O. Grygorash, Y. Zhou, Z. Jorgensen, Minimum spanning tree based clustering algorithms. In: Proc. of 18th IEEE Int. Conf. on Tools with Artificial Intelligence ICTAI'06, 73--81, 2006.
    73. A. Guenoche, Consensus partitions: a constructive approach. Adv. Data Analysis and Classification 5(3), 215--229, 2011.
    74. S. Guha, R. Rastogi, K. Shim, ROCK: A robust clustering algorithm for categorical attributes. Inf. Syst. 25(5), 345--366, 2000.
    75. S. Guha, N. Mishra, R. Motwani, L. O'Callagham, Clustering data streams. In: Proc. of the Annual Symp. on Foundations of CS FOCS 2000, 359--366, 2000.
    76. J. Guo, A more effective linear kernelization for cluster editing. Theor. Comput. Sci. 410(8-10), 718--726, 2009.
    77. M. Halkidi, Y. Batistakis, M. Vazirgiannis, On clustering validation techniques. J. of Intelligent Information Systems 17, 107--145, 2001.
    78. B. Han, W. Jia, Clustering wireless ad hoc networks with weakly connected dominating set. J. of Parallel and Distributed Computing 67(6), 727--737, 2007.
    79. M.S. Handcock, A.E. Raftery, J.M. Tantrum, Model-based clustering for social networks. J. of the Royal Statistical Soociety: Series A (Statistics in Society) 170(2), 301--354, 2007.
    80. P. Hansen, B. Jaumard, Cluster analysis and mathematical programming. Mathematical Programming: Series A and B 79(1-3), 191--215, 1997.
    81. P. Hansen, J. Brimberg, D. Urosevic, N. Mladenovic, Solving large p-median clustering problems by primal-dual variable neighborhood search. Data Mining and Knowledge Discovery 19(3), 351--375, 2009.
    82. J.A. Hartigan, M.A. Wong, A K-mean clustering algorithm. J. of the Royal Statistical Society, Ser. C, 28(1), 100--108, 1979.
    83. Z. He, X. Xu, S. Deng, A cluster ensemble method for clustering categorical data. Information Fusion 6(2), 143--151, 2005.
    84. W.B. Heinzelman, A.P. Chandrakasan, H. Balakrishnan, An applciation-specific protocol architecture for wireless microsensor networks. IEEE Trans on Wireless Communicaitons 1(4), 660-670, 2002.
    85. S. Hirano, S. Tsumoto, Rough clustering and its application to medicine. J. of Information Science 124, 125--137, 2000.
    86. E.W. Holman, Completely nonmetric multidimensional scaling. J. of Mathematical Psychology 18, 39--51, 1978.
    87. J. Hopcroft, O. Khan, B. Kulis, B. Selman, Tracking evolving communities in large linked networks. PNAS 101(Suppl 1), 5249--5353, 2004.
    88. J.Z. Huang, M.K. Ng, H. Rong, Z. Li, Automated variable weighting in k-means type clustering. IEEE Trans. PAMI 27(5), 657--668, 2005.
    89. R.K.R. Indukuri, S.V. Penumathsa, Dominating sets and spanning tree based clustering algorithms for mobile ad hoc networks. Int. J. of Advanced Computer Science and Applications 2(2), 75--81, 2011.
    90. M.A. Ismail, S.Z. Selim, Fuzzy c-means: Optimality of solutions and effective termination of the problem. Pattern Recognition 19(6), 481--485, 1986.
    91. M.A. Ismail, M.S. Kamel, Multidimensional data clustering utilizing hybrid search strategies. Pattern Recognition, 22(1), 75--89, 1989.
    92. F. Janssens, L. Zhang, B. De Moor, W. Glanzel, Hybrid clustering for validation and improvement of subject-classification schemes. Information Processing and Management 45(6), 683--702, 2009.
    93. A.A. Kamal, S.M. Alyeid, M.S. Mahmoud, Multistage clustering: An efficient technique in socioeconomic field experiments. IEEE Trans. SMC 11(12), 779--785, 1981.
    94. B. Kamgar-Parsi, J.A. Gualtieri, J.A. Devaney, K. Kamgar-Parsi, Clustering with neural networks. Biol. Cybern. 63(3), 201--208, 1990.
    95. K. Kaneko, Relevance of dynamic clustering to biological networks. Physica D: Nonlinear Phenomena 75(1), 55--73, 1994.
    96. T. Kanungo, D. Mount, N. Netanyahu, C. Piatko, R. Silverman, A. Wu, An efficient K-means clustering algorithm: Analysis and implementation. IEEE Trans. PAMI 24(7), 881--892, 2000.
    97. G. Karypis, R. Aggarwal, V. Kumar, S. Shekhar, Multilevel hypergraph partitioning: Application in VLSI domain. IEEE Trans. Very Large Scale Integration Systems (VLSI) 7(1), 69--79, 1999.
    98. B. Kernigham, S. Lin, An efficient heuristic procedure for partitioning graphs. Bell Systems Technical J. 49, 291--307, 1970.
    99. D.J. Ketchen, C.L. Shook, The application of cluster analysis in strategic management research and critique. Strategic Management J. 17(6), 441--458, 1996.
    100. D.-W. Kim, K.H. Lee, D. Lee, Fuzzy clustering of categorical data using fuzzy centroids. Pattern Recognition Letters 25, 1263--1271, 2004.
    101. J.M. Kleinberg, An impossibility theorem for clustering. In: Advances in Neural Information Processing Systems (NIPS 2002), 15, 446--453, 2002.
    102. L. Kleinrock, F. Kamoun, Optimal clustering structures for hierarchical topological design of large computer networks. Networks 10, 221--248, 1980.
    103. G. Kochenberg, F. Glover, B. Alidaee, H. Wang, Clustering of microarray data via clique partitioning. J. of Combinatorial Optimization 10(1), 77--92, 2005.
    104. K. Krishna, M. Murty, Genetic K-means algorithm. IEEE Trans. SMC, Part B 29(3), 433--439, 1999.
    105. R. Krishnapuram, H. Frigui, O. Nasraoui, Fuzzy and probabilistic shell clustering algorithms and their applications to boundary detection and surface approximation. IEEE Trans. Fuzzy Systems 3(1), 29--60, 1995.
    106. D.P. Kroese, R.Y. Rubinstein, T. Taimre, Application of the cross-entropy method for clustering and vector quantization. J. of Global Optimization 37(1), 137--157, 2007.
    107. A.C. Kumari, K. Srinivas, Software module clustering using a fast multi-objective hyper-heuristic evolutionary algorithm. Int. J. of Applied Information Systems 5(6), 12--18, 2012.
    108. R.K. Kwatera, B. Simeone, Clustering heuristics for set covering. Annals of Operations Research 43(5), 295--308, 1993.
    109. M. Kyperountas, A. Tefas, I. Pitas, Dynamic training using multistage clustering for face recognition. Pattern Recognition 41(3), 894--905, 2008.
    110. Lai Y.C., Lin P., Liao W., Chen C.M., A region-based clustering mechanism for channel access in vehucular and ad hoc networks. IEEE J. on Selected Area in Communications 29(1), 83-93, 2011.
    111. T. Lange, M. Braun, V. Roth, J.M. Buhmann, Stability-based validation of clustering solutions. Neural Computation 16(6), 1299--1323, 2004.
    112. M. Last, Online classification of nonstationary data streams. Intell. Data Anal. 6(2), 129--147, 2007.
    113. G. Latsoudas, N.D. Sidiropoulos, A fast and effective multidimensional scaling approach for node localization in wireless sensor netwokrs. IEEE Trans. on Signal Processing 55(10), 5121--5127, 2007.
    114. Y. Lechevallier, R. Verde, F. de A.T. Carvalho, Symbolic clustering of large datasets. In: V. Batagelj, H.-H. Bock, A. Ferligoj, Z. Ziberna (eds), Data Science and Classification. Springer, 193--201, 2006.
    115. J.-G. Lee, J. Han, K.-Y. Whang, Trajectory clustering: A partition-and group framework. In: Proc. 2007 ACM SIGMOD Int. Conf. on Management of Data, 593--604, 2007.
    116. L.P. Lefkovitch, Multi-criteria clustering in genotype environment interaction problems. Theoretical and Applied Genetics 70, 585--589, 1985.
    117. J. Leskovec, K.J. Lang, A. Dasgupta, M.W. Mahoney, Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Math. 6, 29--123, 2009.
    118. E. Lesser, J. Storck, Communities of practice and organizational performance. IBM Syst. J. 40(4), 831--841, 2001.
    119. D. Li, K.D. Wong, Y.H. Hu, A.M. Sayeed, Detection, classification, tracking of targets in micro-sensor networks. IEEE Signal Processing Magazine 19(2), 17--29, 2002.
    120. H. Li, Y. Ping, Recent advances in support vector clustering: theory and applications. Int. J. of Pattern Recognition and Artificial Intelligence 29(01), 16--43, 2015.
    121. X. Liu, T. Murata, Detecting communities in k-partite k-uniform (hyper)networks. J. of Computer Science and Technology 26(5), 778--791, 2011.
    122. Z. Lu, T.K. Leen, Penalized probabilistic clustering. Neural Networks 19(6), 1528--1567, 2007.
    123. N. Lucas, B. Zalik, K.R. Zalik, Sweep-hyperplan clustering algorithm using dynamic model. Informatica 25(4), 563--580, 2014.
    124. S.C. Madeira, A.L. Oliveira, Biclustering algorithms for biological data analysis: A survey. IEEE/ACM Trans. Computat. Biol. Bioinformatics 1(1), 24-45, 2004.
    125. P. Maji, S.K. Pal, RFCM: A hybrid clustering algorithm using rough and fuzzy sets. Fundamenta Informaticae 80(), 475--496, 2007.
    126. B. Mannaa, Cluster editing problem for points on the real time: A polynomial time algorithm. Inform. Proc. Lett. 110, 961--965, 2010.
    127. Z. Marx, I. Dagan, J.M. Buhmann, E. Shamir, Coupled clustering: A method for detecting structural correspondence. J. of Machine Learning Research 3, 747--780, 2002.
    128. F. Massuli, A. Schenone, A fuzzy clustering based segmentation system as support to diagnosis in medical imaging. Artificial Intelligence in Medicine 16(00), 129--147, 1999.
    129. U. Maulik, S. Bandyopadhyay, Performance evaluation of some clustering algorithms and validity indices. IEEE Trans. PAMI 24(12), 1650--1654, 2002.
    130. A. Mehrotra, M.A. Trick, Cliques and clustering: A combinatorial approach. Operations Research Lett. 22(1), 1--12, 1998.
    131. M. Meila, D. Heckerman, An experimental comparison of model-based clustering methods. Machine Learning 42(1-2), 9--29, 2001.
    132. S. Mimaroglu, M. Yagci, CLICOM: Cliques for combining multiple clusterings. ESwA 39(2), 1889--1901, 2012.
    133. J.W. Moon, L. Moser, On cliques in graphs. Israel J. of Mathematics 3(1), 23--28, 1965.
    134. M.N. Murty, A.K. Jain, Knowledge-based clustering scheme for collection management and retrieval of library books. Pattern Recognition 28(7), 949--964, 1995.
    135. M.E.J. Newman, Detecting community structure in networks. Eur. Phys. J. B 38(2), 321--330, 2004.
    136. M.E.J. Newman, Modularity and community structure in networks. PNAS 103(23), 8577--8582, 2006.
    137. M. E. J. Newman and M. Girvan, Finding and evaluating community structure in networks. Physical Review E, vol. 69, no. 026113, 2004.
    138. T.M. Nguyen, Q.M.J. Wu, Dynamic fuzzy clustering and its application in motion segmentation. IEEE Trans. on Fuzzy Systems 21(6), 1019--1031, 2013.
    139. C. Olson, Parallel algorithms for hierarchical clustering. Parallel Comput. 21, 1313--1325, 1995.
    140. M. Oosten, J.G.C. Rutten, F.C.R. Spieksma, The clique partitioning problem: Facets and patching facets. Networks 38(4), 209--226, 2001.
    141. T. Opsahl, P. Panzarasa, Clustering in weighted networks. Social Networks 31(2), 155--163, 2009.
    142. I.H. Osman, N. Christofides, Capacitated clustering problems by hybrid simulated annealing and tabu search. Int. Trans. on Operations Research 1(3), 317--336, 1994.
    143. M.M. Ozdal, C. Ayakznat, Hypergraph models and algorithms for data-pattern-based clustering. Data Mining and Knowledge Discovery 9(1), 29--57, 2004.
    144. T. Ozyer, R. Alhajj, Parallel clustering of high dimensional data by integrating multi-objective genetic algorithm with divide and conquer. Applied Intelligence 31(3), 318-–331, 2009.
    145. M. Paasivaara, C. Lassenius, Communities of practice in a large distributed agile software development organization - Case Ericsson. Information and Software Technology 56(12), 1556--1577, 2014.
    146. N. Paivinen, Clustering with a minimum spanning tree of scale-free-like structure. Pattern Recogn. Lett. 26(7), 921--930, 2005.
    147. S.K. Pal, S. Mitra, Fuzzy dynamic clustering algorithm. Pattern Recogn. Lett. 11(8), 525--535, 1990.
    148. P.M. Pardalos, J. Xue, The maximum clique problem. J. of Global Optimization 4(3), 301--328, 1994.
    149. M. Pavan, M. Pelillo, Dominant sets and pairwise clustering. IEEE Trans. PAMI 29(1), 167--172, 2007.
    150. S.J. Peter, S.P. Victor, A novel algorithm for dual similarity clusters using minimum spanning tree. J. of Theoretical and Applied Information Technology 14(1), 60--66, 2010.
    151. P. Pons, M. Latapy, Computing communities in large networks using random works. J. of Graph Algorithms and Applications 10, 191--218, 2006. 152. M.A. Porter, J.-P. Onnela, P.J. Mucha, Communities in networks. Notices of the AMS 56(9), 1082--1097,1164, 2009.
    153. J. Puzicha, T. Hofmann, J.M. Buhmann, Theory of proximity based clustering: Structure detection by optimization. Pattern Recognition 33(4), 617-634, 2000.
    154. C. Rocha, L.C. Dias, I. Dimas, Multicriteria classification with unknown categories: A clustering-sorting approach and an application to conflict management. J. of Multi-Criteria Decision Analysis 20(1-2), 13--27, 2013.
    155. C. Rocha, L.C. Dias, MPOC - an agglomerative algorithm for multicriteria partially ordered clustering. 4OR 11(3), 253--273, 2013.
    156. F. Saeed, N. Salim, A. Abdo, Voting-based consensus clustering for combining multiple clusterings of chemical structures. J. of Cheminformatics 4(37), 1--8, 2012.
    157. M. Sato-Ilic, Dynamic fuzzy clustering using fuzzy cluster loading. Int. J. General Systems 35(2), 209--230, 2006.
    158. M. Sato-Ilic, Symbolic clustering with interval-valued data. Procedia Computer Science 6, 358--363, 2011.
    159. A. Schenker, M. Last, H. Bunke, A. Kandel, Classification of web documents using graph matching. Int. J. of Pattern Recognition and Artificial Intelligence 18(3), 475--496, 2004.
    160. A. Schuffenhaer, N. Brown, P. Ertl, J.L. Jenkins, P. Selzer, J. Hamon, Clustering and rule-based classificaitons of chemical structures evaluated in the biological activity space. J. Chem. Inf. Model. 47(2), 325--336, 2007.
    161. S. Selim, K. Alsultan, A simulated annealing algorithm for the clustering problems. Pattern Recognition 24(10), 1003--1008, 1991.
    162. O. Shamir, N. Tishby, Stability and model selection in k-means clustering. Machine Learning 80(2-3), 213--243, 2010.
    163. G. Sheikholeslami, C. Chattterjee, A. Zhang, WaveCluster: a wavelet-based clustering approach for spatial data in very large databases. The VLDB J. 8(3-4), 289--304, 2000.
    164. B. Shekar, N.M. Murty, G. Krishna, A knowledge-based clustering scheme. Pattern Recogn. Lett. 5(4), 253--259, 1987.
    165. M.P. Sinka, D.W. Corne, A large banchmark dataset for web ducument clustering. Soft Computing Systems: Design, Management and Applications 87, 881--890, 2002.
    166. D. Skoutas, D. Sacharidis, A. Simitsis, T. Sellis, Ranking and clustering web services using multicriteria dominance relationships. IEEE Trans. on Service Computing 3(3), 163--177, 2010.
    167. R.E. Stepp, R.S. Michalski, Conceptual clustering of structured objects: A goal-oriented approach. Artif. Intell. 28(1), 43--69, 1986.
    168. A. Strehl, J. Ghosh, Cluster ensembles - a knowledge reuse framework for combining multiple partitions. J. of Machine Learning Research 3, 583--617, 2002.
    169. C.S. Sung, H.W. Jin, A Tabu-search-based heuristic for clustering. Pattern Recognition 33(5), 849--858, 2000.
    170. J. Tabor, P. Spurek, Cross-entropy clustering. Pattern Recognition 47(9), 3046--3059, 2014.
    171. A. Trifunovic, W.J. Knottenbelt, Parallel multilevel algorithms for hypergraph partitioning. J. of Parallel and Distributed Computing 68(5), 563--581, 2008.
    172. C.-F. Tsai, H.-F. Yeh, J.-F. Chang, N.-H. Liu, PHD: an efficient data clustering scheme using partition space technique for knowledge discovery in large databases. Appl. Intell. 33(1), 39--53, 2010.
    173. L.Y. Tseng, S.B. Yang, A genetic approach to the automatic clustering problem. Pattern Recogn. 34(2), 415--424, 2001.
    174. K. Tumer, A.K. Agogino, Ensemble clustering with voting active clusters. Pattern Recogn. Lett. 29(14), 1947--1953, 2008.
    175. A. Vashist, C.A. Kulikowsky, I. Muchnik, Orthlog clustering on a multipartite graph. IEEE/ACM Trans. Comput. Biology and Bioinformatics 4(1), 17--27, 2007.
    176. D. Walsh, L. Rybicki, Symptom clustering in advanced cancer. Supportive Care in Cancer 14(8), 831--836, 2006.
    177. C.-H. Wang, Outlier identification and market segmentation using kernel-based clustering techniques. ESwA 36(2), Part 2, 3744--3750, 2009.
    178. X. Wang, X. Wang, D.M. Wikes, A divide-and-conquer approach for minimum spanning tree-based clustering. IEEE Trans. KDE 21(7), 945--958, 2009.
    179. C.C. Wong, C.C. Chen, A hybrid clustering and gradient descent approach for fuzzy modeling. IEEE Trans. SMC, Part B 29(6), 686--693, 1999.
    180. S. Wu, T.W.S. Chow, PRSOM: A new visualization mehtod by hybridizing multidimensional scaling and self-organizing map. IEEE Trans. on Neural Networks 16(6), 1362--1380, 2005.
    181. J. Yang, J. Leskovec, Designing and evaluation network communities based on ground-truth. Knowl. Inf. Syst. 42(1), 181--213, 2015.
    182. Y. Yang, M.S. Kamel, An aggregated clustering approach using multi-ant colonies algorithms. Pattern Recognition, 39(7), 1278--1289, 2006.
    183. M. Yu, K.K. Leung, A. Malvankar, A dynamic clustering and energy efficient routing technique for sensor networks. IEEE Trans. Wireless Communications 6(8), 3069--3079, 2007.
    184. O. Zamir, O. Etzioni, Grouper: a dynamic clustering interface to Web search results. Computer Networks 31(11), 1361--1374, 1999.
    185. S. Zhong, J. Ghosh, Generative model-based document clustering: a comparative study. Knowl. Inf. Syst. 8(3), 374--384, 2005.
    186. C. Zhong, D. Miao, R. Wang, A graph-theoretical clustering method based on two rounds of minimum spanning trees. Pattern Recognition 43(3), 752--766, 2010.

  • Technical Reports/Preprints
    1. S. Bagon, M. Galun, Optimizing large scale correlation clustering. Electronic preprint, 9 p., Dec. 13, 2011. http://arxiv.org/abs/1112.2903 [cs.CV]
    2. V. Batagelj, M. Zavershik, An O(m) algorithm for cores decomposition of networks. Electronic preprint, 10 p., Oct. 25, 2003. http://arxiv.org/abs/0310.0049 [cs.DS]
    3. V.D. Blondel, J.-L. Guillaume, R. Lambiotte, E. Lefebvre, Fast unfolding of communities in large networks. Electronic preprint. 12 p., July 25, 2008. http://arxiv.org/abs/0803.0476 [physics.soc-ph]
    4. T. Campbell, M. Liu, B. Kulis, J.P. How, L. Carin, Dynamic clustering via asymptotics of dependent Dirichlet process mixture. Electr. prepr. 9 pp., Nov. 1, 2013. http://arxiv.org/abs/1305.6659 [cs.LG]
    5. I. Dhillon, Y. Guan, B. Kulis, A unified view of kernel k-means, spectral clustering, and graph partitioning. Tehcnical Report No. UTCS TR-0425, U. of Texas at Austin, 2005.
    6. S. Fortunato, Community detection in graphs. Electronic preprint, 103 p., Jan. 25, 2010. http://arxiv.org/abs/0906.0612v2 [physics.soc-ph]
    7. I. Gunes, H. Bingol, Community detection in complex networks using agents. Electronic preprint, 5 p., Oct. 23, 2006, arXiv:cs/0610129 [cs.MA]
    8. Y. Han, W. Lu, T. Chen, Cluster consensus in discrete-time networks of multi-agents with inter-cluster nonidentical inputs. Electronic preprint, 13 p., Mar. 9, 2013. http://arxiv.org/abs/1201.2803 [math.OC]
    9. P. Hansen, J. Brimberg, D. Urosevic, N. Mladenovic, Data Clustering using Large p-Median Models and Primal-Dual Variable Neighborhood Search. TR G-2007-41, 2007 GERAD, June 2007.
    10. Z. Hussain, M. Meila, Graph-sensitive indices for comparing clusterings. Electronic preprint, 15 p., Nov. 27, 2014. http://arxiv.org/abs/1411.7582 [cs.LG]
    11. R. Jovanovic, M. Tuba, S. Voss, An ant colony optimization algorithm for partitioning graphs with supply and demand. Electr. prep. 21 p., March 3, 2015. http://arxiv.org/abs/1503.00899 [cs.AI]
    12. M.Sh. Levin, Composite strategy for multicriteria ranking/sorting (methodological issues, examples). Electronic preprint. 24 p., Nov. 9, 2012. http://arxiv.org/abs/1211.2245 [math.OC]
    13. M.Sh. Levin, Towards Combinatorial Clustering: Preliminary Research Survey. Electronic preprint. 102 p., May 28, 2015.
    http://arxiv.org/abs/1505.07872 [cs.AI]
    14. X. Liu, T. Murata, K. Wakita, Extending modularity by capturing the similarity attraction feature in the null model. Electronic preprint. 10 p., Feb. 12, 2013. http://arxiv.org/abs/1210.4007 [cs.SI]
    15. U. von Luxburg, A tutorial on spectral clustering. Electronic preprint, 32 p., Nov. 2007. http://arxiv.org/abs/0711.0189 [cs.DS]
    14. M.E.J. Newman, Fast algorithm for detecting community structure in networks. Electronic preprint. 5 p., Sep. 22, 2003. http://arxiv.org/abs/0309508 [cond-mat.stat-mech]
    15. A. Noack, R. Rotta, Multi-level algorithms for modularity clustering. Electronic preprint. 12 p., Dec. 22, 2008. http://arxiv.org/abs/0812.4073 [cs.DC]
    16. A.A.V. Sastry, K. Netti, A parallel sampling based clustering. Electronic preprint, 3 pp., Dec. 5, 2014. http://arxiv.org/abs/1412.1947 [cs.LG]
    17. M. Steinbach, G. Karypis, V. Kumar, A comparison of document clsutering techniques. TR 00-034, Dept. of CS, U. of Minnesota, May 2000.
    18. K. Wakita, T. Tsusumi, Finding community structure in mega-scale social networks. Electronic preprint. 9 p., Fev. 8, 2007. http://arxiv.org/abs/0702.2048 [cs.CY]

  • PhD Theses
    1. P. Bajcsy, Hierarchical segmentation and clustering using similarity analysis. PhD Dissertation, Dept. of CS, Univ. of Illinois at Urbana-Champaign, 1997.
    2. D. Kumlander, Some Practical Algorithms to Solve The Maximum Clique Problem. PhD Thesis, Tallin Univ. of Techn, 2005.
    3. R.R. Mettu, Approximation algorithms for NP-hard clustering problems. PhD Thesis, Dept. of CS, Univ. of Texas at Austin, Aug. 2002.
    4. Arthur Zimek, Correlation Clustering. PhD Thesis, Faculty of Mathematics, Informatics, and Statistics, Univ. of Munchen, 2008.
    5. Konstantin S. Solnushkin, Automated Design of Computer Clusters. PhD dissertation, Ludvig-Maximilians-Universitat, Faculty of Informatics, 2014.
    6. Margareta Ackerman, Towards Theoretical Foundations of Clustering. Dept. of CS, Univ. of Waterloo, 2012.

  • MS Theses
    1. R. Rotta, A multi-level algorithm for modularity clustering. MS thesis, Brandenburg Univ. of Technology, 2008.
    2. M. Landberg, Approximation Algorithms for Maximization Problems arising in Graph Partitioning. MS thesis, Weizmann Inst. of Science, 1998.



    This material was prepared within framework of Russian Science Foundation grant 14-50-00150 ``Digital technologies and their applications'' (project of Inst. for Information Transmission Problems).