Sciweavers

507 search results - page 75 / 102
» A simple role mining algorithm
Sort
View
KDD
2005
ACM
80views Data Mining» more  KDD 2005»
14 years 10 months ago
Wavelet synopsis for data streams: minimizing non-euclidean error
We consider the wavelet synopsis construction problem for data streams where given n numbers we wish to estimate the data by constructing a synopsis, whose size, say B is much sma...
Sudipto Guha, Boulos Harb
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
13 years 11 months ago
Learning Markov Network Structure using Few Independence Tests
In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for...
Parichey Gandhi, Facundo Bromberg, Dimitris Margar...
ICDM
2010
IEEE
115views Data Mining» more  ICDM 2010»
13 years 8 months ago
Polishing the Right Apple: Anytime Classification Also Benefits Data Streams with Constant Arrival Times
Classification of items taken from data streams requires algorithms that operate in time sensitive and computationally constrained environments. Often, the available time for class...
Jin Shieh, Eamonn J. Keogh
ILP
2003
Springer
14 years 3 months ago
Relational IBL in Music with a New Structural Similarity Measure
It is well known that many hard tasks considered in machine learning and data mining can be solved in an rather simple and robust way with an instance- and distance-based approach....
Asmir Tobudic, Gerhard Widmer
DIS
2001
Springer
14 years 2 months ago
Eliminating Useless Parts in Semi-structured Documents Using Alternation Counts
We propose a preprocessing method for Web mining which, given semi-structured documents with the same structure and style, distinguishes useless parts and non-useless parts in each...
Daisuke Ikeda, Yasuhiro Yamada, Sachio Hirokawa