Sciweavers

1314 search results - page 56 / 263
» Approximate data mining in very large relational data
Sort
View
ICML
2009
IEEE
16 years 2 months ago
Prototype vector machine for large scale semi-supervised learning
Practical data mining rarely falls exactly into the supervised learning scenario. Rather, the growing amount of unlabeled data poses a big challenge to large-scale semi-supervised...
Kai Zhang, James T. Kwok, Bahram Parvin
SDM
2004
SIAM
207views Data Mining» more  SDM 2004»
15 years 3 months ago
BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
Jianyong Wang, George Karypis
VLDB
1998
ACM
115views Database» more  VLDB 1998»
15 years 5 months ago
Bank of America Case Study: The Information Currency Advantage
This paper describes the external forces that motivate financial institutions to collect, aggregate, analyze, and mine data so that it can be transformed into information, one of ...
Felipe Cariño, Mark Jahnke
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
16 years 2 months ago
Scaling up text classification for large file systems
: We combine the speed and scalability of information retrieval with the generally superior classification accuracy offered by machine learning, yielding a two-phase text classifie...
George Forman, Shyamsundar Rajaram
SIGIR
2009
ACM
15 years 8 months ago
Approximating true relevance distribution from a mixture model based on irrelevance data
Pseudo relevance feedback (PRF), which has been widely applied in IR, aims to derive a distribution from the top n pseudo relevant documents D. However, these documents are often ...
Peng Zhang, Yuexian Hou, Dawei Song