1314 search results - page 116 / 263 » Approximate data mining in very large relational data |
COLT
2004
Springer
15 years 7 months ago
2004
Springer
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
121
click to vote
VLDB
1998
ACM
15 years 6 months ago
1998
ACM
Classification of large datasets is an important data mining problem. Many classification algorithms have been proposed in the literature, but studies have shown that so far no al...
141
click to vote
FQAS
2004
Springer
15 years 5 months ago
2004
Springer
The discovery of frequently occurring patterns in a time series could be important in several application contexts. As an example, the analysis of frequent patterns in biomedical ...
IJNVO
2011
14 years 8 months ago
2011
: Data collection of covert networks is an inherently difficult task because of the very nature of these networks. Researchers find it difficult to locate and access data relating ...
110
Voted
KDD
1999
ACM
15 years 6 months ago
1999
ACM
We propose to use AdaBoost to efficiently learn classifiers over very large and possibly distributed data sets that cannot fit into main memory, as well as on-line learning wher...