The DOI matches its Crossref record.
HyPursuit: a hierarchical network search engine that exploits content-link hypertext clustering
Open accessAbstract
HyPursuit is a new hierarchical network search engine that clusters hypertext documents to structure a given information space for browsing and search act ivities.Our content-link clustering algorithm is based on the semantic information embedded in hyperlink structures and document contents.HyPursuit admits multiple, coexisting cluster hierarchies based on different principles for grouping documents, such as the Library of Congress catalog scheme and automatically created hypertext clusters.HyPursuit's abstraction functions summarize cluster contents to support scalable query processing.The abstraction functions satisfy system resource limitations with controlled information 10SS.The result of query processing operations on a cluster summary approximates the result of performing the operations on the entire information space.We constructed a prototype system comprising 100 leaf World-Wide Web sites and a hierarchy of 42 servers that route queries to the leaf sites.Experience with our system suggests that abstraction functions based on hypertext clustering can be used to construct meaningful and scalable cluster hierarchies.We are also encouraged by preliminary results on clustering based on both document contents and hyperlink structures.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1998) · Symposium on Discrete Algorithms · doi:10.5555/314613.315045 · Cited by 1,814
Web mining: information and pattern discovery on the World Wide Web
Cooley, R., Mobasher, B., & Srivastava, J. (2002) · Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence · doi:10.1109/tai.1997.632303 · Cited by 1,162
Reprint of: The anatomy of a large-scale hypertextual web search engine
Brin, S., & Page, L. (2012) · Computer Networks · doi:10.1016/j.comnet.2012.10.007 · Cited by 878
Keyword searching and browsing in databases using BANKS
Bhalotia, G., Hulgeri, A., Nakhe, C., Chakrabarti, S., & Sudarshan, S. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994756 · Cited by 871
Enhanced hypertext categorization using hyperlinks
Chakrabarti, S., Dom, B., & Indyk, P. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276332 · Cited by 769
Inferring Web communities from link topology
Gibson, D., Kleinberg, J., & Raghavan, P. (1998) · Proceedings of the ninth ACM conference on Hypertext and hypermedia : links, objects, time and space---structure in hypermedia systems links, objects, time and space---structure in hypermedia systems - HYPERTEXT '98 · doi:10.1145/276627.276652 · Cited by 768
Automatic resource compilation by analyzing hyperlink structure and associated text
Chakrabarti, S., Dom, B., Raghavan, P., Rajagopalan, S., Gibson, D., & Kleinberg, J. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00087-7 · Cited by 697
The stochastic approach for link-structure analysis (SALSA) and the TKC effect
Lempel, R., & Moran, S. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00034-7 · Cited by 481
Query-based sampling of text databases
Callan, J., & Connell, M. (2001) · ACM Transactions on Information Systems · doi:10.1145/382979.383040 · Cited by 368
SALSA: the stochastic approach for link-structure analysis
Lempel, R., & Moran, S. (2001) · ACM Transactions on Information Systems · doi:10.1145/382979.383041 · Cited by 362
Toward a basic framework for webometrics
Björneborn, L., & Ingwersen, P. (2004) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.20077 · Cited by 359
Community detection in node-attributed social networks: A survey
Chunaev, P. (2020) · Computer Science Review · doi:10.1016/j.cosrev.2020.100286 · Cited by 300
Cluster-based language models for distributed retrieval
Xu, J., & Croft, W. B. (1999) · Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/312624.312687 · Cited by 293
Improving browsing in digital libraries with keyphrase indexes
Gutwin, C., Paynter, G., Witten, I., Nevill-Manning, C., & Frank, E. (1999) · Decision Support Systems · doi:10.1016/s0167-9236(99)00038-x · Cited by 262
Partitioning-based clustering for Web document categorization
Boley, D., Gini, M., Gross, R., Han, E.-H. (., Hastings, K., Karypis, G., Kumar, V., Mobasher, B., & Moore, J. (1999) · Decision Support Systems · doi:10.1016/s0167-9236(99)00055-x · Cited by 262
Mining query logs: turning search usage data into knowledge
Silvestri, F. (2009) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000013 · Cited by 194
Metadata
- Authors
- Weiss, R., Vélez, B., & Sheldon, M. A.
- Venue
- Proceedings of the the seventh ACM conference on Hypertext - HYPERTEXT '96
- Publisher
- ACM Press
- Published
- 1996
- Pages
- 180-193
- OpenAlex
- W2095150974
- Cited by
- 209
- References
- 0
- FWCI
- 20.95
- Type
- conference paper
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.