2286 search results - page 13 / 458 » Algorithms for Categorical Equivalence |
VLDB
1998
ACM
13 years 11 months ago
1998
ACM
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
SEQLEARN
2001
Springer
13 years 12 months ago
2001
Springer
CORR
2011
Springer
12 years 11 months ago
2011
Springer
- In this work we are analyzing scalability of the heuristic algorithm we used in the past [1-4] to discover knowledge from multi-valued symbolic attributes in fuzzy databases. The...
APWEB
2005
Springer
14 years 1 months ago
2005
Springer
The dramatic growth in the number and size of on-line information sources has fueled increasing research interest in the incremental subspace learning problem. In this paper, we pr...
TKDE
2002
13 years 7 months ago
2002
We consider the problem of finding a set of attribute values that give a high quality binary segmentation of a database. The quality of a segmentation is defined by an objective fu...