Sciweavers

7150 search results - page 1225 / 1430
» Graph-Based Data Mining
Sort
View
ICML
2010
IEEE
13 years 10 months ago
SVM Classifier Estimation from Group Probabilities
A learning problem that has only recently gained attention in the machine learning community is that of learning a classifier from group probabilities. It is a learning task that ...
Stefan Rüping
ACTA
2007
85views more  ACTA 2007»
13 years 9 months ago
The complexity of satisfying constraints on databases of transactions
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
Toon Calders
ANOR
2010
119views more  ANOR 2010»
13 years 9 months ago
Alternating local search based VNS for linear classification
We consider the linear classification method consisting of separating two sets of points in d-space by a hyperplane. We wish to determine the hyperplane which minimises the sum of...
Frank Plastria, Steven De Bruyne, Emilio Carrizosa
CORR
2010
Springer
122views Education» more  CORR 2010»
13 years 9 months ago
A Unified Algorithmic Framework for Multi-Dimensional Scaling
In this paper, we propose a unified algorithmic framework for solving many known variants of MDS. Our algorithm is a simple iterative scheme with guaranteed convergence, and is mo...
Arvind Agarwal, Jeff M. Phillips, Suresh Venkatasu...
CORR
2008
Springer
92views Education» more  CORR 2008»
13 years 9 months ago
Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
Viet Tung Hoang, Wing-Kin Sung
« Prev « First page 1225 / 1430 Last » Next »