Clustering hypertext with applications to web searching
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A method and structure of searching a database containing hypertext documents comprising searching the database using a query to produce a set ofhypertext documents and geometrically clustering the set ofHypertext documents into various clusters using a toric k-means similarity measure.
Abstract
Article Clustering hypertext with applications to web searching Share on Authors: Dharmendra S. Modha IBM Almaden Research Center, 650 Harry Road, San Jose, CA IBM Almaden Research Center, 650 Harry Road, San Jose, CAView Profile , W. Scott Spangler IBM Almaden Research Center, 650 Harry Road, San Jose, CA IBM Almaden Research Center, 650 Harry Road, San Jose, CAView Profile Authors Info & Claims HYPERTEXT '00: Proceedings of the eleventh ACM on Hypertext and hypermediaMay 2000 Pages 143–152https://doi.org/10.1145/336296.336351Published:30 May 2000 43citation901DownloadsMetricsTotal Citations43Total Downloads901Last 12 Months6Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
