Sciweavers

10 search results - page 1 / 2
» Towards exploratory test instance specific algorithms for hi...
Sort
View
KDD
2005
ACM
142views Data Mining» more  KDD 2005»
14 years 5 months ago
Towards exploratory test instance specific algorithms for high dimensional classification
In an interactive classification application, a user may find it more valuable to develop a diagnostic decision support method which can reveal significant classification behavior...
Charu C. Aggarwal
APWEB
2009
Springer
13 years 8 months ago
Ontology Evaluation through Text Classification
We present a new method to evaluate a search ontology, which relies on mapping ontology instances to textual documents. On the basis of this mapping, we evaluate the adequacy of on...
Yael Dahan Netzer, David Gabay, Meni Adler, Yoav G...
BMCBI
2010
224views more  BMCBI 2010»
13 years 4 months ago
An adaptive optimal ensemble classifier via bagging and rank aggregation with applications to high dimensional data
Background: Generally speaking, different classifiers tend to work well for certain types of data and conversely, it is usually not known a priori which algorithm will be optimal ...
Susmita Datta, Vasyl Pihur, Somnath Datta
AUSDM
2008
Springer
211views Data Mining» more  AUSDM 2008»
13 years 6 months ago
LBR-Meta: An Efficient Algorithm for Lazy Bayesian Rules
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
Zhipeng Xie
BMCBI
2005
78views more  BMCBI 2005»
13 years 4 months ago
Correlation test to assess low-level processing of high-density oligonucleotide microarray data
Background: There are currently a number of competing techniques for low-level processing of oligonucleotide array data. The choice of technique has a profound effect on subsequen...
Alexander Ploner, Lance D. Miller, Per Hall, Jonas...