Sciweavers

438 search results - page 34 / 88
» Data Structure and Algorithm in Data Mining: Granular Comput...
Sort
View
PODS
2008
ACM
211views Database» more  PODS 2008»
14 years 7 months ago
The power of two min-hashes for similarity search among hierarchical data objects
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
Sreenivas Gollapudi, Rina Panigrahy
ICDE
2010
IEEE
290views Database» more  ICDE 2010»
13 years 11 months ago
The Model-Summary Problem and a Solution for Trees
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
Biswanath Panda, Mirek Riedewald, Daniel Fink
ADC
2007
Springer
145views Database» more  ADC 2007»
14 years 1 months ago
The Privacy of k-NN Retrieval for Horizontal Partitioned Data -- New Methods and Applications
Recently, privacy issues have become important in clustering analysis, especially when data is horizontally partitioned over several parties. Associative queries are the core retr...
Artak Amirbekyan, Vladimir Estivill-Castro
KDD
2007
ACM
141views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining favorable facets
The importance of dominance and skyline analysis has been well recognized in multi-criteria decision making applications. Most previous studies assume a fixed order on the attribu...
Raymond Chi-Wing Wong, Jian Pei, Ada Wai-Chee Fu, ...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen