Database Reference
In-Depth Information
Dhillon, I. S. (2001). Co-clustering Documents
and Words using Bipartite Spectral Graph Parti-
tioning. In Proc. of ACM SIGKDD International
Conference on Knowledge Discovery and Data
Mining (KDD) (pp. 269-274).
Fowlkes, C., Belongie, S., Chung, F. R. K., &
Malik, J. (2004). Spectral Grouping Using the
Nyström Method. [PAMI]. IEEE Transactions on
Pattern Analysis and Machine Intelligence , 26 (2),
214-225. doi:10.1109/TPAMI.2004.1262185
Dhillon, I. S., Guan, Y., & Kulis, B. (2004). Kernel
K-means: Spectral Clustering and Normalized
Cuts. In Proc. of ACM SIGKDD International
Conference on Knowledge Discovery and Data
Mining (KDD) (pp. 551-556).
Grünwald, P. (2005). A Tutorial Introduction to
the Minimum Description Length Principle. In
P. Grünwald, I. J. Mynung, & M. Pitt, (Eds.) Ad-
vances in Minimum Description Length: Theory
and Applications . Cambridge, MA: MIT Press.
Ding, C. H. Q., & He, X. (2004). K-means Cluster-
ing via Principal Component Analysis. In Proc. of
International Conference on Machine Learning
(ICML) (pp. 225-232).
Hagen, L., & Kahng, A. (1992). New Spectral
Methods for Ratio Cut Partitioning and Cluster-
ing. IEEE Trans. Computer Aided Design , 11 (9),
1074-1085.
Ding, C. H. Q., He, X., Zha, H., Gu, M., & Simon,
H. (2001). A Min-max Cut Algorithm for Graph
Partitioning and Data Clustering. In Proc. of IEEE
International Conference on Data Mining (ICDM)
(pp.107-114).
Hamdan, H., & Govaert, G. (2005). Mixture
Model Clustering of Uncertain Data. In IEEE
International Conference on Fuzzy Systems (pp.
879-884).
Hamerly, G., & Elkan, C. (2003). Learning the K
in K-means. In Proc. of 16 th Annual Conference
on Advances in Neural Information Processing
Systems (NIPS).
Duda, R. O., & Hart, P. E. (1973). Pattern Clas-
sification and Scene Analysis . Hoboken, NJ: John
Wiley & Sons.
Ester, M., Kriegel, H.-P., Sander, J., & Xu, X.
(1996). A Density-based Algorithm for Discov-
ering Clusters in Large Spatial Databases with
Noise. In Proc. of ACM SIGKDD International
Conference on Knowledge Discovery and Data
Mining (KDD) (pp.226-231).
Jain, A. K., & Dubes, R. C. (1988). Algorithms
for Clustering Data . Upper Saddle River, NJ:
Prentice-Hall.
Kailing, K., Kriegel, H.-P., & Kröger, P. (2004).
Density-connected Subspace Clustering for High
Dimensional Data. In Proc. of SIAM Interna-
tional Conference on Data Mining (SDM) (pp.
246-257).
Feng, Y., & Hamerly, G. (2006). PG-means:
Learning the Number of Clusters in Data. In
Proc. of 19 th Annual Conference on Advances in
Neural Information Processing Systems (NIPS)
(pp. 393-400).
Kaufman, L., & Rousseeuw, P. J. (1990). Find-
ing Groups in Data: An Introduction to Cluster
Analysis . Wiley series in probability and math-
ematical statistics. Chichester, UK: John Wiley
and Sons.
Figueiredo, M. A. T., & Jain, A. K. (2002). Un-
supervised Learning of Finite Mixture Models.
[PAMI]. IEEE Transactions on Pattern Analy-
sis and Machine Intelligence , 24 (3), 381-396.
doi:10.1109/34.990138
Search WWH ::




Custom Search