Sciweavers

3866 search results - page 85 / 774
» Classification of Ordinal Data
Sort
View
JMLR
2008
104views more  JMLR 2008»
13 years 10 months ago
Learning Reliable Classifiers From Small or Incomplete Data Sets: The Naive Credal Classifier 2
In this paper, the naive credal classifier, which is a set-valued counterpart of naive Bayes, is extended to a general and flexible treatment of incomplete data, yielding a new cl...
Giorgio Corani, Marco Zaffalon
IJBIDM
2007
91views more  IJBIDM 2007»
13 years 10 months ago
An efficient weighted nearest neighbour classifier using vertical data representation
: The k-nearest neighbour (KNN) technique is a simple yet effective method for classification. In this paper, we propose an efficient weighted nearest neighbour classification algo...
William Perrizo, Qin Ding, Maleq Khan, Anne Denton...
ACIIDS
2010
IEEE
170views Database» more  ACIIDS 2010»
13 years 8 months ago
On the Effectiveness of Gene Selection for Microarray Classification Methods
Microarray data usually contains a high level of noisy gene data, the noisy gene data include incorrect, noise and irrelevant genes. Before Microarray data classification takes pla...
Zhongwei Zhang, Jiuyong Li, Hong Hu, Hong Zhou
CLASSIFICATION
2008
111views more  CLASSIFICATION 2008»
13 years 10 months ago
Probabilistic D-Clustering
: We present a new iterative method for probabilistic clustering of data. Given clusters, their centers and the distances of data points from these centers, the probability of clus...
Adi Ben-Israel, Cem Iyigun
PKDD
2009
Springer
137views Data Mining» more  PKDD 2009»
14 years 4 months ago
On Subgroup Discovery in Numerical Domains
Subgroup discovery is a Knowledge Discovery task that aims at finding subgroups of a population with high generality and distributional unusualness. While several subgroup discove...
Henrik Grosskreutz, Stefan Rüping