Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
Matching Pursuit decomposes a signal into a linear expansion of functions selected from a redundant dictionary, isolating the signal structures that are coherent with respect to a...
Fulvio Moschetti, Lorenzo Granai, Pierre Vanderghe...
act Weighting Framework for Clustering Algorithms Richard Nock Frank Nielsen Recent works in unsupervised learning have emphasized the need to understand a new trend in algorithmi...
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
In this paper we study the properties of a new packet trace compression method based on clustering of TCP flows. With our proposed method, the compression ratio that we achieve i...