Sciweavers

2180 search results - page 45 / 436
» Algorithms for discovering bucket orders from data
Sort
View
ASC
2008
13 years 8 months ago
Dynamic data assigning assessment clustering of streaming data
: Discovering interesting patterns or substructures in data streams is an important challenge in data mining. Clustering algorithms are very often applied to identify single substr...
Olga Georgieva, Frank Klawonn
DBKDA
2009
IEEE
136views Database» more  DBKDA 2009»
14 years 12 days ago
Visualization and Integration of Databases Using Self-Organizing Map
Abstract--With the growing computer networks, accessible data is becoming increasing distributed. Understanding and integrating remote and unfamiliar data sources are important dat...
Farid Bourennani, Ken Q. Pu, Ying Zhu
ICDM
2006
IEEE
161views Data Mining» more  ICDM 2006»
14 years 2 months ago
STAGGER: Periodicity Mining of Data Streams Using Expanding Sliding Windows
Sensor devices are becoming ubiquitous, especially in measurement and monitoring applications. Because of the real-time, append-only and semi-infinite natures of the generated se...
Mohamed G. Elfeky, Walid G. Aref, Ahmed K. Elmagar...
COLING
2010
13 years 3 months ago
Varro: An Algorithm and Toolkit for Regular Structure Discovery in Treebanks
The Varro toolkit is a system for identifying and counting a major class of regularity in treebanks and annotated natural language data in the form of treestructures: frequently r...
Scott Martens
ICDE
2007
IEEE
185views Database» more  ICDE 2007»
14 years 10 months ago
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik