Sciweavers

2826 search results - page 16 / 566
» Maximal Vector Computation in Large Data Sets
Sort
View
HIS
2001
15 years 1 months ago
Use of Multi-category Proximal SVM for Data Set Reduction
In this paper we describe a method for data set reduction by effective use of Multi-category Proximal Support Vector Machine (MPSVM). By using the Linear MPSVM Formulation in an it...
S. V. N. Vishwanathan, M. Narasimha Murty
ICASSP
2011
IEEE
14 years 3 months ago
Rank-deficient quadratic-form maximization over M-phase alphabet: Polynomial-complexity solvability and algorithmic developments
The maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. Howeve...
Anastasios T. Kyrillidis, George N. Karystinos
NIPS
2001
15 years 1 months ago
Fast, Large-Scale Transformation-Invariant Clustering
In previous work on "transformed mixtures of Gaussians" and "transformed hidden Markov models", we showed how the EM algorithm in a discrete latent variable mo...
Brendan J. Frey, Nebojsa Jojic
ROCAI
2004
Springer
15 years 5 months ago
Learning Mixtures of Localized Rules by Maximizing the Area Under the ROC Curve
We introduce a model class for statistical learning which is based on mixtures of propositional rules. In our mixture model, the weight of a rule is not uniform over the entire ins...
Tobias Sing, Niko Beerenwinkel, Thomas Lengauer
ICDE
2005
IEEE
103views Database» more  ICDE 2005»
16 years 1 months ago
Vectorizing and Querying Large XML Repositories
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...
Peter Buneman, Byron Choi, Wenfei Fan, Robert Hutc...