Naive Bayesian Classification of Structured Data
Open accessThe DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
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
Introduction to Database Systems
(2006) · Foundations of Database Design · doi:10.1201/9781420003345.ch1 · Cited by 3,521
On the Optimality of the Simple Bayesian Classifier under Zero-One Loss
Domingos, P., & Pazzani, M. (1997) · Machine Learning · doi:10.1023/a:1007413511361 · Cited by 3,101
Estimating Continuous Distributions in Bayesian Classifiers
John, G. H., & Langley, P. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1302.4964 · Cited by 2,885 · cited 1×
“One option would be to directly estimate the probability of a continuous property (John and Langley, 1995).”
BackgroundSolving the multiple instance problem with axis-parallel rectangles
Dietterich, T. G., Lathrop, R. H., & Lozano-Pérez, T. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(96)00034-3 · Cited by 2,866 · cited 1×
“While the existential operator seems appropriate for many data sets including multi-instance problems (Dietterich, Lathrop, and Lozano-Perez, 1997), other aggregation operators may make sense for other data sets, e.g., the PKDD’99 challenge involving analysis of financial data (Knobbe, de Haas, and…”
BackgroundA Simple Generalisation of the Area Under the ROC Curve for Multiple Class Classification Problems
Hand, D. J., & Till, R. J. (2001) · Machine Learning · doi:10.1023/a:1010920819831 · Cited by 2,276 · cited 1×
“Among the best-known are Koller’s probabilistic relational models (PRMs) (Getoor et al., 2001).”
BackgroundInductive Logic Programming: Theory and methods
Muggleton, S., & de Raedt, L. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90035-3 · Cited by 1,537 · cited 2×
“Inductive logic programming (ILP), also called multi-relational data mining, studies how to upgrade machine learning methods to the richer representation formalism of first-order logic in general and logic programming languages such as Prolog in particular [35, 38, 11].”
BackgroundMuggleton, S. (1995) · New Generation Computing · doi:10.1007/bf03037227 · Cited by 1,411
Muggleton, S. (1991) · New Generation Computing · doi:10.1007/bf03037089 · Cited by 1,044
Learning Probabilistic Relational Models
Getoor, L., Friedman, N., Koller, D., & Pfeffer, A. (2001) · Relational Data Mining · doi:10.1007/978-3-662-04599-2_13 · Cited by 933
ROC Graphs: Notes and Practical Considerations for Data Mining Researchers
Fawcett, T. E. (2003) · Cited by 632
Getoor, L. (2006) · Advanced Information and Knowledge Processing · doi:10.1007/1-84628-284-5_7 · Cited by 612 · cited 1×
“Later developments that also aggregate over links include (Taskar, Segal, and Koller, 2001; Lu and Getoor, 2003).”
BackgroundDžeroski, S. (2006) · Data Mining and Knowledge Discovery Handbook · doi:10.1007/0-387-25465-x_41 · Cited by 520
Advances in Inductive Logic Programming
Raedt, L. D. (1996) · Cited by 318
(2001) · Springer eBooks · doi:10.1007/978-3-662-04599-2 · Cited by 313
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 · cited 2×
“This approach is usually referred to as propositionalisation (Kramer, Lavrač, and Flach, 2001).”
BackgroundSelf-citationParameter Learning of Logic Programs for Symbolic-Statistical Modeling
Sato, T., & Kameya, Y. (2001) · Journal of Artificial Intelligence Research · doi:10.1613/jair.912 · Cited by 233
Probabilistic classification and clustering in relational data
Taskar, B., Segal, E., & Koller, D. (2001) · Cited by 225
Dězeroski, S. (2001) · Springer eBooks · Cited by 223
PRISM: a language for symbolic-statistical modeling
Sato, T., & Kameya, Y. (1997) · Cited by 207
Kersting, K., & Raedt, L. D. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0111058 · Cited by 166 · cited 1×
“Approaches that combine logic programs with probabilities include stochastic logic programs (SLPs) (Muggleton, 1996; Cussens, 2001), Bayesian logic programs (Kersting and De Raedt, 2000; Kersting and De Raedt, 2001), and PRISM (programming in statistical modelling) (Sato and Kameya, 1997, 2001).”
BackgroundKernels and Distances for Structured Data
Gärtner, T., Lloyd, J. W., & Flach, P. A. (2004) · Machine Learning · doi:10.1023/b:mach.0000039777.23772.30 · Cited by 159
Self-citationGärtner, T., Lloyd, J. W., & Flach, P. A. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36468-4_5 · Cited by 149
Self-citationTowards Combining Inductive Logic Programming with Bayesian Networks
Kersting, K., & Raedt, L. D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44797-0_10 · Cited by 140 · cited 2×
“Approaches that combine logic programs with probabilities include stochastic logic programs (SLPs) [37, 4], Bayesian logic programs [24, 23], and PRISM (programming in statistical modelling) [42, 43].”
BackgroundAdaptive Bayesian Logic Programs
Kersting, K., & Raedt, L. D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44797-0_9 · Cited by 134
Confirmation-Guided Discovery of First-Order Rules with Tertius
Flach, P. A., & Lachiche, N. (2001) · Machine Learning · doi:10.1023/a:1007656703224 · Cited by 131 · cited 8×
“Tertius constructs first-order features in a top-down search, starting with the empty feature and iteratively refining it by adding structural predicates and properties.”
BackgroundMethodInfluentialSelf-citationParameter Estimation in Stochastic Logic Programs
Cussens, J. (2001) · Machine Learning · doi:10.1023/a:1010924021315 · Cited by 126
Transformation-Based Learning Using Multirelational Aggregation
Krogel, M.-A., & Wrobel, S. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44797-0_12 · Cited by 118 · cited 1×
“Additionally, different aggregation operators (e.g., minimum, maximum, average, cardinality) could be used to increase expressiveness (Knobbe, de Haas, and Siebes, 2001; Krogel and Wrobel, 2001).”
Propositionalisation and Aggregates
Knobbe, A., de Haas, M., & Siebes, A. P. J. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44794-6_23 · Cited by 97 · cited 3×
“Another option would be a propositionalisation based on various aggregation operators (Knobbe, de Haas, and Siebes, 2001).”
BackgroundAn extended transformation approach to inductive logic programming
Lavrač, N., & Flach, P. A. (2001) · ACM Transactions on Computational Logic · doi:10.1145/383779.383781 · Cited by 95 · cited 5×
“It has also been used in other propositionalisation approaches to rule learning (Lavrač and Flach, 2001) and relational subgroup discovery (Lavrač, Železný, and Flach, 2002).”
BackgroundMethodInfluentialSelf-citation1BC: A First-Order Bayesian Classifier
Flach, P. A., & Lachiche, N. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48751-4_10 · Cited by 90 · cited 9×
“From this table, it is obvious that the non-recursive implementation of 1BC (Algorithm 1) originally proposed in Flach and Lachiche (1999) runs considerably slower than the recursive implementation of 1BC2, in particular on the relational data sets.”
BackgroundMethodResultInfluentialSelf-citationFlattening and Saturation: Two Representation Changes for Generalization
Rouveirol, C. (1994) · Machine Learning · doi:10.1023/a:1022678217288 · Cited by 77 · cited 2×
“Generally speaking, translating a term representation to ISP (i.e., flattening (Rouveirol, 1994)) involves naming non-atomic subterms,1 i.e., introducing object identifiers.”
BackgroundRSD: Relational Subgroup Discovery through First-Order Feature Construction
Lavrač, N., Železný, F., & Flach, P. A. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36468-4_10 · Cited by 76 · cited 1×
“First-order features as defined here first appeared in (Flach & Lachiche, 1999), and have later been used in other propositionalisation approaches including (Lavra č & Flach, 2001; Lavrǎc et al., 2003).”
MethodSelf-citationCombining statistical and relational methods for learning in hypertext domains
Slattery, S., & Craven, M. W. (1998) · Lecture notes in computer science · doi:10.1007/bfb0027309 · Cited by 75 · cited 1×
“The work by Slattery and Craven (1998) goes in the other direction: it uses naive Bayes to invent new predicates to be used by Foil.”
Method(2003) · Cited by 73
Mr-SBC: A Multi-relational Naïve Bayes Classifier
Ceci, M., Appice, A., & Malerba, D. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39804-2_11 · Cited by 50 · cited 1×
“More recently, Ceci, Appice, and Malerba (2003) presented Mr-SBC, a multi-relational simple Bayesian classifier, which is fairly similar to 1BC.”
BackgroundStrongly typed inductive concept learning
Flach, P. A., Giraud-Carrier, C. G., & Lloyd, J. W. (1998) · Lecture notes in computer science · doi:10.1007/bfb0027322 · Cited by 49 · cited 3×
“Our data modelling approach has been inspired by the strongly-typed term-based representation proposed in Flach, Giraud-Carrier, and Lloyd (1998) which we translated to a flattened Prolog setting in Flach and Lachiche (1999) and Flach and Lachiche (2001).”
BackgroundMethodInfluentialSelf-citationHierarchical Bayesian Networks: An Approach to Classification and Learning for Structured Data
Gyftodimos, E., & Flach, P. A. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24674-9_31 · Cited by 46 · cited 2×
“Finally, we mention our own ongoing work on hierarchical and higher-order Bayesian networks [20, 16].”
BackgroundMethodSelf-citationIBC: A First-Order Bayesian Classifier
Flach, P. A., & Lachiche, N. (1999) · Inductive Logic Programming · Cited by 44
Self-citationDiterpene structure elucidation from 13cnmr spectra with inductive logic programming
Džeroski, S., Schulze-Kremer, S., Heidtke, K. R., Siems, K., Wettschereck, D., & Blockeel, H. (1998) · Applied Artificial Intelligence · doi:10.1080/088395198117686 · Cited by 44 · cited 3×
“In order to compare our results with Džeroski et al. (1998), the accuracy is evaluated with a 3-fold cross-validation, and three settings were considered: each representation separately, and then together.”
BackgroundMethodResultInfluentialMaximum Entropy modeling with Clausal Constraints
Raedt, L. D. (1997) · Lecture notes in computer science · doi:10.1007/3540635149_39 · Cited by 43 · cited 2×
“A good starting point might be the work of Dehaspe (1997) who combines a maximum entropy approach with logical constraints.”
BackgroundRefinement Operators Can Be (Weakly) Perfect
Badea, L., & Stanciu, M. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48751-4_4 · Cited by 42
Lloyd, J. W. (2003) · Cited by 34
Biochemical Knowledge Discovery Using Inductive Logic Programming
Muggleton, S., Srinivasan, A., King, R. D., & Sternberg, M. J. E. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49292-5_29 · Cited by 31 · cited 3×
“The Progol and regression results are quoted from Muggleton et al. (1998).”
BackgroundKnowledge Representation for Inductive Learning
Flach, P. A. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48747-6_15 · Cited by 17 · cited 5×
“, Lavrač and Flach (2001). However, notice that there will still be a subsumption relation between many of the features, e.”
BackgroundMethodInfluentialSelf-citationCombining Divide-and-Conquer and Separate-and-Conquer for Efficient and Effective Rule Induction
Boström, H., & Asker, L. (1999) · Lecture notes in computer science · doi:10.1007/3-540-48751-4_5 · Cited by 16 · cited 2×
“This data set is about drugs against Alzheimer’s disease (Boström and Asker, 1999).”
MethodLearning Comprehensible Theories from Structured Data
Lloyd, J. W. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36434-x_6 · Cited by 11
Cited by
Classification in Networked Data: A Toolkit and a Univariate Case Study
(2007) · Journal of Machine Learning Research · doi:10.5555/1248659.1248693 · Cited by 452
Computational/in silico methods in drug target and lead prediction
Agamah, F. E., Mazandu, G. K., Hassan, R., Bope, C. D., Thomford, N. E., Ghansah, A., & Chimusa, E. R. (2020) · Briefings in Bioinformatics · doi:10.1093/bib/bbz103 · Cited by 328
Probabilistic Inductive Logic Programming
De Raedt, L., & Kersting, K. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78652-8_1 · Cited by 319
Açikgöz, F. Y., Kayakuş, M., Zăbavă, B.-Ș., & Kabas, O. (2024) · Sustainability · doi:10.3390/su16229681 · Cited by 25
Metadata
- Authors
- Flach, P. A., & Lachiche, N.
- Venue
- Machine Learning
- Published
- 2004-12
- Volume
- 57
- Issue
- 3
- Pages
- 233-269
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W2073245587
- Cited by
- 162
- References
- 46
- FWCI
- 6.10
- Type
- journal article
- Language
- en
- Open access
- bronze
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.