1214 search results - page 92 / 243 » Labeling Points with Weights |
127
click to vote
DKE
2002
15 years 19 days ago
2002
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
122
click to vote
DCG
2011
14 years 7 months ago
2011
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...
100
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
In many machine learning applications, like Brain - Computer Interfaces (BCI), only high-dimensional noisy data are available rendering the discrimination task non-trivial. In thi...
120
Voted
SODA
2001
ACM
15 years 2 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
99
Voted
AAAI
2010
15 years 2 months ago
2010
In many real world applications, labeled data are usually expensive to get, while there may be a large amount of unlabeled data. To reduce the labeling cost, active learning attem...