Sciweavers

822 search results - page 43 / 165
» Case Mining from Large Databases
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
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
14 years 8 months ago
Modeling relationships at multiple scales to improve accuracy of large recommender systems
The collaborative filtering approach to recommender systems predicts user preferences for products or services by learning past useritem relationships. In this work, we propose no...
Robert M. Bell, Yehuda Koren, Chris Volinsky
DCC
2000
IEEE
14 years 15 days ago
Summary Structures for Frequency Queries on Large Transaction Sets
As large-scale databases become commonplace, there has been signi cant interest in mining them for commercial purposes. One of the basic tasks that underlies many of these mining ...
Dow-Yung Yang, Akshay Johar, Ananth Grama, Wojciec...
DMSN
2006
ACM
14 years 2 months ago
Intelligent system monitoring on large clusters
Modern data centers have a large number of components that must be monitored, including servers, switches/routers, and environmental control systems. This paper describes InteMon,...
Jimeng Sun, Evan Hoke, John D. Strunk, Gregory R. ...
KDD
1998
ACM
148views Data Mining» more  KDD 1998»
14 years 9 days ago
Group Bitmap Index: A Structure for Association Rules Retrieval
Discovery of association rules from large databases of item sets is an important data mining problem. Association rules are usually stored in relational databases for future use i...
Tadeusz Morzy, Maciej Zakrzewicz