Sciweavers

438 search results - page 30 / 88
» Data Structure and Algorithm in Data Mining: Granular Comput...
Sort
View
FCT
2001
Springer
14 years 22 hour ago
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miya...
KAIS
2007
75views more  KAIS 2007»
13 years 7 months ago
Non-redundant data clustering
Data clustering is a popular approach for automatically finding classes, concepts, or groups of patterns. In practice this discovery process should avoid redundancies with existi...
David Gondek, Thomas Hofmann
CPHYSICS
2006
124views more  CPHYSICS 2006»
13 years 7 months ago
Collision-free spatial hash functions for structural analysis of billion-vertex chemical bond networks
State-of-the-art molecular dynamics (MD) simulations generate massive datasets involving billion-vertex chemical bond networks, which makes data mining based on graph algorithms s...
Cheng Zhang, Bhupesh Bansal, Paulo S. Branicio, Ra...
SDM
2007
SIAM
182views Data Mining» more  SDM 2007»
13 years 9 months ago
Distance Preserving Dimension Reduction for Manifold Learning
Manifold learning is an effective methodology for extracting nonlinear structures from high-dimensional data with many applications in image analysis, computer vision, text data a...
Hyunsoo Kim, Haesun Park, Hongyuan Zha
SDM
2004
SIAM
141views Data Mining» more  SDM 2004»
13 years 9 months ago
Visually Mining through Cluster Hierarchies
Similarity search in database systems is becoming an increasingly important task in modern application domains such as multimedia, molecular biology, medical imaging, computer aid...
Stefan Brecheisen, Hans-Peter Kriegel, Peer Kr&oum...