Sciweavers

1768 search results - page 35 / 354
» Mining Very Large Databases
Sort
View
ICDE
1999
IEEE
148views Database» more  ICDE 1999»
14 years 11 months ago
Efficient Mining of Partial Periodic Patterns in Time Series Database
Partial periodicity search, i.e., search for partial periodic patterns in time-series databases, is an interesting data mining problem. Previous studies on periodicity search main...
Jiawei Han, Guozhu Dong, Yiwen Yin
KDD
2004
ACM
137views Data Mining» more  KDD 2004»
14 years 3 months ago
Mining scale-free networks using geodesic clustering
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
Andrew Y. Wu, Michael Garland, Jiawei Han
SSD
2001
Springer
218views Database» more  SSD 2001»
14 years 2 months ago
Efficient Mining of Spatiotemporal Patterns
The problem of mining spatiotemporal patterns is finding sequences of events that occur frequently in spatiotemporal datasets. Spatiotemporal datasets store the evolution of object...
Ilias Tsoukatos, Dimitrios Gunopulos
TSDM
2000
189views Data Mining» more  TSDM 2000»
14 years 1 months ago
Join Indices as a Tool for Spatial Data Mining
The growing production of maps is generating huge volume of data stored in large spatial databases. This huge volume of data exceeds the human analysis capabilities. Spatial data m...
Karine Zeitouni, Laurent Yeh, Marie-Aude Aufaure
SIGMOD
2000
ACM
173views Database» more  SIGMOD 2000»
14 years 1 months ago
Efficient Algorithms for Mining Outliers from Large Data Sets
In this paper, we propose a novel formulation for distance-based outliers that is based on the distance of a point from its kth nearest neighbor. We rank each point on the basis o...
Sridhar Ramaswamy, Rajeev Rastogi, Kyuseok Shim