2383 search results - page 233 / 477 » Finding Representative Set from Massive Data |
167
click to vote
CINQ
2004
Springer
15 years 11 months ago
2004
Springer
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
178
click to vote
RECOMB
2007
Springer
16 years 6 months ago
2007
Springer
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...
154
click to vote
DATAMINE
2006
15 years 6 months ago
2006
To efficiently find global patterns from a multi-database, information in each local database must first be mined and summarized at the local level. Then only the summarized infor...
152
click to vote
ICDM
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper we study when the disclosure of data mining results represents, per se, a threat to the anonymity of the individuals recorded in the analyzed database. The novelty o...
160
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
In this paper we focus on high dimensional data sets for which the number of dimensions is an order of magnitude higher than the number of objects. From a classifier design standp...