Sciweavers

2337 search results - page 344 / 468
» Is the Open Way a Better Way
Sort
View
202
Voted
KER
2006
107views more  KER 2006»
15 years 7 months ago
Partitioning strategies for distributed association rule mining
In this paper a number of alternative strategies for distributed/parallel association rule mining are investigated. The methods examined make use of a data structure, the T-tree, ...
Frans Coenen, Paul H. Leng
205
Voted
PAMI
2006
208views more  PAMI 2006»
15 years 7 months ago
Combining Reconstructive and Discriminative Subspace Methods for Robust Classification and Regression by Subsampling
Linear subspace methods that provide sufficient reconstruction of the data, such as PCA, offer an efficient way of dealing with missing pixels, outliers, and occlusions that often ...
Sanja Fidler, Danijel Skocaj, Ales Leonardis
PR
2006
102views more  PR 2006»
15 years 7 months ago
Prototype selection for dissimilarity-based classifiers
A conventional way to discriminate between objects represented by dissimilarities is the nearest neighbor method. A more efficient and sometimes a more accurate solution is offere...
Elzbieta Pekalska, Robert P. W. Duin, Pavel Pacl&i...
IJAR
2007
130views more  IJAR 2007»
15 years 7 months ago
Bayesian network learning algorithms using structural restrictions
The use of several types of structural restrictions within algorithms for learning Bayesian networks is considered. These restrictions may codify expert knowledge in a given domai...
Luis M. de Campos, Javier Gomez Castellano
215
Voted
SIAMSC
2008
167views more  SIAMSC 2008»
15 years 7 months ago
Low-Dimensional Polytope Approximation and Its Applications to Nonnegative Matrix Factorization
In this study, nonnegative matrix factorization is recast as the problem of approximating a polytope on the probability simplex by another polytope with fewer facets. Working on th...
Moody T. Chu, Matthew M. Lin