Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2009, Bled, Slovenia, September 7-11, 2009, Proceedings, Part I > One Graph Is Worth a Thousand Logs: Uncovering Hidden Structures in Massive System Event Logs
Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2009, Bled, Slovenia, September 7-11, 2009, Proceedings, Part I |
Wray Buntine; Marko Grobelnik; Dunja Mladenic; John Shawe-Taylor
Springer Berlin Heidelberg
Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2009, Bled, Slovenia, September 7-11, 2009, Proceedings, Part I
One Graph Is Worth a Thousand Logs: Uncovering Hidden Structures in Massive System Event Logs
Authors

Michal Aharon; Gilad Barash; Ira Cohen; Eli Mordechai

ARI Id

1665027135621_4525174

Access

Not Available Free

Pages

227-243

DOI

10.1007/978-3-642-04180-8_32

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-642-04180-8_32

Table of Contents of Book
Showing 1 to 20 of 67 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Theory-Practice Interplay in Machine Learning – Emerging Theoretical Challenges
Shai Ben-David
1-1
Are We There Yet?
Nello Cristianini
2-2
The Growing Semantic Web
Mark Greaves
3-3
Privacy in Web Search Query Log Mining
Rosie Jones
4-4
Highly Multilingual News Analysis Applications
Ralf Steinberger
5-5
Combining Instance-Based Learning and Logistic Regression for Multilabel Classification
Weiwei Cheng; Eyke Hüllermeier
6-6
On Structured Output Training: Hard Cases and an Efficient Alternative
Thomas Gärtner; Shankar Vembu
7-7
Sparse Kernel SVMs via Cutting-Plane Training
Thorsten Joachims; Chun-Nam John Yu
8-8
Hybrid Least-Squares Algorithms for Approximate Policy Evaluation
Jeff Johns; Marek Petrik; Sridhar Mahadevan
9-9
A Self-training Approach to Cost Sensitive Uncertainty Sampling
Alexander Liu; Goo Jun; Joydeep Ghosh
10-10
Learning Multi-linear Representations of Distributions for Efficient Inference
Dan Roth; Rajhans Samdani
11-11
Cost-Sensitive Learning Based on Bregman Divergences
Raúl Santos-Rodríguez; Alicia Guerrero-Curieses; Rocío Alaiz-Rodríguez; Jesús Cid-Sueiro
12-12
RTG: A Recursive Realistic Graph Generator Using Random Typing
Leman Akoglu; Christos Faloutsos
13-28
Taxonomy-Driven Lumping for Sequence Mining
Francesco Bonchi; Carlos Castillo; Debora Donato; Aristides Gionis
29-29
On Subgroup Discovery in Numerical Domains
Henrik Grosskreutz; Stefan Rüping
30-30
Harnessing the Strengths of Anytime Algorithms for Constant Data Streams
Philipp Kranen; Thomas Seidl
31-31
Identifying the Components
Matthijs van Leeuwen; Jilles Vreeken; Arno Siebes
32-32
Two-Way Analysis of High-Dimensional Collinear Data
Ilkka Huopaniemi; Tommi Suvitaival; Janne Nikkilä; Matej Orešič; Samuel Kaski
33-33
A Fast Ensemble Pruning Algorithm Based on Pattern Mining Process
Qiang-Li Zhao; Yan-Huang Jiang; Ming Xu
34-34
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 67 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings