Sciweavers

3866 search results - page 23 / 774
» Classification of Ordinal Data
Sort
View
FLAIRS
2004
13 years 11 months ago
Blind Data Classification Using Hyper-Dimensional Convex Polytopes
A blind classification algorithm is presented that uses hyperdimensional geometric algorithms to locate a hypothesis, in the form of a convex polytope or hyper-sphere. The convex ...
Brent T. McBride, Gilbert L. Peterson
IJON
2006
99views more  IJON 2006»
13 years 9 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
PKDD
2000
Springer
116views Data Mining» more  PKDD 2000»
14 years 1 months ago
Prior Knowledge in Economic Applications of Data Mining
A common form of prior knowledge in economic modelling concerns the monotonicity of relations between the dependent and explanatory variables. Monotonicity may also be an important...
A. J. Feelders
CLASSIFICATION
2008
54views more  CLASSIFICATION 2008»
13 years 10 months ago
On the Indeterminacy of Resemblance Measures for Binary (Presence/Absence) Data
: Many similarity coefficients for binary data are defined as fractions. For certain resemblance measures the denominator may become zero. If the denominator is zero the value of t...
Matthijs J. Warrens