The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Data mining, hypergraph transversals, and machine learning (extended abstract)
Abstract
Several data mining problems can be formulated as problems of finding maximally specific sentences that are interesting in a database. We first show that this problem has a close relationship with the hypergraph transversal problem. We then analyze two algorithms that have been previously used in data mining, proving upper bounds on their complexity. The first algorithm is useful when the maximally specific interesting sentences are "small". We show that this algorithm can also be used to efficiently solve a special case of the hypergraph transversal problem, improving on previous results. The second algorithm utilizes a subroutine for hypergraph transversals, and is applicable in more general situations, with complexity close to a lower bound for the problem. We also relate these problems to the model of exact learning in computational learning theory, and use the correspondence to derive some corollaries.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cites
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907
Muggleton, S. (1991) · New Generation Computing · doi:10.1007/bf03037089 · Cited by 1,044
Cited by
Automatic subspace clustering of high dimensional data for data mining applications
Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276314 · Cited by 2,412
Self-citationScalable algorithms for association mining
Zaki, M. J. (2000) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.846291 · Cited by 1,751
Automatic subspace clustering of high dimensional data for data mining applications
Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (1998) · ACM SIGMOD Record · doi:10.1145/276305.276314 · Cited by 663
Self-citationAutomatic Subspace Clustering of High Dimensional Data
Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (2005) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-005-1396-1 · Cited by 335
Self-citation
Metadata
- Authors
- Gunopulos, D., Mannila, H., Khardon, R., & Toivonen, H.
- Venue
- Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
- Publisher
- ACM
- Published
- 1997-05
- Pages
- 209-216
- OpenAlex
- W2054784808
- Cited by
- 160
- References
- 2
- FWCI
- 4.35
- Type
- conference paper
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Data mining, hypergraph transversals, and machine learning (extended abstract). https://app.cochat.ai/papers/10.1145/263661.263684
- The paper
- Gunopulos, D., Mannila, H., Khardon, R., & Toivonen, H. (1997). Data mining, hypergraph transversals, and machine learning (extended abstract). Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems. https://doi.org/10.1145/263661.263684
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.