Novel Trends in Clustering - Evolving Application Domains of Data Warehousing and Mining - page 210

Klein, D., Kamvar, D., & Manning, C. (2002).
From Instance-Level Constraints to Space-Level
Constraints: Making Most of Prior Knowledge
in Data Clustering. In Proc. of International
Conference on Machine Learning (ICML) (pp.
307-314).

Ng, A., Jordan, M., & Weiss, Y. (2002). On
Spectral Clustering: Analysis and an Algorithm.
[Cambridge, MA: MIT Press.]. Advances in Neural
Information Processing Systems , 14 , 849-856.

Ng, R. T., & Han, J. (1994). Efficient and Effective
Clustering Methods for Spatial Data Mining. In
Proc. of International Conference on Very Large
Data Bases (VLDB) (pp. 144-155).

Kriegel, H.-P., & Pfeifle, M. (2005). Density-
based Clustering of Uncertain Data. In Proc.
of ACM SIGKDD International Conference on
Knowledge Discovery and Data Mining (KDD)
(pp. 672-677).

Ngai, W., Kao, B., Chui, C., Cheng, R., Chau, M., &
Yip, K.Y. (2006). Efficient Clustering of Uncertain
Data. In Proc. of IEEE International Conference
on Data Mining (ICDM) (pp. 436-445). Kulis, B., Basu, S., Dhillon, I. S., & Mooney, R.

J. (2005). Semi-supervised Graph Clustering:
a Kernel Approach. In Proc. of International
Conference on Machine Learning (ICML) (pp.
457-464).

O'Callaghan, L., Meyerson, A., Motwani, M.,
Mishra, N., & Guha, S. (2002). Streaming-Data
Algorithms for High-Quality Clustering. In IEEE
Int ernational Conference on Data Engineering
(ICDE) (pp.685-). Li, Y., Han, J., & Yang, J. (2004). Clustering

moving objects. In Proc. of ACM SIGKDD In-
ternational Conference on Knowledge Discovery
and Data Mining (KDD) (pp.617-622).

Pelleg, D., & Moore, A. (2000) X-means: Ex-
tending K-means with Efficient Estimation of
the Number of Clusters. In Proc. of International
Conference on Machine Learning (ICML) (pp.
727-734).

Long, B., Zhang, Z., Wu, X., & Yu, P. S. (2006).
Spectral clustering for Multi-type Relational Data.
In Proc. of International Conference on Machine
Learning (ICML) (pp.585-592).

Procopiuc, C. M., Jonesý, M., Pankaj, K.,Agarwal,
M., & Muraliý, M. (2002). A Monte Carlo Algo-
rithm for Fast Projective Clustering. In Proc. of
ACM SIGMOD International Conference on Man-
agement of Data (SIGMOD) (pp. 418-427).

Meila, M. (2008). The Uniqueness of a Good
Optimum for K-means. In Proc. of International
Conference on Machine Learning (ICML) (pp.
625-632).

Shi, J., & Malik, J. (2000). Normalized Cuts and
Image Segmentation. IEEE Transactions on Pat-
tern Analysis and Machine Intelligence , 22 (8),
888-905. doi:10.1109/34.868688

Nagesh, H., Goil, S., & Choudhary, A. (2000).
A Scalable Parallel Subspace Clustering Algo-
rithm for Massive Data Sets. In Proc. of IEEE
International Conference on Parallel Processing
(pp.477-).

Slonim, N., & Tishby, N. (2000). Document
clustering using Word Clusters via the Informa-
tion Bottleneck Method. In Proc. of International
ACM/ SIGIR Conference on Research and Devel-
opment in Information Retrieval (pp. 208-215).

Nasraoui, O., Uribe, C. C., Coronel, C. R., &
Gonzales, F. (2003). TECNO-STREAMS: Track-
ing Evolving Clusters in Noisy Data Streams with
a Scalable Immune System Learning Model. In
Proc. of IEEE International Conference on Data
Mining (ICDM) (pp. 235-242).