{"type":"ScholarlyArticle","title":"Adaptive Web Sites: Conceptual Cluster Mining","authors":[{"name":"Mike Perkowitz","slug":"mike-perkowitz","given":"Mike","family":"Perkowitz","affiliation":"Department of Computer Science and Engineering , Box 352350 University of Washington , Seattle , WA 98195"},{"name":"Oren Etzioni","slug":"oren-etzioni","given":"Oren","family":"Etzioni","affiliation":"Department of Computer Science and Engineering , Box 352350 University of Washington , Seattle , WA 98195"}],"abstract":"Th e creation of a complex web site is a thorny problem in user interface design . In IJCAI '97, we challenged the AI community to address this problem by creating adaptive web sites. In response , we investigate the problem of index page synthesis - the automatic creation of pages that facilitate a visitor's navigation of a Web site. Previous work has employed statistical methods to generate candidate index pages that are of limited value because they do not correspond to concepts or topics that are intuitive to people. In this paper we formalize index page synthesis as a conceptual clustering problem and introduce a novel approach which we call conceptual cluster mining: we search for a small number of cohesive clusters that correspond to concepts in a given concept description language L . Next, we present SCML, an algorithm schema that combines a statistical clustering algorithm with a concept learning algorithm. The clustering algorithm is used to generate seed clusters, and the concept learning algorithm to describe these seed clusters using expressions in L. Finally, we offer preliminary experimental evidence that instantiations of SCML outperform existing algorithms (e.g., COBWEB) in this domain.","doi":null,"url":"https://ijcai.org/proceedings/1999/39","pdf":"https://ijcai.org/proceedings/1999/0039.pdf","markdown":"https://ijcai.org/proceedings/1999/39.md","bibtex":"https://ijcai.org/proceedings/1999/bibtex/39","volume":{"slug":"1999","title":"Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1999","url":"https://ijcai.org/proceedings/1999/","year":1999,"location":"Stockholm, Sweden","dates":"","editors":"Thomas Dean","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Challenge Papers","track":"Challenge Papers","number":39,"pages":{"first":264,"last":268},"keywords":[],"videos":[],"references":[{"position":1,"raw":"[Agrawal and Srikant, 1994] R. Agrawal and R. Srikant. Fast Algorithms for Mining Association Rules. In Proceedmgs of the 20th VLDB Conference, 1994.","title":"Fast Algorithms for Mining Association Rules","authors":"R Agrawal, R Srikant","year":"1994","venue":"Proceedmgs of the 20th VLDB Conference","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Anantharaman et al., 1990] T. Anantharaman, M. Camp- bell, and F. Hsu. Singular extensions: adding selectivity to brute-force searching. Artificial Intelligence, 43(1) :99-109, 1990.","title":"Singular extensions: adding selectivity to brute-force searching","authors":"T Anantharaman, M Campbell, F Hsu","year":"1990","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Cohen, 1995] W. Cohen. Fast effective rule induction. In Proc. 12th Int. Conf. Machine Learning, 1995.","title":"Fast effective rule induction","authors":"W Cohen","year":"1995","venue":"Proc. 12th Int. Conf. Machine Learning","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Fisher, 1987] D. Fisher. Knowledge Acquisition Via Incre- mental Conceptual Clustering. Machine Learning, 2:139- 172, 1987.","title":"Knowledge Acquisition Via Incremental Conceptual Clustering","authors":"D Fisher","year":"1987","venue":"Machine Learning","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Hanson and Bauer, 1989] S. Hanson and M. Bauer. Concep- tual Clustering, Categorization, and Polymorphy. Machme Learning, 3:343-372, 1989.","title":"Conceptual Clustering, Categorization, and Polymorphy","authors":"S Hanson, M Bauer","year":"1989","venue":"Machme Learning","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Michalski and Stepp, 1983] R. Michalski and R. Stepp. Learning from Observation: Conceptual Clustering, pages 331-363.","title":"Learning from Observation: Conceptual Clustering","authors":"R Michalski, R Stepp","year":null,"venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Pagallo and Haussler, 1990] .","title":null,"authors":"Haussler Pagallo","year":"1990","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"G . Pa~~lo and _D. Haussler. Boolean feature discovery m empmcallearmng. Machme Learning, 5:71-100, 1990.","title":"Boolean feature discovery m empmcallearmng","authors":"G Pa~~lo, _D Haussler","year":"1990","venue":"Machme Learning","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Perkowitz and Etzioni, 1997] M. Perkowitz and 0 . Etzioni. Adaptive web sites: an AI challenge. In Proceedmgs of the Fifteenth International Joint Conference on Artific,al Intelligence, 1997.","title":"Adaptive web sites: an AI challenge","authors":"M Perkowitz, Etzioni","year":"1997","venue":"Proceedmgs of the Fifteenth International Joint Conference on Artific,al Intelligence","doi":null,"url":null,"internal_url":"/proceedings/1997/3"},{"position":10,"raw":"[Perkowitz and Etzioni, 1998] M. Perkowitz and 0. Etzioni. Adaptive Web Sites: Automatically Synthesizing Web Pages. In Proceedings of the Fifteenth National Confer- ence on Artificial Intelligence, 1998.","title":"Adaptive Web Sites: Automatically Synthesizing Web Pages","authors":"M Perkowitz, Etzioni","year":"1998","venue":"Proceedings of the Fifteenth National Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Quinlan and Rivest , 1989] J. R. Quinla~ .and R. L. ~v~st. Inferring decision trees using the m1mmum. descnpt10n length principle. Information and Computahon, 80:227- 248, 1989.","title":"Inferring decision trees using the m1mmum. descnpt10n length principle","authors":"J R Quinla~, R L ~v~st","year":"1989","venue":"Information and Computahon","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Rasmussen, 1992] E. Rasmussen. Clustering algorithms. In W.B. Frakes and R. Baeza-Yates, editors, Informatton Re- trieval, pages 419-442.","title":"Clustering algorithms","authors":"E Rasmussen","year":null,"venue":"Informatton Retrieval","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"Prentice Hall, Eaglewood Cliffs, N.J., 1992.","title":null,"authors":"Prentice Hall, Eaglewood Cliffs, N J","year":"1992","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Savasere et al., 1995] A. Savaser~, E. Om.ie~inski, a~d S. Navathe. An Efficient Algonthm for Mmmg AssoCia- tion Rules in Large Databases. In Proceedings of the 21st VLDB Conference, 1995.","title":"An Efficient Algonthm for Mmmg AssoCiation Rules in Large Databases","authors":"A Savaser~, E Om, S Navathe","year":"1995","venue":"Proceedings of the 21st VLDB Conference","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Thorpe, 1990] C. Thorpe, editor. Vision an~ Navi~at~on: the Carnegie Mellon Navlab. Kluwer AcademiC Pubhshmg, Boston, MA, 1990.","title":"Vision an~ Navi~at~on: the Carnegie Mellon Navlab","authors":null,"year":"1990","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Toivonen, 1996] H. Toivonen. Sampling Large Databases for Association Rules. In Proceedings of the 22nd VLDB Con- ference, pages 134-145, 1996.","title":"Sampling Large Databases for Association Rules","authors":"H Toivonen","year":"1996","venue":"Proceedings of the 22nd VLDB Conference","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Voorhees, 1986] E.M. Voorhees . . Implementin~ agglomera- tive hierarchical clustering algonthms for use m document retrieval. Information Processing C1 Management, 22:465- 476, 1986.","title":"Implementin~ agglomerative hierarchical clustering algonthms for use m document retrieval","authors":"E M Voorhees","year":"1986","venue":"Information Processing C1 Management","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Willet, 1988] P. Willet. Recent trends in hierarchical docu- ment clustering: a critical review. Informatwn Processmg and Management, 24:577-97, 1988.","title":"Recent trends in hierarchical document clustering: a critical review","authors":"P Willet","year":"1988","venue":"Informatwn Processmg and Management","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Zamir and Etzioni, 1998] Zamir and 0. Etzioni. Web document clustering: A feasibility demonstration. In Proc. of the 21st Annual International ACM SIGIR Conference on Research and Development in Informahon Retnval, Au- gust 1998.","title":"Web document clustering: A feasibility demonstration","authors":"0 Zamir, Etzioni","year":"1998","venue":"Proc. of the 21st Annual International ACM SIGIR Conference on Research and Development in Informahon Retnval","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}