Sciweavers

867 search results - page 81 / 174
» The Generalized Maximum Coverage Problem
Sort
View
CIKM
2010
Springer
13 years 6 months ago
Combining link and content for collective active learning
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
Lixin Shi, Yuhang Zhao, Jie Tang
CIKM
2009
Springer
14 years 2 months ago
Helping editors choose better seed sets for entity set expansion
Sets of named entities are used heavily at commercial search engines such as Google, Yahoo and Bing. Acquiring sets of entities typically consists of combining semi-supervised exp...
Vishnu Vyas, Patrick Pantel, Eric Crestan
CVPR
1998
IEEE
14 years 10 months ago
Markov Random Fields with Efficient Approximations
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
Yuri Boykov, Olga Veksler, Ramin Zabih
HICSS
2003
IEEE
106views Biometrics» more  HICSS 2003»
14 years 1 months ago
An Alternative View of Knowledge Discovery
Inductive representation of conditional knowledge means to complete knowledge appropriately and can be looked upon as an instance of quite a general representation problem. The cr...
Christoph Beierle, Gabriele Kern-Isberner
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
13 years 9 months ago
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
Kenneth L. Clarkson