Sciweavers

7751 search results - page 156 / 1551
» Data streams: algorithms and applications
Sort
View
DATAMINE
1999
140views more  DATAMINE 1999»
15 years 6 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...
SENSYS
2003
ACM
16 years 7 days ago
Matching data dissemination algorithms to application requirements
A distinguishing characteristic of wireless sensor networks is the opportunity to exploit characteristics of the application at lower layers. This approach is encouraged by device...
John S. Heidemann, Fabio Silva, Deborah Estrin
JDCTA
2010
122views more  JDCTA 2010»
15 years 1 months ago
The Application Research of High-dimensional Mixed-attribute Data Clustering Algorithm
High-dimensional mixed-attribute data clustering has become an important research direction in data mining area. Because of the advantages of the information technology, data coll...
Lilin Fan, Chunhong Liu, Qian Liu
191
Voted
PAKDD
2007
ACM
144views Data Mining» more  PAKDD 2007»
16 years 1 months ago
Approximately Mining Recently Representative Patterns on Data Streams
Catching the recent trend of data is an important issue when mining frequent itemsets from data streams. To prevent from storing the whole transaction data within the sliding windo...
Jia-Ling Koh, Yuan-Bin Don
DAWAK
2006
Springer
15 years 10 months ago
An Approximate Approach for Mining Recently Frequent Itemsets from Data Streams
Recently, the data stream, which is an unbounded sequence of data elements generated at a rapid rate, provides a dynamic environment for collecting data sources. It is likely that ...
Jia-Ling Koh, Shu-Ning Shin