Sciweavers

2383 search results - page 18 / 477
» Finding Representative Set from Massive Data
Sort
View
ICDE
2003
IEEE
116views Database» more  ICDE 2003»
15 years 11 months ago
Joining Massive High-Dimensional Datasets
We consider the problem of joining massive datasets. We propose two techniques for minimizing disk I/O cost of join operations for both spatial and sequence data. Our techniques o...
Tamer Kahveci, Christian A. Lang, Ambuj K. Singh
AUSAI
2006
Springer
15 years 1 months ago
Learning Hybrid Bayesian Networks by MML
Abstract. We use a Markov Chain Monte Carlo (MCMC) MML algorithm to learn hybrid Bayesian networks from observational data. Hybrid networks represent local structure, using conditi...
Rodney T. O'Donnell, Lloyd Allison, Kevin B. Korb
ICDM
2007
IEEE
121views Data Mining» more  ICDM 2007»
15 years 4 months ago
ORIGAMI: Mining Representative Orthogonal Graph Patterns
In this paper, we introduce the concept of α-orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are α-orthogonal if their simila...
Mohammad Al Hasan, Vineet Chaoji, Saeed Salem, J&e...
JPDC
2008
217views more  JPDC 2008»
14 years 9 months ago
Parallel techniques for information extraction from hyperspectral imagery using heterogeneous networks of workstations
Recent advances in space and computer technologies are revolutionizing the way remotely sensed data is collected, managed and interpreted. In particular, NASA is continuously gath...
Antonio J. Plaza
SIGMOD
2000
ACM
173views Database» more  SIGMOD 2000»
15 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