Sciweavers

273 search results - page 55 / 55
» Mining association rules from imprecise ordinal data
Sort
View
VLDB
2004
ACM
163views Database» more  VLDB 2004»
14 years 1 months ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...
DIS
2006
Springer
14 years 6 days ago
Visual Interactive Subgroup Discovery with Numerical Properties of Interest
Abstract. We propose an approach to subgroup discovery using distribution rules (a kind of association rules with a probability distribution on the consequent) for numerical proper...
Alípio Mário Jorge, Fernando Pereira...
SAC
2010
ACM
14 years 3 months ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil