4085 search results - page 451 / 817 » Benchmarking Data Mining Algorithms |
197
click to vote
ICDM
2010
IEEE
15 years 3 months ago
2010
IEEE
In active learning, where a learning algorithm has to purchase the labels of its training examples, it is often assumed that there is only one labeler available to label examples, ...
186
click to vote
SDM
2012
SIAM
13 years 8 months ago
2012
SIAM
With the growth of the Internet and E-commerce, bipartite rating networks are ubiquitous. In such bipartite rating networks, there exist two types of entities: the users and the o...
154
Voted
ADMA
2005
Springer
15 years 11 months ago
2005
Springer
Accurate probability-based ranking of instances is crucial in many real-world data mining applications. KNN (k-nearest neighbor) [1] has been intensively studied as an effective c...
169
Voted
KDD
2010
ACM
15 years 10 months ago
2010
ACM
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
173
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...