1403 search results - page 148 / 281 » Set cover algorithms for very large datasets |
170
Voted
CIKM
2006
Springer
15 years 8 months ago
2006
Springer
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
160
click to vote
HAIS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Protein membership prediction is a fundamental task to retrieve information for unknown or unidentified sequences. When support vector machines (SVMs) are associated with...
109
click to vote
VLSID
2007
IEEE
16 years 6 months ago
2007
IEEE
State-of-the-art FPGA architectures have millions of gates in CLBs, Block RAMs, and Multiplier blocks which can host fairly large designs. While their physical design calls for oor...
269
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
The application of frequent patterns in classification appeared in sporadic studies and achieved initial success in the classification of relational data, text documents and graph...
184
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
In this paper, we propose a novel probabilistic approach to summarize frequent itemset patterns. Such techniques are useful for summarization, post-processing, and end-user interp...