Sciweavers

582 search results - page 23 / 117
» Info-fuzzy algorithms for mining dynamic data streams
Sort
View
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
16 years 4 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
WWW
2004
ACM
16 years 5 months ago
On mining webclick streams for path traversal patterns
Mining user access patterns from a continuous stream of Web-clicks presents new challenges over traditional Web usage mining in a large static Web-click database. Modeling user ac...
Hua-Fu Li, Suh-Yin Lee, Man-Kwan Shan
DIS
2006
Springer
15 years 8 months ago
Kalman Filters and Adaptive Windows for Learning in Data Streams
We study the combination of Kalman filter and a recently proposed algorithm for dynamically maintaining a sliding window, for learning from streams of examples. We integrate this i...
Albert Bifet, Ricard Gavaldà
EPIA
2003
Springer
15 years 9 months ago
Mining Low Dimensionality Data Streams of Continuous Attributes
This paper presents an incremental and scalable learning algorithm in order to mine numeric, low dimensionality, high–cardinality, time–changing data streams. Within the Superv...
Francisco J. Ferrer-Troyano, Jesús S. Aguil...
IEAAIE
2000
Springer
15 years 7 months ago
Dynamic Data Mining
Business information received from advanced data analysis and data mining is a critical success factor for companies wishing to maximize competitive advantage. The use of tradition...
Vijay V. Raghavan, Aladdin Hafez