Sciweavers

489 search results - page 84 / 98
» Query Selectivity Estimation via Data Mining
Sort
View
ICDM
2006
IEEE
138views Data Mining» more  ICDM 2006»
15 years 3 months ago
Adaptive Blocking: Learning to Scale Up Record Linkage
Many information integration tasks require computing similarity between pairs of objects. Pairwise similarity computations are particularly important in record linkage systems, as...
Mikhail Bilenko, Beena Kamath, Raymond J. Mooney
EMNLP
2009
14 years 7 months ago
Reverse Engineering of Tree Kernel Feature Spaces
We present a framework to extract the most important features (tree fragments) from a Tree Kernel (TK) space according to their importance in the target kernelbased machine, e.g. ...
Daniele Pighin, Alessandro Moschitti
CIKM
2010
Springer
14 years 7 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
106
Voted
NLPRS
2001
Springer
15 years 1 months ago
A Bayesian Approach to Semi-Supervised Learning
Recent research in automated learning has focused on algorithms that learn from a combination of tagged and untagged data. Such algorithms can be referred to as semi-supervised in...
Rebecca F. Bruce
WSDM
2012
ACM
267views Data Mining» more  WSDM 2012»
13 years 5 months ago
Learning to rank with multi-aspect relevance for vertical search
Many vertical search tasks such as local search focus on specific domains. The meaning of relevance in these verticals is domain-specific and usually consists of multiple well-d...
Changsung Kang, Xuanhui Wang, Yi Chang, Belle L. T...