Sciweavers

2124 search results - page 261 / 425
» Repairing Structurally Complex Data
Sort
View
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
14 years 2 months ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore
RSCTC
2000
Springer
197views Fuzzy Logic» more  RSCTC 2000»
14 years 1 months ago
Rough Set Approach to CBR
We discuss how Case Based Reasoning (CBR) (see e.g. [1], [4]) philosophy of adaptation of some known situations to new similar ones can be realized in rough set framework [5] for c...
Jan Wierzbicki
CORR
2010
Springer
175views Education» more  CORR 2010»
13 years 6 months ago
Improving the Performance of maxRPC
Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that can achieve considerably stronger pruning than arc consistency. However, existing maxRPC...
Thanasis Balafoutis, Anastasia Paparrizou, Kostas ...
CSB
2003
IEEE
14 years 3 months ago
LOGOS: a modular Bayesian model for de novo motif detection
The complexity of the global organization and internal structures of motifs in higher eukaryotic organisms raises significant challenges for motif detection techniques. To achiev...
Eric P. Xing, Wei Wu, Michael I. Jordan, Richard M...
CORR
2000
Springer
116views Education» more  CORR 2000»
13 years 10 months ago
Algorithmic Statistics
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...
Péter Gács, John Tromp, Paul M. B. V...