Finding association rules using fast bit computation: Machine-oriented modeling

DOI10.1007/3-540-39963-1_51MaRDI QIDQ2766981zbMATH OpenFDO

Authors Tsau Young Lin

Publication date 25 April 2002

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

Full work available at URL https://doi.org/10.1007/3-540-39963-1_51

zbMATH Keywords

association rulesBoolean operationdata mininggranular computingmachine oriented model

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1748428
• Discovering fuzzy association rules in large database relations
• Computing association rules using partial totals
• scientific article; zbMATH DE number 2084667
• A fast algorithm for mining association rules

Cited in

(6)

• Computing exact permutation \(p\)-values for association rules
• Spark solutions for discovering fuzzy association rules in big data
• A novel clustering algorithm using hypergraph-based granular computing
• A formal model for mining fuzzy rules using the RL representation theory
• scientific article; zbMATH DE number 1748428 (Why is no real title available?)
• Mining association rules from imprecise ordinal data

This page was built for publication: Finding association rules using fast bit computation: Machine-oriented modeling

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