Sciweavers

1314 search results - page 170 / 263
» Approximate data mining in very large relational data
Sort
View
SDM
2011
SIAM
232views Data Mining» more  SDM 2011»
14 years 7 months ago
A Sequential Dual Method for Structural SVMs
In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to computationa...
Shirish Krishnaj Shevade, Balamurugan P., S. Sunda...
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
16 years 4 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
SDM
2010
SIAM
144views Data Mining» more  SDM 2010»
15 years 5 months ago
Predictive Modeling with Heterogeneous Sources
Lack of labeled training examples is a common problem for many applications. In the same time, there is usually an abundance of labeled data from related tasks. But they have diff...
Xiaoxiao Shi, Qi Liu, Wei Fan, Qiang Yang, Philip ...
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
16 years 4 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
KDD
2001
ACM
150views Data Mining» more  KDD 2001»
16 years 4 months ago
Empirical bayes screening for multi-item associations
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...
William DuMouchel, Daryl Pregibon