Sciweavers

6388 search results - page 274 / 1278
» High Performance Data Mining
Sort
View
168
Voted
NN
2010
Springer
183views Neural Networks» more  NN 2010»
15 years 4 months ago
Dimensionality reduction for density ratio estimation in high-dimensional spaces
The ratio of two probability density functions is becoming a quantity of interest these days in the machine learning and data mining communities since it can be used for various d...
Masashi Sugiyama, Motoaki Kawanabe, Pui Ling Chui
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
16 years 6 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
IEAAIE
2009
Springer
16 years 21 days ago
Incremental Mining of Ontological Association Rules in Evolving Environments
The process of knowledge discovery from databases is a knowledge intensive, highly user-oriented practice, thus has recently heralded the development of ontology-incorporated data ...
Ming-Cheng Tseng, Wen-Yang Lin
BMCBI
2010
139views more  BMCBI 2010»
15 years 6 months ago
A highly efficient multi-core algorithm for clustering extremely large datasets
Background: In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput t...
Johann M. Kraus, Hans A. Kestler
310
Voted
AICCSA
2008
IEEE
216views Hardware» more  AICCSA 2008»
15 years 6 months ago
Mining fault tolerant frequent patterns using pattern growth approach
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...
Shariq Bashir, Zahid Halim, Abdul Rauf Baig