Sciweavers

513 search results - page 19 / 103
» Efficient search for association rules
Sort
View
KDD
1995
ACM
130views Data Mining» more  KDD 1995»
15 years 1 months ago
Compression-Based Evaluation of Partial Determinations
Our work tackles the problem of finding partial determinations in databases and proposes a compressionbased measure to evaluate them. Partial determinations can be viewed as gener...
Bernhard Pfahringer, Stefan Kramer
86
Voted
ISBRA
2009
Springer
15 years 4 months ago
Mining of cis-Regulatory Motifs Associated with Tissue-Specific Alternative Splicing
KIM, JIHYE. Mining of Cis-Regulatory Motifs Associated with Tissue-Specific Alternative Splicing. (Under the direction of Steffen Heber). Alternative splicing (AS) is an important...
Jihye Kim, Sihui Zhao, Brian E. Howard, Steffen He...
CONNECTION
2007
87views more  CONNECTION 2007»
14 years 9 months ago
Efficient architectures for sparsely-connected high capacity associative memory models
In physical implementations of associative memory, wiring costs play a significant role in shaping patterns of connectivity. In this study of sparsely-connected associative memory...
Lee Calcraft, Rod Adams, Neil Davey
AIPS
2010
14 years 9 months ago
Iterative Learning of Weighted Rule Sets for Greedy Search
Greedy search is commonly used in an attempt to generate solutions quickly at the expense of completeness and optimality. In this work, we consider learning sets of weighted actio...
Yuehua Xu, Alan Fern, Sung Wook Yoon
KAIS
2006
164views more  KAIS 2006»
14 years 9 months ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis