A clustered search algorithm incorporating arbitrary term dependencies

DOI10.1145/319732.319756MaRDI QIDQ3336742zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 1982

Published in ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/319732.319756

zbMATH Keywords

Bahadur-Lazarsfeld expansionclose neighbors in a clusterclustered search algorithmterm dependencies

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Searching and sorting (68P10)

Recommendations

• A theoretical framework for defining similarity measures for Boolean search request formulations, including some experimental results
• scientific article; zbMATH DE number 1929186
• Analyzing the search space of similar documents
• Fast and effective cluster-based information retrieval using frequent closed itemsets
• scientific article; zbMATH DE number 1975057

Cited in

(2)

• Analyzing the search space of similar documents
• scientific article; zbMATH DE number 1929186 (Why is no real title available?)

This page was built for publication: A clustered search algorithm incorporating arbitrary term dependencies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3336742)