Sciweavers

25041 search results - page 100 / 5009
» Algorithms for Clustering Data
Sort
View
SSD
2005
Springer
173views Database» more  SSD 2005»
14 years 1 months ago
On Discovering Moving Clusters in Spatio-temporal Data
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...
Panos Kalnis, Nikos Mamoulis, Spiridon Bakiras
DATAMINE
1999
140views more  DATAMINE 1999»
13 years 7 months ago
A Scalable Parallel Algorithm for Self-Organizing Maps with Applications to Sparse Data Mining Problems
Abstract. We describe a scalable parallel implementation of the self organizing map (SOM) suitable for datamining applications involving clustering or segmentation against large da...
Richard D. Lawrence, George S. Almasi, Holly E. Ru...
SDM
2007
SIAM
122views Data Mining» more  SDM 2007»
13 years 9 months ago
Incremental Spectral Clustering With Application to Monitoring of Evolving Blog Communities
In recent years, spectral clustering method has gained attentions because of its superior performance compared to other traditional clustering algorithms such as K-means algorithm...
Huazhong Ning, Wei Xu, Yun Chi, Yihong Gong, Thoma...
MDAI
2007
Springer
14 years 2 months ago
Lindig's Algorithm for Concept Lattices over Graded Attributes
Formal concept analysis (FCA) is a method of exploratory data analysis. The data is in the form of a table describing relationship between objects (rows) and attributes (columns), ...
Radim Belohlávek, Bernard De Baets, Jan Out...
JIPS
2006
129views more  JIPS 2006»
13 years 8 months ago
ASVMRT: Materialized View Selection Algorithm in Data Warehouse
: In order to acquire a precise and quick response to an analytical query, proper selection of the views to materialize in the data warehouse is crucial. In traditional view select...
Jin-Hyuk Yang, In-Jeong Chung