Clustering streaming data requires algorithms which are capable of updating clustering results for the incoming data. As data is constantly arriving, time for processing is limited...
Philipp Kranen, Ira Assent, Corinna Baldauf, Thoma...
In this paper, we propose an efficient algorithm, called MQSchange (changes of Music Query Streams), to detect the changes of maximal melody structures in user-centered music quer...
The nearest neighbor (NN) classifier is well suited for generic object recognition. However, it requires storing the complete training data, and classification time is linear in ...
Ferid Bajramovic, Frank Mattern, Nicholas Butko, J...
The problem of simultaneous feature extraction and selection, for classifier design, is considered. A new framework is proposed, based on boosting algorithms that can either 1) s...
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...