SADM
2010
13 years 6 months ago
2010
This paper is concerned with classifying high dimensional data into one of two categories. In various settings, such as when dealing with fMRI and microarray data, the number of v...
SADM
2010
13 years 6 months ago
2010
: The k nearest neighbor classification (k-NN) is a very simple and popular method for classification. However, it suffers from a major drawback, it assumes constant local class po...
SADM
2010
13 years 6 months ago
2010
SADM
2010
13 years 6 months ago
2010
: The traditional latent class analysis (LCA) uses a mixture model with binary responses on each subject that are independent conditional on cluster membership. However, in many pr...
SADM
2010
13 years 10 months ago
2010
The goal of frequent subgraph mining is to detect subgraphs that frequently occur in a dataset of graphs. In classification settings, one is often interested in discovering discr...
SADM
2010
13 years 10 months ago
2010
SADM
2010
13 years 10 months ago
2010
: This paper proposes twin prototype support vector machine (TVM), a constant space and sublinear time support vector machine (SVM) algorithm for online learning. TVM achieves its ...
SADM
2010
13 years 10 months ago
2010
: Seriation is an exploratory combinatorial data analysis technique to reorder objects into a sequence along a one-dimensional continuum so that it best reveals regularity and patt...