Sciweavers

2065 search results - page 242 / 413
» Techniques of Cluster Algorithms in Data Mining
Sort
View
KDD
2008
ACM
134views Data Mining» more  KDD 2008»
16 years 7 months ago
Privacy-preserving cox regression for survival analysis
Privacy-preserving data mining (PPDM) is an emergent research area that addresses the incorporation of privacy preserving concerns to data mining techniques. In this paper we prop...
Shipeng Yu, Glenn Fung, Rómer Rosales, Srir...
TMM
2008
201views more  TMM 2008»
15 years 6 months ago
Fast Best-Match Shape Searching in Rotation-Invariant Metric Spaces
Object recognition and content-based image retrieval systems rely heavily on the accurate and efficient identification of shapes. A fundamental requirement in the shape analysis p...
Dragomir Yankov, Eamonn J. Keogh, Li Wei, Xiaopeng...
DATAMINE
1999
108views more  DATAMINE 1999»
15 years 6 months ago
A Survey of Methods for Scaling Up Inductive Algorithms
Abstract. One of the de ning challenges for the KDD research community is to enable inductive learning algorithms to mine very large databases. This paper summarizes, categorizes, ...
Foster J. Provost, Venkateswarlu Kolluri
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
15 years 4 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
DKE
2006
83views more  DKE 2006»
15 years 6 months ago
Bulk insertion for R-trees by seeded clustering
We propose a scalable technique called Seeded Clustering that allows us to maintain R-tree indices by bulk insertion while keeping pace with high data arrival rates. Our approach ...
Taewon Lee, Bongki Moon, Sukho Lee