Enhanced hypertext categorization using hyperlinks

SIGMOD Record

Volumn 27, Issue 2, 1998, Pages 307-318

  Chakrabarti, Soumen ^a   Dom, Byron ^a   Indyk, Piotr ^b  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC INDEXING; CLASSIFICATION (OF INFORMATION); DATABASE SYSTEMS; STATISTICAL METHODS;

HYPERLINKS; RELAXATION LABELING TECHNIQUE;

HYPERTEXT SYSTEMS;

EID: 0032090684     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/276305.276332     Document Type: Article

References (41)

1. K. Ali. Learning relational rules from relational data. Data Mining Seminar, IBM Almaden, San Jose, CA, Sept. 1997.
2. C. Apte, P. Damerau, and S. M. Weiss. Automated learning of decision rules for text categorization. ACM Transactions on Information Systems, 1994. IBM Research Report RC18879.
3. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. Classification and Regression Trees. Wadsworth & Brooks/Cole, 1984. ISBN: 0-534-98054-6.
4. S. Chakrabarti, B. Dom, R. Agrawal, and P. Raghavan. Using taxonomy, discriminants, and signatures for navigating in text databases. In VLDB, Athens, Greece, Aug. 1997. Invited submission to VLDB Journal, 1998.
5. S. Chakrabarti, B. Dom, R. Agrawal, and P. Raghavan. Using taxonomy, discriminants, and signatures for navigating in text databases. In VLDB, Athens, Greece, Aug. 1997. Invited submission to VLDB Journal, 1998.
6. C. Chekuri, M. Goldwasser, P. Raghavan, and E. Upfal. Web search using automatic classification. In Sixth World Wide Web Conference, San Jose, CA, 1996.
7. R. Chellappa and A. Jain. Markov Random Fields: Theory and Applications. Academic Press, 1993.
8. W. B. Croft and H. R. Turtle. A retrieval model for incorporating hypertext links. In ACM Hypertext, pages 213-224. ACM, 1989.
9. W. B. Croft and H. R. Turtle. Retrieval strategies for hypertext. Information Processing and Management, 29(3):313-324, 1993.
10. W. Deng and S. S. Iyengar. A new probabilistic relaxation scheme and its application to edge detection. IEEE Transactions of Pattern Analysis and Machine Intelligence, 18(4):432-437, Apr. 1996.
11. R. Duda and P. Hart. Pattern Classification and Scene Analysis. Wiley, New York, 1973.
12. D. Eppstein. Finding the k shortest paths. In Symposium on the Foundations of Computer Science. IEEE, 1994.
13. D. Florescu, D. Koller, and A. Levy. Using probabilistic information in data integration. In VLDB, Athens, Greece, 1997.
14. H. P. Frei and D. Steiger. Making use of hypertext links when retrieving information. In ACM European Conference on Hypertext (ECHT), pages 102-111. ACM, Nov. 1992.
15. H. P. Frei and D. Steiger. The use of semantic links in hypertext information retrieval. Information Processing and Management, 31(1):1-13, 1995.
16. Y. Freund and D. Ron. Learning to model sequences generated by switching distributions. In Proceedings of the Eighth Annual ACM Conference on Computational Learning Theory (COLT), pages 41-50, 1995.
17. M. Hearst and C. Karadi. Cat-a-Cone: An interactive interface for specifying searches and viewing retrieval results using a large category hierarchy. In Proceedings of ACM SIGIR 97, pages 246-255. ACM Press, 1997.
18. R. A. Hummel and S. W. Zucker. On the foundations of relaxation labeling processes. IEEE Transactions of Pattern Analysis and Machine Intelligence, PAMI-5(3):267-287, May 1983.
19. D. Koller and M. Sahami. Hierarchically classifying documents using very few words. In International Conference on Machine Learning, volume 14. Morgan-Kaufmann, July 1997. To appear.
20. K. L. Kwok. The use of titles and cited titles as document representations for automatic classification. Information Processing and Management, 11:201-206, 1975.
21. K. L. Kwok. A document-document similarity measure based on cited titles and probability theory and its application to relevance feedback retrieval. In C. J. van Rijsbergen, editor, Research and Development in Information Retrieval, pages 221-232. Cambridge University Press, 1984.
22. K. L. Kwok. A probabilistic theory of indexing and similarity measure based on cited and citing documents. Journal of the American Society for Information Science, 36(342-351), 1985.
23. K. L. Kwok. On the use of bibliographically related titles for the enhancements of document representations. Information Processing and Management, 24(2):123-131, 1988.
24. N. Lavrac and S. Dzeroski. Inductive Logic Programming - Techniques and Applications. Chichester, 1994.
25. D. Lucarella and A. Zanzi. Information retrieval from hypertext: an approach using plausible inference. Information Processing and Management, 29(3):299-312, 1993.
26. M. Mehta, R. Agrawal, and J. Rissanen. SLIQ: A fast scalable classifier for data mining. In Proc. of the Fifth Int'l Conference on Extending Database Technology, Avignon, France, March 1996.
27. S. Muggleton and C. Feng. Efficient induction of logic programs. In Proceedings of the Workshop on Algorithmic Learning Theory. Japanese Society for Artificial Intelligence, 1990.
28. M. Pazzani, C. Brunk, and G. Silverstein. A knowledge-intensive approach to learning relational concepts. In Machine Learning: Proceedings of the Eighth International Workshop (ML91), Ithaca, NY, 1991. Morgan Kaufmann.
29. L. Pelkowitz. A continuous relaxation labeling algorithm for markov random fields. IEEE Transactions on Systems, Man and Cybernetics, 20(3):709-715, May 1990.
30. R. Ouinlan. Learning logical definitions from relations. Machine Learning, 5, 3:239-266, 1990.
31. M. Sahami. Web classification using Bayesian nets. Personal communication, Oct. 1997.
32. G. Salton. Associative document retrieval techniques using bibliographic information. Journal of the ACM, 10(4):440-457, Oct. 1963.
33. G. Salton and M. J. McGill. Introduction to Modern Information Retrieval. McGraw-Hill, 1983.
34. G. Salton and Y. Zhang. Enhancement of text representations using related document titles. Information Processing and Management, 22(5):385-394, 1986.
35. J. Savoy. A learning scheme for information retrieval in hypertext. Information Processing and Management, 30(4):515-533, 1994.
36. J. Savoy. A new probabilistic scheme for information retrieval in hypertext. The New Review of Hypermedia and Multimedia, pages 107-134, 1995.
37. J. Savoy. An extended vector processing scheme for searching information in hypertext. Information Processing and Management, 32(2):155-170, Mar. 1996.
38. J. Shafer, R. Agrawal, and M. Mehta. SPRINT: A scalable parallel classifier for data mining. In Proc. of the 22th Int'l Conference on Very Large Databases, Bomba, India, Sept 1996.
39. Y. Singer and W. W. Cohen. Context-sensitive learning methods for text categorization. In SIGIR. ACM, 1996.
40. J. R. Smith and S.-F. Chang. Visually searching the web for content. IEEE Multimedia, 4(3):12-20. 1997.
41. R. Weiss, B. Velez, M. A. Sheldon, C. Nemprempre, P. Szilagyi, A. Duda, and D. K. Gifford. HyPursuit: A hierarchical network search engine that exploits content-link hypertext clustering. In ACM Hypertext, Washington, DC, Mar. 1996.