On the public citation graph
Refining Aggregate Conditions in Relational Learning
0 signed · 33 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11536314_23openalex-snapshot
Classifying Relational Data with Neural Networks
inferredcites →https://doi.org/10.1007/3-540-44794-6openalex-snapshot
Principles of Data Mining and Knowledge Discovery
inferredcites →https://doi.org/10.1007/3-540-44794-6_23openalex-snapshot
Propositionalisation and Aggregates
inferredcites →https://doi.org/10.1007/3-540-44797-0_12openalex-snapshot
Transformation-Based Learning Using Multirelational Aggregation
inferredcites →https://doi.org/10.1007/3-540-45681-3_24openalex-snapshot
Involving Aggregate Functions in Multi-relational Search
inferredcites →https://doi.org/10.1007/3-540-48751-4_1openalex-snapshot
Probabilistic Relational Models
inferredcites →https://doi.org/10.1007/3-540-48751-4_27openalex-snapshot
An Assessment of ILP-assisted models for toxicology and the PTE-3 experiment
inferredcites →https://doi.org/10.1007/s10994-006-8713-9openalex-snapshot
First order random forests: Learning relational classifiers with complex aggregates
inferredcites →https://doi.org/10.1016/b978-1-4832-0774-2.50001-9openalex-snapshot
The Morgan Kaufmann Series in Machine Learning
inferredcites →https://doi.org/10.1016/s0004-3702(98)00034-4openalex-snapshot
Top-down induction of first-order logical decision trees
inferredcites →https://doi.org/10.1080/088395198117686openalex-snapshot
Diterpene structure elucidation from 13cnmr spectra with inductive logic programming
inferredcites →https://doi.org/10.1145/276304.276307openalex-snapshot
Exploratory mining and pruning optimizations of constrained associations rules
inferredcites →https://doi.org/10.1145/956750.956772openalex-snapshot
Aggregation-based feature invention and relational concept classes
inferredcites →https://doi.org/10.1145/956750.956830openalex-snapshot
Learning relational probability trees
inferredcites →https://doi.org/10.1145/956755.956772openalex-snapshot
Aggregation-based feature invention and relational concept classes
inferredcites →https://doi.org/10.1613/jair.924openalex-snapshot
Improving the Efficiency of Inductive Logic Programming Through the Use of Query Packs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-23708-4_1openalex-snapshot
Reframing on Relational Data
inferred← citeshttps://doi.org/10.1007/978-3-319-23708-4_13openalex-snapshot
Complex Aggregates over Clusters of Elements
inferred← citeshttps://doi.org/10.1007/978-3-319-23708-4_4openalex-snapshot
Construction of Complex Aggregates with Random Restart Hill-Climbing
inferred← citeshttps://doi.org/10.1007/978-3-319-40566-7_2openalex-snapshot
CARAF: Complex Aggregates within Random Forests
inferred← citeshttps://doi.org/10.1007/978-3-540-73847-3_38openalex-snapshot
ReMauve: A Relational Model Tree Learner
inferred← citeshttps://doi.org/10.1007/978-3-540-85928-4_24openalex-snapshot
Learning Aggregate Functions with Neural Networks Using a Cascade-Correlation Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-88411-8_11openalex-snapshot
A Comparison between Neural Network Methods for Learning Aggregate Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-36657-4_8openalex-snapshot
Statistical Relational Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-38812-5_3openalex-snapshot
Propositionalisation of Continuous Attributes beyond Simple Aggregation
inferred← citeshttps://doi.org/10.1007/978-3-662-44848-9_12openalex-snapshot
Towards Automatic Feature Construction for Supervised Classification
inferred← citeshttps://doi.org/10.1007/s10994-011-5244-9openalex-snapshot
Gradient-based boosting for statistical relational learning: The relational dependency network case
inferred← citeshttps://doi.org/10.1016/j.artint.2013.08.002openalex-snapshot
Type Extension Trees for feature construction and learning in relational domains
inferred← citeshttps://doi.org/10.1016/j.eswa.2015.05.053openalex-snapshot
Flexible propositionalization of continuous attributes in relational data mining
inferred← citeshttps://doi.org/10.1016/j.knosys.2018.06.011openalex-snapshot
Generalization effect of quantifiers in a classification based on relational concept analysis
inferred← citeshttps://doi.org/10.3233/aic-2008-0422openalex-snapshot
Complex aggregates in relational learning
inferred← citeshttps://doi.org/10.70675/2a92e89az5c38z4601z9d30zc1df174d15caopenalex-snapshot
Etude mathématique de modèles quantiques et classiques pour les matériaux aléatoires à l'échelle atomique
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.