Clustering heterogeneous web data using clustering by compression. Cluster validity

Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2008

Volumn , Issue , 2008, Pages 123-126

  Cernian, Alexandra ^a   Carstoiu, Dorin ^a   Olteanu, Adriana ^a  

^a UNIVERSITY POLITEHNICA OF BUCHAREST   (Romania)

Author keywords

Cluster validity; Clustering; Heterogeneous data

Indexed keywords

CLUSTER VALIDITY; CLUSTERING; CLUSTERING TECHNIQUES; COMPRESSION TECHNIQUES; DATA BASE; DATA FILES; HETEROGENEOUS DATA; HIGH QUALITY; NORMALIZED COMPRESSION DISTANCE; QUALITY INDICES; SIMILARITY DISTANCE; STRUCTURED INFORMATION; UNSTRUCTURED DATA; WEB DATA; WEB OBJECTS;

WORLD WIDE WEB;

COMPUTATION THEORY;

EID: 70449464780     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SYNASC.2008.64     Document Type: Conference Paper

References (13)

1. D. Boley, M. Gini, et al., Partitioning-based clustering for web document categorization, Decision Support Systems 27:329-341, 1999.
2. O. Zamir and O. Etzioni, Web document clustering: A feasibility demonstration, Proceedings of SIGIR '98, pp. 46-53, 1998.
3. J. Han and M. Kamber, editors. Data Mining: Concepts and Techniques. Morgan Kaufman, 2001.
4. th
5. Hawaii International Conference On System Sciences(HICSS-34), January 3-6, 2001.
6. D. Beeferman and A. Berger, Agglomerative clustering of a search engine query log, In Proceedings of the Sixth ACM SIGKDD, pp. 407-416, 2000.
7. L. H. Ungar and D. P. Foster, Clustering methods for collaborative filtering, Proceedings of Workshop on Recommendation Systems at the 15th National Conference on Artificial Intelligence, 1998.
8. T. Hofmann, J. Puzicha, and M. Jordan, Learning from dyadic data, Advances in Neural Information Processing
9. Systems 11 (NIPS), Cambridge, MA, MIT Press, 1999
10. T. Hofmann, The cluster-abstraction model: Unsupervised learning of topic hierarchies from text data, In Proceedings of 16th International Joint Conference on Artificial Intelligence(IJCAI-99), pp. 682-687, 1999.
11. S. Guha, R. Rastogi, and K. Shim K. CURE: An Efficient Clustering Algorithm for Large Databases. In Proceedings of the ACM SIGMOD Conference, 1998.
12. Rudi Cilibrasi, Paul M.B. Vitanyi, Clustering by compression. IEEE Transactions on Information Theory, Vol. 51, No. 4, pp 1523-1545, 2005.
13. Peter Grunwald and Paul Vitanyi. Shannon Information and Kolmogorov Complexity, 2004.