Sciweavers

922 search results - page 13 / 185
» A data mining approach to database compression
Sort
View
DMKD
2004
ACM
167views Data Mining» more  DMKD 2004»
15 years 3 months ago
FP-tax: tree structure based generalized association rule mining
Data mining has been widely recognized as a powerful tool to explore added value from large-scale databases. One of data mining techniques, generalized association rule mining wit...
Iko Pramudiono, Masaru Kitsuregawa
DCC
2006
IEEE
15 years 9 months ago
Tradeoffs in XML Database Compression
Large XML data files, or XML databases, are now a common way to distribute scientific and bibliographic data, and storing such data efficiently is an important concern. A number o...
James Cheney
ADC
2003
Springer
182views Database» more  ADC 2003»
15 years 2 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
SISAP
2011
IEEE
437views Data Mining» more  SISAP 2011»
14 years 13 days ago
Succinct nearest neighbor search
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
Eric Sadit Tellez, Edgar Chávez, Gonzalo Na...
FGCS
2007
86views more  FGCS 2007»
14 years 9 months ago
A grid-based approach for enterprise-scale data mining
Abstract— We describe a grid-based approach for enterprisescale data mining that leverages database technology for I/O parallelism, and on-demand compute servers for compute para...
Ramesh Natarajan, Radu Sion, Thomas Phan