Propositionalisation and aggregates

DOI10.1007/3-540-44794-6_23MaRDI QIDQ4802593zbMATH OpenFDO

Authors Arno Knobbe, Marc de Haas, Arno P. J. M. Siebes

Publication date 21 April 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2168/21680277.htm

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Computing methodologies and applications (68U99)

Recommendations

• Involving aggregate functions in multi-relational search
• scientific article; zbMATH DE number 6026985
• Probabilistic aggregates
• Relational and semantic data mining (invited talk)
• Relational data mining

Cited in

(11)

• A clustering-based feature selection method for automatically generated relational attributes
• First order random forests: Learning relational classifiers with complex aggregates
• Distribution-based aggregation for relational learning with identifier attributes
• Regularizing conjunctive features for classification
• Involving aggregate functions in multi-relational search
• scientific article; zbMATH DE number 1916814 (Why is no real title available?)
• Type extension trees for feature construction and learning in relational domains
• Propositions as sessions
• scientific article; zbMATH DE number 6026985 (Why is no real title available?)
• Gelfond-Zhang aggregates as propositional formulas
• On aggregation functions based on linguistically quantified propositions and finitely additive set functions

This page was built for publication: Propositionalisation and aggregates

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