Sciweavers

168 search results - page 10 / 34
» Anytime Exploratory Data Analysis for Massive Data Sets
Sort
View
KDD
2002
ACM
193views Data Mining» more  KDD 2002»
14 years 7 months ago
Query, analysis, and visualization of hierarchically structured data using Polaris
In the last several years, large OLAP databases have become common in a variety of applications such as corporate data warehouses and scientific computing. To support interactive ...
Chris Stolte, Diane Tang, Pat Hanrahan
PPOPP
2012
ACM
12 years 2 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
ICPR
2002
IEEE
14 years 3 hour ago
Uniformity Testing Using Minimal Spanning Tree
Testing for uniformity of multivariate data is the initial step in exploratory pattern analysis. We propose a new uniformity testing method, which first computes the maximum (sta...
Anil K. Jain, Xiaowei Xu, Tin Kam Ho, Fan Xiao
ITCC
2005
IEEE
14 years 19 days ago
A Scalable Generative Topographic Mapping for Sparse Data Sequences
We propose a novel, computationally efficient generative topographic model for inferring low dimensional representations of high dimensional data sets, designed to exploit data s...
Ata Kabán
IJON
2006
85views more  IJON 2006»
13 years 7 months ago
From outliers to prototypes: Ordering data
We propose simple and fast methods based on nearest neighbors that order objects from high-dimensional data sets from typical points to untypical points. On the one hand, we show ...
Stefan Harmeling, Guido Dornhege, David M. J. Tax,...