Sciweavers

2421 search results - page 125 / 485
» Measuring independence of datasets
Sort
View
KDD
2002
ACM
109views Data Mining» more  KDD 2002»
16 years 6 months ago
Topics in 0--1 data
Large 0-1 datasets arise in various applications, such as market basket analysis and information retrieval. We concentrate on the study of topic models, aiming at results which in...
Ella Bingham, Heikki Mannila, Jouni K. Seppän...
VLDB
2009
ACM
130views Database» more  VLDB 2009»
16 years 6 months ago
Multi-dimensional top-k dominating queries
Abstract The top-k dominating query returns k data objects which dominate the highest number of objects in a dataset. This query is an important tool for decision support since it ...
Man Lung Yiu, Nikos Mamoulis
IPPS
2007
IEEE
16 years 20 days ago
Scalable Distributed Execution Environment for Large Data Visualization
To use heterogeneous and geographically distributed resources as a platform for parallel visualization is an intriguing topic of research. This is because of the immense potential...
Micah Beck, Huadong Liu, Jian Huang, Terry Moore
IPPS
2006
IEEE
16 years 12 days ago
Tree partition based parallel frequent pattern mining on shared memory systems
In this paper, we present a tree-partition algorithm for parallel mining of frequent patterns. Our work is based on FP-Growth algorithm, which is constituted of tree-building stag...
Dehao Chen, Chunrong Lai, Wei Hu, Wenguang Chen, Y...
DIS
2006
Springer
15 years 10 months ago
Incremental Algorithm Driven by Error Margins
Incremental learning is an approach to deal with the classification task when datasets are too large or when new examples can arrive at any time. One possible approach uses concent...
Gonzalo Ramos-Jiménez, José del Camp...