Sciweavers

6087 search results - page 1215 / 1218
» Knowledge discovery methods
Sort
View
EDBT
2011
ACM
199views Database» more  EDBT 2011»
14 years 1 months ago
Finding closed frequent item sets by intersecting transactions
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
Christian Borgelt, Xiaoyuan Yang, Rubén Nog...
FOCM
2011
188views more  FOCM 2011»
14 years 1 months ago
Compressive Wave Computation
This paper considers large-scale simulations of wave propagation phenomena. We argue that it is possible to accurately compute a wavefield by decomposing it onto a largely incomp...
Laurent Demanet, Gabriel Peyré
CIKM
2011
Springer
13 years 9 months ago
LogSig: generating system events from raw textual logs
Modern computing systems generate large amounts of log data. System administrators or domain experts utilize the log data to understand and optimize system behaviors. Most system ...
Liang Tang, Tao Li, Chang-Shing Perng
96
Voted
DGO
2011
237views Education» more  DGO 2011»
13 years 9 months ago
Modeling digital preservation capabilities in enterprise architecture
The rising awareness of the challenges of preserving information over the long term has led to a wealth of initiatives developing economic models, methods, tools, systems, guideli...
Christoph Becker, Gonçalo Antunes, Jos&eacu...

Publication
197views
13 years 5 months ago
Convex non-negative matrix factorization for massive datasets
Non-negative matrix factorization (NMF) has become a standard tool in data mining, information retrieval, and signal processing. It is used to factorize a non-negative data matrix ...
C. Thurau, K. Kersting, M. Wahabzada, and C. Bauck...
« Prev « First page 1215 / 1218 Last » Next »