Sciweavers

7163 search results - page 1224 / 1433
» Privacy-Preserving Data Mining
Sort
View
ACTA
2007
85views more  ACTA 2007»
15 years 5 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»
15 years 5 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»
15 years 5 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»
15 years 5 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
CORR
2010
Springer
200views Education» more  CORR 2010»
15 years 5 months ago
A Multilevel Approach For Nonnegative Matrix Factorization
Nonnegative Matrix Factorization (NMF) is the problem of approximating a nonnegative matrix with the product of two low-rank nonnegative matrices and has been shown to be particul...
Nicolas Gillis, François Glineur
« Prev « First page 1224 / 1433 Last » Next »