Sciweavers

1163 search results - page 66 / 233
» Concurrent Subspaces Analysis
Sort
View
KDD
2005
ACM
137views Data Mining» more  KDD 2005»
15 years 12 months ago
Pattern-based similarity search for microarray data
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
Haixun Wang, Jian Pei, Philip S. Yu
ICPR
2006
IEEE
15 years 5 months ago
Fast Linear Discriminant Analysis Using Binary Bases
Linear Discriminant Analysis (LDA) is a widely used technique for pattern classification. It seeks the linear projection of the data to a low dimensional subspace where the data ...
Feng Tang, Hai Tao
ECML
2004
Springer
15 years 5 months ago
The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
Marco Saerens, François Fouss, Luh Yen, Pie...
TOPNOC
2008
14 years 11 months ago
TAPAs: A Tool for the Analysis of Process Algebras
Process Algebras are formalisms for modelling concurrent systems that permit mathematical reasoning with respect to a set of desired properties. TAPAs is a tool that can be used to...
Francesco Calzolai, Rocco De Nicola, Michele Loret...
CVPR
2007
IEEE
16 years 1 months ago
Sparse Kernels for Bayes Optimal Discriminant Analysis
Discriminant Analysis (DA) methods have demonstrated their utility in countless applications in computer vision and other areas of research ? especially in the C class classificat...
Aleix M. Martínez, Onur C. Hamsici