The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Multi-relational data mining: an introduction
Abstract
Data mining algorithms look for patterns in data. While most existing data mining approaches look for patterns in a single data table, multi-relational data mining (MRDM) approaches look for patterns that involve multiple tables (relations) from a relational database. In recent years, the most common types of patterns and approaches considered in data mining have been extended to the multi-relational case and MRDM now encompasses multi-relational (MR) association rule discovery, MR decision trees and MR distance-based methods, among others. MRDM approaches have been successfully applied to a number of problems in a variety of areas, most notably in the area of bioinformatics. This article provides a brief introduction to MRDM, while the remainder of this special issue treats in detail advanced research topics at the frontiers of MRDM.
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
Cites
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
(1992) · Cited by 23,431
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
Agrawal, R., & Srikant, R. (2002) · Proceedings of the Eleventh International Conference on Data Engineering · doi:10.1109/icde.1995.380415 · Cited by 5,155
Data mining and knowledge discovery: making sense out of data
Feyyad, U. M. (1996) · IEEE Expert · doi:10.1109/64.539013 · Cited by 4,612
Advances in knowledge discovery and data mining
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90007-3 · Cited by 2,971
Principles of database and knowledge-base systems
(1989) · Choice Reviews Online · doi:10.5860/choice.26-5107 · Cited by 2,683
Fast discovery of association rules
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H. T. T., & Verkamo, A. I. (1996) · Knowledge Discovery and Data Mining · Cited by 2,376
Clark, P., & Niblett, T. (1989) · Machine Learning · doi:10.1007/bf00116835 · Cited by 2,267
Learning Logical Definitions from Relations
Quinlan, J. R. (1990) · Machine Learning · doi:10.1023/a:1022699322624 · Cited by 1,644 · cited 5×
“This classical ILP task is addressed, for instance, by the seminal MIS system [46] (rightfully considered as one of the most influential ancestors of ILP) and one of the best known ILP systems FOIL [42].”
BackgroundInfluentialMining generalized association rules
Srikant, R., & Agrawal, R. (1997) · Future Generation Computer Systems · doi:10.1016/s0167-739x(97)00019-8 · Cited by 1,618
Foundations of logic programming; (2nd extended ed.)
Lloyd, J. W. (1987) · Springer eBooks · Cited by 1,501
(1988) · Computer Science Press, Inc. eBooks · Cited by 1,435
Muggleton, S. (1995) · New Generation Computing · doi:10.1007/bf03037227 · Cited by 1,411
Shapiro, E. Y. (1983) · doi:10.7551/mitpress/1192.001.0001 · Cited by 1,085
Prolog programming for artificial intelligence
(1986) · Computer-Aided Design · doi:10.1016/0010-4485(86)90018-7 · Cited by 1,061
Muggleton, S. (1991) · New Generation Computing · doi:10.1007/bf03037089 · Cited by 1,044
Rule induction with CN2: Some recent improvements
Clark, P., & Boswell, R. (1991) · Lecture Notes in Computer Science · doi:10.1007/bfb0017011 · Cited by 859
Inductive Logic Programming: Techniques and Applications
Lavrač, N., & Džeroski, S. (1993) · Cited by 760
Self-citationMichalski, R. S., Mozetič, I., Hong, J., & Nada Lavrač, A. (1986) · National Conference on Artificial Intelligence · Cited by 747
Top-down induction of first-order logical decision trees
Blockeel, H., & De Raedt, L. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(98)00034-4 · Cited by 685
(1990) · Cited by 671
Džeroski, S. (2006) · Data Mining and Knowledge Discovery Handbook · doi:10.1007/0-387-25465-x_41 · Cited by 520
Self-citationFoundations of Inductive Logic Programming
Nienhuys-Cheng, S.-H., & Wolf, R. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-62927-0 · Cited by 471
Advances in Inductive Logic Programming
Raedt, L. D. (1996) · Cited by 318
Discovery of frequent DATALOG patterns
Dehaspe, L., & Toivonen, H. (1999) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009863704807 · Cited by 313
Discovering generalized episodes using minimal occurrences
Mannila, H., & Toivonen, H. T. T. (1996) · Cited by 306
Propositionalization Approaches to Relational Data Mining
Kramer, S., Lavrač, N., & Flach, P. (2001) · Relational Data Mining · doi:10.1007/978-3-662-04599-2_11 · Cited by 271
Relational instance-based learning
Emde, W., & Wettschereck, D. (1996) · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · Cited by 213
Finding frequent substructures in chemical compounds
Raedt, L. D., Toivonen, H. T. T., & King, R. D. (1998) · Lirias · Cited by 171
Generalized subsumption and its applications to induction and redundancy
Buntine, W. (1988) · Artificial Intelligence · doi:10.1016/0004-3702(88)90001-x · Cited by 168
Learning nonrecursive definitions of relations with linus
Lavrač, N., Džeroski, S., & Grobelnik, M. (1991) · Lecture Notes in Computer Science · doi:10.1007/bfb0017020 · Cited by 161
Self-citationFirst-order jk-clausal theories are PAC-learnable
Raedt, L. D., & Džeroski, S. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90112-0 · Cited by 140
Self-citationDiscovery of Relational Association Rules
Dehaspe, L., & Toivonen, H. T. T. (2001) · Springer eBooks · doi:10.1007/978-3-662-04599-2_8 · Cited by 119
Attribute-value learning versus inductive logic programming: The missing links
Raedt, L. D. (1998) · Lecture notes in computer science · doi:10.1007/bfb0027304 · Cited by 118
PAC-learnability of determinate logic programs
Džeroski, S., Muggleton, S., & Russell, S. (1992) · Conference on Learning Theory · doi:10.1145/130385.130399 · Cited by 116
Self-citationKrämer, S. (1996) · Cited by 92
Inductive Logic Programming for Knowledge Discovery in Databases
Wrobel, S. (2001) · Springer eBooks · doi:10.1007/978-3-662-04599-2_4 · Cited by 82
A polynomial time computable metric between point sets
Ramon, J., & Bruynooghe, M. (2001) · Acta Informatica · doi:10.1007/pl00013304 · Cited by 78
Thesis: clustering and instance based learning in first order logic
Ramon, J. (2002) · Lirias · Cited by 43
Genome scale prediction of protein functional class from sequence using data mining
King, R. D., Karwath, A., Clare, A. J., & Dephaspe, L. (2000) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/347090.347172 · Cited by 40
Three Companions for Data Mining in First Order Logic
Raedt, L. D., Blockeel, H., Dehaspe, L., & Laer, W. V. (2001) · Springer eBooks · doi:10.1007/978-3-662-04599-2_5 · Cited by 38
How to Upgrade Propositional Learners to First Order Logic: A Case Study
Laer, W. V., & Raedt, L. D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44673-7_5 · Cited by 34
How to Upgrade Propositional Learners to First Order Logic: A Case Study
Laer, W. V., & Raedt, L. D. (2001) · Springer eBooks · doi:10.1007/978-3-662-04599-2_10 · Cited by 31
Relational Data Mining Applications: An Overview
Džeroski, S. (2001) · Springer eBooks · doi:10.1007/978-3-662-04599-2_14 · Cited by 21
Self-citationA Study of Generalisation in Logic Programs.
Niblett, T. (1988) · Cited by 15
Cited by
Fouss, F., Pirotte, A., Renders, J.-M., & Saerens, M. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.46 · Cited by 1,265
On Graph Kernels: Hardness Results and Efficient Alternatives
Gärtner, T., Flach, P., & Wrobel, S. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45167-9_11 · Cited by 879
Džeroski, S. (2006) · Data Mining and Knowledge Discovery Handbook · doi:10.1007/0-387-25465-x_41 · Cited by 520
Self-citationA DESCRIPTIVE FRAMEWORK FOR THE FIELD OF DATA MINING AND KNOWLEDGE DISCOVERY
PENG, Y., KOU, G., SHI, Y., & CHEN, Z. (2008) · International Journal of Information Technology & Decision Making · doi:10.1142/s0219622008003204 · Cited by 340
Optimizing LLM Queries in Relational Data Analytics Workloads
Liu, S., Biswal, A., Kamsetty, A., Cheng, A., Schroeder, L. G., Patel, L., Cao, S., Mo, X., Stoica, I., Gonzalez, J. E., et al. (2024) · arXiv · doi:10.48550/arxiv.2403.05821 · Cited by 8
“…et al., 2018) exploit repeated values across fields for compression, while techniques like run-length encoding (RLE), multi-relational data mining, and correlation analysis (Lemire & Kaser, 2011; Dˇzeroski, 2003; Ilyas et al., 2004) leverage diverse data relationships to optimize query execution.”
Metadata
- Authors
- Džeroski, S.
- Venue
- ACM SIGKDD Explorations Newsletter
- Published
- 2003-07
- Volume
- 5
- Issue
- 1
- Pages
- 1-16
- ISSN
- 1931-0145 (ISSN-L)
- 1931-0153
- OpenAlex
- W2109597229
- Cited by
- 267
- References
- 46
- FWCI
- 35.26
- Type
- journal article
- 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
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.