Sciweavers

475 search results - page 10 / 95
» A Distance-Based Packing Method for High Dimensional Data
Sort
View
APVIS
2010
13 years 5 months ago
Interactive local clustering operations for high dimensional data in parallel coordinates
In this paper, we propose an approach of clustering data in parallel coordinates through interactive local operations. Different from many other methods in which clustering is glo...
Peihong Guo, He Xiao, Zuchao Wang, Xiaoru Yuan
KDD
1998
ACM
190views Data Mining» more  KDD 1998»
13 years 11 months ago
Time Series Forecasting from High-Dimensional Data with Multiple Adaptive Layers
This paper describes our work in learning online models that forecast real-valued variables in a high-dimensional space. A 3GB database was collected by sampling 421 real-valued s...
R. Bharat Rao, Scott Rickard, Frans Coetzee
DEXA
2009
Springer
151views Database» more  DEXA 2009»
14 years 2 months ago
Detecting Projected Outliers in High-Dimensional Data Streams
Abstract. In this paper, we study the problem of projected outlier detection in high dimensional data streams and propose a new technique, called Stream Projected Ouliter deTector ...
Ji Zhang, Qigang Gao, Hai H. Wang, Qing Liu, Kai X...
CORR
2010
Springer
219views Education» more  CORR 2010»
13 years 7 months ago
Clustering high dimensional data using subspace and projected clustering algorithms
: Problem statement: Clustering has a number of techniques that have been developed in statistics, pattern recognition, data mining, and other fields. Subspace clustering enumerate...
Rahmat Widia Sembiring, Jasni Mohamad Zain, Abdull...
BMCBI
2007
123views more  BMCBI 2007»
13 years 7 months ago
Robust clustering in high dimensional data using statistical depths
Background: Mean-based clustering algorithms such as bisecting k-means generally lack robustness. Although componentwise median is a more robust alternative, it can be a poor cent...
Yuanyuan Ding, Xin Dang, Hanxiang Peng, Dawn Wilki...