Sciweavers

7150 search results - page 955 / 1430
» Graph-Based Data Mining
Sort
View
GFKL
2007
Springer
139views Data Mining» more  GFKL 2007»
15 years 11 months ago
The Noise Component in Model-based Cluster Analysis
The so-called noise-component has been introduced by Banfield and Raftery (1993) to improve the robustness of cluster analysis based on the normal mixture model. The idea is to ad...
Christian Hennig, Pietro Coretto
GIS
2007
ACM
15 years 11 months ago
Predicting future locations using clusters' centroids
As technology advances we encounter more available data on moving objects, thus increasing our ability to mine spatiotemporal data. We can use this data for learning moving object...
Sigal Elnekave, Mark Last, Oded Maimon
KDD
2007
ACM
210views Data Mining» more  KDD 2007»
15 years 11 months ago
Machine learning for stock selection
In this paper, we propose a new method called Prototype Ranking (PR) designed for the stock selection problem. PR takes into account the huge size of real-world stock data and app...
Robert J. Yan, Charles X. Ling
122
Voted
ICDM
2006
IEEE
92views Data Mining» more  ICDM 2006»
15 years 11 months ago
Window-based Tensor Analysis on High-dimensional and Multi-aspect Streams
Data stream values are often associated with multiple aspects. For example, each value from environmental sensors may have an associated type (e.g., temperature, humidity, etc) as...
Jimeng Sun, Spiros Papadimitriou, Philip S. Yu
ICDM
2005
IEEE
109views Data Mining» more  ICDM 2005»
15 years 10 months ago
Triple Jump Acceleration for the EM Algorithm
This paper presents the triple jump framework for accelerating the EM algorithm and other bound optimization methods. The idea is to extrapolate the third search point based on th...
Han-Shen Huang, Bou-Ho Yang, Chun-Nan Hsu