7150 search results - page 669 / 1430 » Graph-Based Data Mining |
169
click to vote
PKDD
2001
Springer
15 years 11 months ago
2001
Springer
Large amount of available information does not necessarily imply that induction algorithms must use all this information. Samples often provide the same accuracy with less computat...
205
click to vote
KDD
2010
ACM
15 years 9 months ago
2010
ACM
Recent advances in linear classification have shown that for applications such as document classification, the training can be extremely efficient. However, most of the existing t...
222
Voted
KDD
2002
ACM
16 years 7 months ago
2002
ACM
In this paper, we present a new co-training strategy that makes use of unlabelled data. It trains two predictors in parallel, with each predictor labelling the unlabelled data for...
236
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Data domain description techniques aim at deriving concise descriptions of objects belonging to a category of interest. For instance, the support vector domain description (SVDD) l...
199
click to vote
ICDM
2006
IEEE
16 years 1 months ago
2006
IEEE
Most clustering algorithms are partitional in nature, assigning each data point to exactly one cluster. However, several real world datasets have inherently overlapping clusters i...