Sciweavers

150 search results - page 17 / 30
» Attack-resistant frequency counting
Sort
View
ACL
1998
13 years 8 months ago
PAT-Trees with the Deletion Function as the Learning Device for Linguistic Patterns
In this study, a learning device based on the PATtree data structures was developed. The original PAT-trees were enhanced with the deletion function to emulate human learning comp...
Keh-Jiann Chen, Wen Tsuei, Lee-Feng Chien
DATAMINE
2010
133views more  DATAMINE 2010»
13 years 7 months ago
Using background knowledge to rank itemsets
Assessing the quality of discovered results is an important open problem in data mining. Such assessment is particularly vital when mining itemsets, since commonly many of the disc...
Nikolaj Tatti, Michael Mampaey
TITB
2008
204views more  TITB 2008»
13 years 7 months ago
A Cryptographic Approach to Securely Share and Query Genomic Sequences
To support large-scale biomedical research projects, organizations need to share person-specific genomic sequences without violating the privacy of their data subjects. In the past...
Murat Kantarcioglu, Wei Jiang, Ying Liu, Bradley M...
KDD
2001
ACM
150views Data Mining» more  KDD 2001»
14 years 8 months ago
Empirical bayes screening for multi-item associations
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...
William DuMouchel, Daryl Pregibon
CIKM
2006
Springer
13 years 11 months ago
Finding highly correlated pairs efficiently with powerful pruning
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
Jian Zhang, Joan Feigenbaum