Sciweavers

504 search results - page 26 / 101
» PCS: An Efficient Clustering Method for High-Dimensional Dat...
Sort
View
PR
2008
129views more  PR 2008»
13 years 7 months ago
A comparison of generalized linear discriminant analysis algorithms
7 Linear discriminant analysis (LDA) is a dimension reduction method which finds an optimal linear transformation that maximizes the class separability. However, in undersampled p...
Cheong Hee Park, Haesun Park
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
14 years 9 months ago
Similarity Search in Sets and Categorical Data Using the Signature Tree
Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...
Nikos Mamoulis, David W. Cheung, Wang Lian
JMLR
2010
115views more  JMLR 2010»
13 years 2 months ago
O-IPCAC and its Application to EEG Classification
In this paper we describe an online/incremental linear binary classifier based on an interesting approach to estimate the Fisher subspace. The proposed method allows to deal with ...
Alessandro Rozza, Gabriele Lombardi, Marco Rosa, E...
JMLR
2012
11 years 10 months ago
Maximum Margin Temporal Clustering
Temporal Clustering (TC) refers to the factorization of multiple time series into a set of non-overlapping segments that belong to k temporal clusters. Existing methods based on e...
Minh Hoai Nguyen, Fernando De la Torre
CVPR
2005
IEEE
14 years 9 months ago
Subspace Analysis Using Random Mixture Models
In [1], three popular subspace face recognition methods, PCA, Bayes, and LDA were analyzed under the same framework and an unified subspace analysis was proposed. However, since t...
Xiaogang Wang, Xiaoou Tang