Sciweavers

775 search results - page 32 / 155
» Cone-restricted subspace methods
Sort
View
EJC
2006
13 years 8 months ago
Invariant subspaces, duality, and covers of the Petersen graph
A general method for finding elementary abelian regular covering projections of finite connected graphs is applied to the Petersen graph. As a result, a complete list of pairwise ...
Aleksander Malnic, Primoz Potocnik
IJON
2006
99views more  IJON 2006»
13 years 8 months ago
Feature selection in independent component subspace for microarray data classification
A novel method for microarray data classification is proposed in this letter. In this scheme, the sequential floating forward selection (SFFS) technique is used to select the inde...
Chun-Hou Zheng, De-Shuang Huang, Li Shang
ICPR
2004
IEEE
14 years 9 months ago
Optimizing Nearest Neighbour in Random Subspaces using a Multi-Objective Genetic Algorithm
In this work, the authors have evaluated almost 20 millions ensembles of classifiers generated by several methods. Trying to optimize those ensembles based on the nearest neighbou...
Guillaume Tremblay, Robert Sabourin, Patrick Maupi...
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
14 years 9 months ago
CLICKS: an effective algorithm for mining subspace clusters in categorical datasets
We present a novel algorithm called Clicks, that finds clusters in categorical datasets based on a search for k-partite maximal cliques. Unlike previous methods, Clicks mines subs...
Mohammed Javeed Zaki, Markus Peters, Ira Assent, T...
ICPR
2008
IEEE
14 years 2 months ago
Spatio-temporal patches for night background modeling by subspace learning
In this paper, a novel background model on spatio-temporal patches is introduced for video surveillance, especially for night outdoor scene, where extreme lighting conditions ofte...
Youdong Zhao, Haifeng Gong, Liang Lin, Yunde Jia