Sciweavers

2925 search results - page 11 / 585
» Information Complexity of Online Problems
Sort
View
ICDM
2009
IEEE
148views Data Mining» more  ICDM 2009»
15 years 8 months ago
Online System Problem Detection by Mining Patterns of Console Logs
Abstract—We describe a novel application of using data mining and statistical learning methods to automatically monitor and detect abnormal execution traces from console logs in ...
Wei Xu, Ling Huang, Armando Fox, David Patterson, ...
WAIM
2005
Springer
15 years 7 months ago
Extracting, Presenting and Browsing of Web Social Information
We address the problem that current Web applications present mainly the content-centric information, but lack cues and browsing mechanisms for online social information. After summ...
Yi Wang, Li-Zhu Zhou
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
16 years 2 months ago
Camouflaged fraud detection in domains with complex relationships
We describe a data mining system to detect frauds that are camouflaged to look like normal activities in domains with high number of known relationships. Examples include accounti...
Sankar Virdhagriswaran, Gordon Dakin
141
Voted
CVPR
2009
IEEE
16 years 9 months ago
Shared Kernel Information Embedding for Discriminative Inference
Latent Variable Models (LVM), like the Shared-GPLVM and the Spectral Latent Variable Model, help mitigate over- fitting when learning discriminative methods from small or modera...
David J. Fleet, Leonid Sigal, Roland Memisevic
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
15 years 5 months ago
Online discovery and maintenance of time series motifs
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
Abdullah Mueen, Eamonn J. Keogh