Sciweavers

1701 search results - page 109 / 341
» Providing k-anonymity in data mining
Sort
View
IPPS
2006
IEEE
15 years 4 months ago
Design and analysis of a multi-dimensional data sampling service for large scale data analysis applications
Sampling is a widely used technique to increase efficiency in database and data mining applications operating on large dataset. In this paper we present a scalable sampling imple...
Xi Zhang, Tahsin M. Kurç, Joel H. Saltz, Sr...
ICDM
2009
IEEE
152views Data Mining» more  ICDM 2009»
15 years 4 months ago
SLIDER: Mining Correlated Motifs in Protein-Protein Interaction Networks
Correlated motif mining (CMM) is the problem to find overrepresented pairs of patterns, called motif pairs, in interacting protein sequences. Algorithmic solutions for CMM thereb...
Peter Boyen, Frank Neven, Dries Van Dyck, Aalt-Jan...
ICDM
2007
IEEE
131views Data Mining» more  ICDM 2007»
15 years 4 months ago
Parallel Mining of Frequent Closed Patterns: Harnessing Modern Computer Architectures
Inspired by emerging multi-core computer architectures, in this paper we present MT CLOSED, a multi-threaded algorithm for frequent closed itemset mining (FCIM). To the best of ou...
Claudio Lucchese, Salvatore Orlando, Raffaele Pere...
CIKM
2003
Springer
15 years 3 months ago
Question answering from the web using knowledge annotation and knowledge mining techniques
We present a strategy for answering fact-based natural language questions that is guided by a characterization of realworld user queries. Our approach, implemented in a system cal...
Jimmy J. Lin, Boris Katz
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
15 years 10 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...