메뉴 건너뛰기




Volumn 32, Issue 11, 2010, Pages 2006-2021

Detecting the number of clusters in n-way probabilistic clustering

Author keywords

affinity arrays; enumeration of clusters; estimation of PARAFAC components; higher order tensor; hypergraph; model order selection; multiway array; Multiway clustering; parallel factor analysis (PARAFAC); principal components enumeration; probabilistic clustering; supersymmetric tensors

Indexed keywords

AFFINITY ARRAYS; ENUMERATION OF CLUSTERS; HIGHER-ORDER TENSOR; HYPERGRAPH; MODEL ORDER SELECTION; MULTIWAY ARRAYS; MULTIWAY CLUSTERING; PARALLEL FACTOR ANALYSIS; PRINCIPAL COMPONENTS; PROBABILISTIC CLUSTERING; SUPERSYMMETRIC TENSOR;

EID: 78149283977     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2010.15     Document Type: Article
Times cited : (184)

References (63)
  • 1
    • 84864027458 scopus 로고    scopus 로고
    • Learning with hyper-graphs: Clustering, and classification, embedding
    • B. Schölkopf, J. Platt, and T. Hoffman, eds. MIT Press
    • D. Zhou, J. Huang, and B. Schölkopf, "Learning with Hyper-graphs: Clustering, and Classification, Embedding," Advances in Neural Information Processing Systems, B. Schölkopf, J. Platt, and T. Hoffman, eds., vol. 19, pp. 1601-1608, MIT Press, 2007.
    • (2007) Advances in Neural Information Processing Systems , vol.19 , pp. 1601-1608
    • Zhou, D.1    Huang, J.2    Schölkopf, B.3
  • 2
    • 0003878763 scopus 로고
    • first ed. North Holland, Aug.
    • C. Berge, Hypergraphs, first ed. North Holland, Aug. 1989.
    • (1989) Hypergraphs
    • Berge, C.1
  • 3
    • 33745844738 scopus 로고    scopus 로고
    • Multi-way clustering, using super-symmetric non-negative tensor factorization
    • Springer, July
    • A. Shashua, R. Zass, and T. Hazan, "Multi-Way Clustering, Using Super-Symmetric Non-Negative Tensor Factorization," Lecture Notes in Computer Science, vol. 3954, pp. 595-608, Springer, July 2006.
    • (2006) Lecture Notes in Computer Science , vol.3954 , pp. 595-608
    • Shashua, A.1    Zass, R.2    Hazan, T.3
  • 8
    • 78149285021 scopus 로고    scopus 로고
    • Information theory inference
    • Cambridge Univ. Press Sept.
    • D.J.C. MacKay, Information Theory, Inference and Learning Algorithms. Cambridge Univ. Press, Sept. 2003.
    • (2003) Learning Algorithms
    • MacKay, D.J.C.1
  • 11
    • 0033646780 scopus 로고    scopus 로고
    • Towards a standardized notation and terminology in multiway analysis
    • H.A. Kiers, "Towards a Standardized Notation and Terminology in Multiway Analysis," J. Chemometrics, vol. 14, no. 3, pp. 105-122, 2000.
    • (2000) J. Chemometrics , vol.14 , Issue.3 , pp. 105-122
    • Kiers, H.A.1
  • 12
    • 33746356349 scopus 로고    scopus 로고
    • A link between the canonical decomposition in multilinear algebra and simultaneous matrix diagonaliza-tion
    • L. De Lathauwer, "A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonaliza-tion," SIAM J. Matrix Analysis and Applications, vol. 28, no. 3, pp. 642-666, http://publi-etis.ensea.fr/2006/Del06, 2006.
    • (2006) SIAM J. Matrix Analysis and Applications , vol.28 , Issue.3 , pp. 642-666
    • De Lathauwer, L.1
  • 13
    • 68649096448 scopus 로고    scopus 로고
    • Tensor decompositions and applications
    • Sept.
    • T.G. Kolda and B.W. Bader, "Tensor Decompositions and Applications," SIAM Rev., vol. 51, no. 3, Sept. 2009.
    • (2009) SIAM Rev. , vol.51 , Issue.3
    • Kolda, T.G.1    Bader, B.W.2
  • 14
    • 0002740437 scopus 로고
    • Foundations of the parafac procedure: Models and conditions for an 'explanatory'
    • R.A. Harshman, "Foundations of the PARAFAC Procedure: Models and Conditions for an 'Explanatory'," UCLA Working Papers in Phonetics, vol. 16, pp. 1-84, 1970.
    • (1970) UCLA Working Papers in Phonetics , vol.16 , pp. 1-84
    • Harshman, R.A.1
  • 15
    • 0030813663 scopus 로고    scopus 로고
    • PARAFAC. tutorial and applications
    • Oct.
    • R. Bro, "PARAFAC. Tutorial and Applications," Chemometrics and Intelligent Laboratory Systems, vol. 38, no. 2, pp. 149-171, Oct. 1997.
    • (1997) Chemometrics and Intelligent Laboratory Systems , vol.38 , Issue.2 , pp. 149-171
    • Bro, R.1
  • 17
    • 34250499792 scopus 로고
    • Analysis of individual differences in multidimensional scaling via an n-way generalization of 'eckart-young' decomposition
    • Sept.
    • J.D. Carroll and J.-J. Chang, "Analysis of Individual Differences in Multidimensional Scaling via an n-Way Generalization of 'Eckart-Young' Decomposition," Psychometrika, vol. 35, no. 3, pp. 283-319, http://ideas.repec.org/a/spr/psycho/v35y1970i3p283-319.html, Sept. 1970.
    • (1970) Psychometrika , vol.35 , Issue.3 , pp. 283-319
    • Carroll, J.D.1    Chang, J.-J.2
  • 18
    • 0002740439 scopus 로고
    • Determination and proof of minimum uniqueness conditions for PARAFAC1
    • R.A. Harshman, "Determination and Proof of Minimum Uniqueness Conditions for PARAFAC1," UCLA Working Papers in Phonetics, vol. 22, pp. 111-117, 1972.
    • (1972) UCLA Working Papers in Phonetics , vol.22 , pp. 111-117
    • Harshman, R.A.1
  • 19
    • 0002317063 scopus 로고
    • Parafac2: Mathematical and technical notes
    • R.A. Harshman, "PARAFAC2: Mathematical and Technical Notes," UCLA Working Papers in Phonetics, vol. 22, pp. 30-47, 1972.
    • (1972) UCLA Working Papers in Phonetics , vol.22 , pp. 30-47
    • Harshman, R.A.1
  • 20
    • 78149281655 scopus 로고    scopus 로고
    • Doubly stochastic normalization for spectral clustering
    • B. Schölkopf, J. Platt, and T. Hoffman, eds. MIT Press
    • R. Zass and A. Shashua, "Doubly Stochastic Normalization for Spectral Clustering," Advances in Neural Information Processing Systems, B. Schölkopf, J. Platt, and T. Hoffman, eds., vol. 19, pp. 1569-1576, MIT Press, 2007.
    • (2007) Advances in Neural Information Processing Systems , vol.19 , pp. 1569-1576
    • Zass, R.1    Shashua, A.2
  • 21
    • 0041086070 scopus 로고
    • Multiplicatieve Decompositie van Interacties bij Oordelen over de Werkelijkheids-waarde van Televisiefilms [Multiplicative Decomposition of Interactions for Judgements of Realism of Television Films]
    • P.M. Kroonenberg and T.H.A. van der Voort, "Multiplicatieve Decompositie van Interacties bij Oordelen over de Werkelijkheids-waarde van Televisiefilms [Multiplicative Decomposition of Interactions for Judgements of Realism of Television Films]," Kwantitatieve Methoden, vol. 8, no. 23, pp. 117-144, 1987.
    • (1987) Kwantitatieve Methoden , vol.8 , Issue.23 , pp. 117-144
    • Kroonenberg, P.M.1    Voort Der Van, A.T.H.2
  • 22
    • 0001424792 scopus 로고
    • Tensor rank is np-complete
    • J. Hastad, "Tensor Rank Is NP-Complete," J. Algorithms, vol. 11, no. 4, pp. 644-654, 1990.
    • (1990) J. Algorithms , vol.11 , Issue.4 , pp. 644-654
    • Hastad, J.1
  • 23
    • 0034183641 scopus 로고    scopus 로고
    • Three-mode principal components analysis: Choosing the numbers of components and sensitivity to local optima
    • M.E. Timmerman and H.A.L. Kiers, "Three-Mode Principal Components Analysis: Choosing the Numbers of Components and Sensitivity to Local Optima," British J. Math. and Statistical Psychology, vol. 53, no. 1, pp. 1-16, 2000.
    • (2000) British J. Math. and Statistical Psychology , vol.53 , Issue.1 , pp. 1-16
    • Timmerman, M.E.1    Kiers, H.A.L.2
  • 24
    • 0038685059 scopus 로고    scopus 로고
    • A new efficient method for determining the number of components in parafac models
    • R. Bro and H.A.L. Kiers, "A New Efficient Method for Determining the Number of Components in PARAFAC Models," J. Chemometrics, vol. 17, no. 5, pp. 274-286, 2003.
    • (2003) J. Chemometrics , vol.17 , Issue.5 , pp. 274-286
    • Bro, R.1    Kiers, H.A.L.2
  • 25
    • 0038118127 scopus 로고    scopus 로고
    • A fast method for choosing the numbers of components in tucker3 analysis
    • May
    • H.A.L. Kiers and A. der Kinderen, "A Fast Method for Choosing the Numbers of Components in Tucker3 Analysis," British J. Math. and Statistical Psychology, vol. 56, no. 1, pp. 119-125, May 2003.
    • (2003) British J. Math. and Statistical Psychology , vol.56 , Issue.1 , pp. 119-125
    • Kiers, H.A.L.1    Der Kinderen, A.2
  • 26
    • 33745135758 scopus 로고    scopus 로고
    • Selecting among three-mode principal component models of different types and complexities: A numerical convex hull based method
    • May
    • E. Ceulemans and H.A.L. Kiers, "Selecting among Three-Mode Principal Component Models of Different Types and Complexities: A Numerical Convex Hull Based Method," British J. Math. and Statistical Psychology, vol. 59, no. 1, pp. 133-150, May 2006.
    • (2006) British J. Math. and Statistical Psychology , vol.59 , Issue.1 , pp. 133-150
    • Ceulemans, E.1    Kiers, H.A.L.2
  • 31
    • 0036018642 scopus 로고    scopus 로고
    • On the best rank-1 approximation of higher-order supersymmetric tensors
    • E. Kofidis and P.A. Regalia, "On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors," SIAM J. Matrix Analysis and Applications, vol. 23, no. 3, pp. 863-884, 2002.
    • (2002) SIAM J. Matrix Analysis and Applications , vol.23 , Issue.3 , pp. 863-884
    • Kofidis, E.1    Regalia, P.A.2
  • 32
    • 84899022480 scopus 로고    scopus 로고
    • Automatic choice of dimensionality for pca
    • T.K. Leen, T.G. Dietterich, and V. Tresp, eds MIT Press
    • T.P. Minka, "Automatic Choice of Dimensionality for PCA," Advances in Neural Information Processing Systems, T.K. Leen, T.G. Dietterich, and V. Tresp, eds, pp. 556-562, MIT Press, 2001.
    • (2001) Advances in Neural Information Processing Systems , pp. 556-562
    • Minka, T.P.1
  • 33
    • 58049218569 scopus 로고    scopus 로고
    • Dimension estimation in noisy PCA with SURE and random matrix theory
    • Dec.
    • M.O. Ulfarsson and V. Solo, "Dimension Estimation in Noisy PCA with SURE and Random Matrix Theory," IEEE Trans. Signal Processing, vol. 56, no. 12, pp. 5804-5816, Dec. 2008.
    • (2008) IEEE Trans. Signal Processing , vol.56 , Issue.12 , pp. 5804-5816
    • Ulfarsson, M.O.1    Solo, V.2
  • 34
    • 4344627165 scopus 로고    scopus 로고
    • A new method for estimating the number of harmonic components in noise with application in high resolution radar
    • E. Radoi and A. Quinquis, "A New Method for Estimating the Number of Harmonic Components in Noise with Application in High Resolution Radar," EURASIP J. Applied Signal Processing, vol. 2004, no. 8, pp. 1177-1188, 2004.
    • (2004) EURASIP J. Applied Signal Processing , vol.8 , pp. 1177-1188
    • Radoi, E.1    Quinquis, A.2
  • 35
    • 0029746573 scopus 로고    scopus 로고
    • Some Properties of Ordered Eigenvalues of a Wishart Matrix: Application in Detection Test and Model Order Selection
    • J. Grouffaud, P. Larzabal, and H. Clergeot, "Some Properties of Ordered Eigenvalues of a Wishart Matrix: Application in Detection Test and Model Order Selection," Proc. IEEE Int'l Conf. Acoustics, Speech, and Signal Processing, vol. 5, pp. 2463-2466, 1996.
    • (1996) Proc. IEEE Int'l Conf. Acoustics, Speech, and Signal Processing , vol.5 , pp. 2463-2466
    • Grouffaud, J.1    Larzabal, P.2    Clergeot, H.3
  • 38
    • 34250115918 scopus 로고
    • An examination of procedures for determining the number of clusters in a data set
    • June
    • G. Milligan and M. Cooper, "An Examination of Procedures for Determining the Number of Clusters in a Data Set," Psychometrika, vol. 50, no. 2, pp. 159-179, June 1985.
    • (1985) Psychometrika , vol.50 , Issue.2 , pp. 159-179
    • Milligan, G.1    Cooper, M.2
  • 39
    • 0023905024 scopus 로고
    • A criterion for determining the number of groups in a data set using sum-of-squares clustering
    • Mar.
    • W.J. Krzanowski and Y.T. Lai, "A Criterion for Determining the Number of Groups in a Data Set Using Sum-of-Squares Clustering," Biometrics, vol. 44, no. 1, pp. 23-34, Mar. 1988.
    • (1988) Biometrics , vol.44 , Issue.1 , pp. 23-34
    • Krzanowski, W.J.1    Lai, Y.T.2
  • 40
    • 0034343765 scopus 로고    scopus 로고
    • Estimating the number of clusters
    • June
    • M.F. Antonio Cuevas and R. Fraiman, "Estimating the Number of Clusters," The Canadian J. Statistics, vol. 28, no. 2, pp. 367-382, June 2000.
    • (2000) The Canadian J. Statistics , vol.28 , Issue.2 , pp. 367-382
    • Antonio Cuevas, M.F.1    Fraiman, R.2
  • 42
    • 0035532141 scopus 로고    scopus 로고
    • Estimating the number of clusters in a data set via the gap statistic
    • R. Tibshirani, G. Walther, and T. Hastie, "Estimating the Number of Clusters in a Data Set via the Gap Statistic," J. Royal Statistics Soc. (Series B), vol. 63, no. 2, pp. 411-423, 2001.
    • (2001) J. Royal Statistics Soc. (Series B) , vol.63 , Issue.2 , pp. 411-423
    • Tibshirani, R.1    Walther, G.2    Hastie, T.3
  • 44
    • 0242679438 scopus 로고    scopus 로고
    • Finding the number of clusters in a dataset: An information-theoretic approach
    • Sept.
    • C.A. Sugar and G.M. James, "Finding the Number of Clusters in a Dataset: An Information-Theoretic Approach," J. Am. Statistical Assoc., vol. 98, no. 463, pp. 750-763, Sept. 2003.
    • (2003) J. Am. Statistical Assoc. , vol.98 , Issue.463 , pp. 750-763
    • Sugar, C.A.1    James, G.M.2
  • 45
    • 36749055295 scopus 로고    scopus 로고
    • Determining the number of clusters using the weighted gap statistic
    • Apr.
    • M. Yan and K. Ye, "Determining the Number of Clusters Using the Weighted Gap Statistic," Biometrics, vol. 63, no. 4, pp. 1031-1037, Apr. 2007.
    • (2007) Biometrics , vol.63 , Issue.4 , pp. 1031-1037
    • Yan, M.1    Ye, K.2
  • 46
    • 0036565310 scopus 로고    scopus 로고
    • Cluster number selection for a small set of samples using the bayesian ying-yang model
    • Apr.
    • P. Guo, P. Chen, and M. Lyu, "Cluster Number Selection for a Small Set of Samples Using the Bayesian Ying-Yang Model," IEEE Trans. Neural Networks, vol. 13, no. 3, pp. 757-763, Apr. 2002.
    • (2002) IEEE Trans. Neural Networks , vol.13 , Issue.3 , pp. 757-763
    • Guo, P.1    Chen, P.2    Lyu, M.3
  • 47
    • 33845291376 scopus 로고    scopus 로고
    • Investigation on several model selection criteria for determining the number of cluster
    • X. Hu and L. Xu, "Investigation on Several Model Selection Criteria for Determining the Number of Cluster," Neural Information Processing\-Letters and Rev., vol. 4, no. 1, pp. 1-10, 2004.
    • (2004) Neural Information Processing\-Letters and Rev. , vol.4 , Issue.1 , pp. 1-10
    • Hu, X.1    Xu, L.2
  • 49
    • 0002629270 scopus 로고
    • Maximum likelihood from incomplete data via the em algorithm
    • Series B
    • A. Dempster, N. Laird, and D. Rubin, "Maximum Likelihood from Incomplete Data via the EM Algorithm," J. Royal Statistical Soc., Series B, vol. 39, no. 1, pp. 1-38, 1977.
    • (1977) J. Royal Statistical Soc. , vol.39 , Issue.1 , pp. 1-38
    • Dempster, A.1    Laird, N.2    Rubin, D.3
  • 50
    • 0016355478 scopus 로고
    • A new look at the statistical model identification
    • Dec.
    • H. Akaike, "A New Look at the Statistical Model Identification, " IEEE Trans. Automatic Control, vol. 19, no. 6, pp. 716-723, Dec. 1974.
    • (1974) IEEE Trans. Automatic Control , vol.19 , Issue.6 , pp. 716-723
    • Akaike, H.1
  • 51
    • 34250108028 scopus 로고
    • Model selection and akaike's information criterion (aic): The general theory and its analytical extensions
    • Sept.
    • H. Bozdogan, "Model Selection and Akaike's Information Criterion (AIC): The General Theory and its Analytical Extensions," Psychometrika, vol. 52, no. 3, pp. 345-370, Sept. 1987.
    • (1987) Psychometrika , vol.52 , Issue.3 , pp. 345-370
    • Bozdogan, H.1
  • 52
    • 0018015137 scopus 로고
    • Modelling by the shortest data description
    • J. Rissanen, "Modelling by the Shortest Data Description," Automatica, vol. 14, pp. 465-471, 1978.
    • (1978) Automatica , vol.14 , pp. 465-471
    • Rissanen, J.1
  • 53
    • 0032183995 scopus 로고    scopus 로고
    • The minimum description length principle in coding and modeling
    • Oct.
    • A. Barron, J. Rissanen, and B. Yu, "The Minimum Description Length Principle in Coding and Modeling," IEEE Trans. Information Theory, vol. 44, no. 6, pp. 2743-2760, Oct. 1998.
    • (1998) IEEE Trans. Information Theory , vol.44 , Issue.6 , pp. 2743-2760
    • Barron, A.1    Rissanen, J.2    Yu, B.3
  • 55
    • 84972893020 scopus 로고
    • A dendrite method for cluster analysis
    • T. Calinski and J. Harabasz, "A Dendrite Method for Cluster Analysis," Comm. Statistics, vol. 3, pp. 1-27, 1974.
    • (1974) Comm. Statistics , vol.3 , pp. 1-27
    • Calinski, T.1    Harabasz, J.2
  • 58
    • 0033592606 scopus 로고    scopus 로고
    • Learning the parts of objects by nonnegative matrix factorization
    • D.D. Lee and H.S. Seung, "Learning the Parts of Objects by Nonnegative Matrix Factorization," Nature, vol. 401, no. 6755, pp. 788-791, 1999.
    • (1999) Nature , vol.401 , Issue.6755 , pp. 788-791
    • Lee, D.D.1    Seung, H.S.2
  • 59
    • 84898964201 scopus 로고    scopus 로고
    • Algorithms for non-negative matrix factorization
    • T.K. Leen, T.G. Dietterich, and V. Tresp, eds. MIT Press
    • D.D. Lee and H.S. Seung, "Algorithms for Non-Negative Matrix Factorization," Advances in Neural Information Processing Systems, T.K. Leen, T.G. Dietterich, and V. Tresp, eds., pp. 556-562, MIT Press, 2001.
    • (2001) Advances in Neural Information Processing Systems , pp. 556-562
    • Lee, D.D.1    Seung, H.S.2
  • 60
    • 0035363672 scopus 로고    scopus 로고
    • From few to many: Illumination cone models for face recognition under variable lighting and pose
    • July
    • A. Georghiades, P. Belhumeur, and D. Kriegman, "From Few to Many: Illumination Cone Models for Face Recognition under Variable Lighting and Pose," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 6, pp. 643-660, July 2001.
    • (2001) IEEE Trans. Pattern Analysis and Machine Intelligence , vol.23 , Issue.6 , pp. 643-660
    • Georghiades, A.1    Belhumeur, P.2    Kriegman, D.3
  • 62
    • 0034210646 scopus 로고    scopus 로고
    • The mental prosthesis: Assessing the speed of a p300-based brain-computer interface
    • June
    • E. Donchin, K.M. Spencer, and R. Wijesinghe, "The Mental Prosthesis: Assessing the Speed of a P300-Based Brain-Computer Interface," IEEE Trans. Rehabilitation Eng., vol. 8, no. 2, pp. 174-179, June 2000.
    • (2000) IEEE Trans. Rehabilitation Eng. , vol.8 , Issue.2 , pp. 174-179
    • Donchin, E.1    Spencer, K.M.2    Wijesinghe, R.3
  • 63
    • 33644778869 scopus 로고    scopus 로고
    • P300-based brain computer interface: Reliability and performance in healthy and paralysed participants
    • Mar.
    • F. Piccione, F. Giorgi, P. Tonin, K. Priftis, S. Giove, S. Silvoni, G. Palmas, and F. Beverina, "P300-Based Brain Computer Interface: Reliability and Performance in Healthy and Paralysed Participants," Clinical Neurophysiology, vol. 117, no. 3, pp. 531-537, Mar. 2006.
    • (2006) Clinical Neurophysiology , vol.117 , Issue.3 , pp. 531-537
    • Piccione, F.1    Giorgi, F.2    Tonin, P.3    Priftis, K.4    Giove, S.5    Silvoni, S.6    Palmas, G.7    Beverina, F.8


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.