Sciweavers

235 search results - page 44 / 47
» An efficient bit-based feature selection method
Sort
View
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
13 years 11 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
BMCBI
2007
114views more  BMCBI 2007»
13 years 7 months ago
Large scale statistical inference of signaling pathways from RNAi and microarray data
Background: The advent of RNA interference techniques enables the selective silencing of biologically interesting genes in an efficient way. In combination with DNA microarray tec...
Holger Fröhlich, Mark Fellmann, Holger Sü...
MIR
2005
ACM
198views Multimedia» more  MIR 2005»
14 years 1 months ago
Semi-automatic video annotation based on active learning with multiple complementary predictors
In this paper, we will propose a novel semi-automatic annotation scheme for video semantic classification. It is well known that the large gap between high-level semantics and low...
Yan Song, Xian-Sheng Hua, Li-Rong Dai, Meng Wang
KDD
2004
ACM
150views Data Mining» more  KDD 2004»
14 years 8 months ago
Markov Blankets and Meta-heuristics Search: Sentiment Extraction from Unstructured Texts
Extracting sentiments from unstructured text has emerged as an important problem in many disciplines. An accurate method would enable us, for example, to mine online opinions from ...
Edoardo Airoldi, Xue Bai, Rema Padman
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
14 years 8 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...