Information Technology Reference
In-Depth Information
Choi, B., & Guo, Q. (2003). Applying semantic links for classifying Web pages. Developments in Applied
Artificial Intelligence, IEA/AIE 2003. (Lecture Notes in Artificial Intelligence, 2718, pp.148-153).
Choi, B., & Peng, X. (2004). Dynamic and hierarchical classification of Web pages. Online Information
Review, 28 (2), 139-147.
Choi, B., & Yao, Z. (2005). Web page classification. In W. Chu & T. Lin (Eds.) , Foundations and Ad-
vances in Data Mining (pp. 221- 274). Springer-Verag.
Davies, D., & Bouldin D. (1979). A cluster separation measure. IEEE Transactions on Pattern Analysis
and Machine Intelligence, 1 (4), 224-227.
Dhillon, I., Fan J., & Guan, Y. (2001). Efficient clustering of very large document collections. In R.
Grossman, C. Kamath, P. Kegelmeyer, V. Kumar, & R. Namburu, (Eds.), Data Mining for Scientific
and Engineering Applications (357-381). Kluwer Academic Publisher.
Dudoit, S., & Fridlyand, J. (2002). A prediction-based resampling method to estimate the number of
clusters in a dataset. Genome Biology, 3 (7), 1-21.
Ester, M., Kriegel, H. P., Sander, J., & Xu, X. (1996). A density based algorithm for discovering clusters
in large spatial database with noise. International Conference on Knowledge Discovery in Databases
and Data Mining , Portland, OR.
Everitt, B. S., Landua, S., & Leese, M. (2001). Cluster analysis . London: Arnold.
Fiduccia, C. M., & Mattheyses, R. M. (1982, June). A Linear Time Heuristic for Improving Network
Partitions. In Proceedings 19th IEEE Design Automation Conference . Las Vegas, NV.
Guha, S., Rastogi, R. & Shim, K. (1998, June). CURE: A Clustering Algorithm for Large Databases. In
Proceedings of the 1998 ACM SIGMOD Conference on Management of Data . Seattle.
Guha, S., Rastogi, R. & Shim, K. (1999b, March). ROCK: A Robust Clustering Algorithm for Categori-
cal Attributes. In Proceedings of the 15 th International Conference on Data Engineering , Sydney.
Hartigan, J. (1985). Statistical theory in clustering. Journal of Classification, 2 , 63-76.
Hendrickson, B., & Leland, R. (1993). A multilevel algorithm for partitioning graphs . (Tech. Rep. No.
SAND93-1301). California: Sandia National Laboratories.
Hinneburg, A., & Keim, D. (1999, September). An optimal gridclustering: Towards breaking the curse
of dimensionality in high-dimensional clustering. In Proceedings of 25 th International Conference on
Very Large Data Bases . Scotland, UK.
Jain, A. K., & Dubes, R. C. (1988). Algorithms for clustering data. Englewood Cliffs, NJ: Prentice-
Hall.
Jain, A.,Murty, M., & Flynn, P. (1999). Data clustering: A review. ACM Computing Surveys, 31 (3),
255- 323.
Karypis, G., & Kumar, V. (1999). A fast and high quality multilevel scheme for partitioning rrregular
graphs. SIAM Journal of Scientific Computing, 20 (1), 359-392.
Search WWH ::




Custom Search