Sciweavers

288 search results - page 22 / 58
» Estimating the number of frequent itemsets in a large databa...
Sort
View
193
Voted
DKE
2002
218views more  DKE 2002»
15 years 5 months ago
Computing iceberg concept lattices with T
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas P...
CIKM
2009
Springer
15 years 10 months ago
A novel approach for privacy mining of generic basic association rules
Data mining can extract important knowledge from large data collections - but sometimes these collections are split among various parties. Privacy concerns may prevent the parties...
Moez Waddey, Pascal Poncelet, Sadok Ben Yahia
CIKM
2010
Springer
15 years 4 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
KDD
2001
ACM
216views Data Mining» more  KDD 2001»
16 years 6 months ago
Real world performance of association rule algorithms
This study compares five well-known association rule algorithms using three real-world datasets and an artificial dataset. The experimental results confirm the performance improve...
Zijian Zheng, Ron Kohavi, Llew Mason
ICPR
2008
IEEE
16 years 7 months ago
Real-time camera position and posture estimation using a feature landmark database with priorities
In the field of computer vision, many kinds of camera parameter estimation methods have been proposed. As one of these methods, an extrinsic camera parameter estimation method tha...
Takafumi Taketomi, Tomokazu Sato, Naokazu Yokoya