Sciweavers

1389 search results - page 235 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
15 years 10 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
KDD
2006
ACM
191views Data Mining» more  KDD 2006»
15 years 10 months ago
Beyond classification and ranking: constrained optimization of the ROI
Classification has been commonly used in many data mining projects in the financial service industry. For instance, to predict collectability of accounts receivable, a binary clas...
Lian Yan, Patrick Baldasare
ANOR
2005
160views more  ANOR 2005»
14 years 9 months ago
Packing r-Cliques in Weighted Chordal Graphs
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
Pavol Hell, Sulamita Klein, Loana Tito Nogueira, F...
PAKDD
2010
ACM
173views Data Mining» more  PAKDD 2010»
14 years 7 months ago
Distributed Knowledge Discovery with Non Linear Dimensionality Reduction
Data mining tasks results are usually improved by reducing the dimensionality of data. This improvement however is achieved harder in the case that data lay on a non linear manifol...
Panagis Magdalinos, Michalis Vazirgiannis, Dialect...
CVPR
2008
IEEE
15 years 12 months ago
Context-aware clustering
Most existing methods of semi-supervised clustering introduce supervision from outside, e.g., manually label some data samples or introduce constrains into clustering results. Thi...
Junsong Yuan, Ying Wu