Sciweavers

341 search results - page 61 / 69
» Mining Comparative Sentences and Relations
Sort
View
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
14 years 8 months ago
Using graph-based metrics with empirical risk minimization to speed up active learning on networked data
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
Sofus A. Macskassy
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
14 years 8 months ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal
KDD
2002
ACM
155views Data Mining» more  KDD 2002»
14 years 8 months ago
SyMP: an efficient clustering approach to identify clusters of arbitrary shapes in large data sets
We propose a new clustering algorithm, called SyMP, which is based on synchronization of pulse-coupled oscillators. SyMP represents each data point by an Integrate-and-Fire oscill...
Hichem Frigui
KDD
2001
ACM
145views Data Mining» more  KDD 2001»
14 years 8 months ago
Proximal support vector machine classifiers
Given a dataset, each element of which labeled by one of k labels, we construct by a very fast algorithm, a k-category proximal support vector machine (PSVM) classifier. Proximal s...
Glenn Fung, Olvi L. Mangasarian
WSDM
2010
ACM
160views Data Mining» more  WSDM 2010»
14 years 5 months ago
Learning Concept Importance Using a Weighted Dependence Model
Modeling query concepts through term dependencies has been shown to have a significant positive effect on retrieval performance, especially for tasks such as web search, where rel...
Michael Bendersky, Donald Metzler, W. Bruce Croft