The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Clustering event logs using iterative partitioning
Abstract
The importance of event logs, as a source of information in systems and network management cannot be overemphasized. With the ever increasing size and complexity of today's event logs, the task of analyzing event logs has become cumbersome to carry out manually. For this reason recent research has focused on the automatic analysis of these log files. In this paper we present IPLoM (Iterative Partitioning Log Mining), a novel algorithm for the mining of clusters from event logs. Through a 3-Step hierarchical partitioning process IPLoM partitions log data into its respective clusters. In its 4th and final stage IPLoM produces cluster descriptions or line formats for each of the clusters produced. Unlike other similar algorithms IPLoM is not based on the Apriori algorithm and it is able to find clusters in data whether or not its instances appear frequently. Evaluations show that IPLoM outperforms the other algorithms statistically significantly, and it is also able to achieve an average F-Measure performance 78% when the closest other algorithm achieves an F-Measure performance of 10%.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335372 · Cited by 6,402
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335372 · Cited by 3,216
A data clustering algorithm for mining patterns from event logs
Vaarandi, R. (2004) · Proceedings of the 3rd IEEE Workshop on IP Operations & Management (IPOM 2003) (IEEE Cat. No.03EX764) · doi:10.1109/ipom.2003.1251233 · Cited by 453
Mining partially periodic event patterns with unknown periods
Ma, S., & Hellerstein, J. L. (2002) · Proceedings 17th International Conference on Data Engineering · doi:10.1109/icde.2001.914829 · Cited by 236
Using Hidden Semi-Markov Models for Effective Online Failure Prediction
Salfner, F., & Malek, M. (2007) · IEEE Symposium on Reliable Distributed Systems (SRDS) · doi:10.1109/srds.2007.35 · Cited by 135
Towards informatic analysis of syslogs
Stearley, J. (2005) · IEEE International Conference on Cluster Computing (CLUSTER) · doi:10.1109/clustr.2004.1392628 · Cited by 117
Proceedings 17th International Conference on Data Engineering
(2001) · doi:10.1109/icde.2001 · Cited by 111
A Breadth-First Algorithm for Mining Frequent Patterns from Event Logs
Vaarandi, R. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30179-0_27 · Cited by 83
Mining event logs with SLCT and LogHound
Vaarandi, R. (2008) · IEEE/IFIP Network Operations and Management Symposium (NOMS) · doi:10.1109/noms.2008.4575281 · Cited by 77
An integrated framework on mining logs files for computing system management
Li, T., Liang, F., Ma, S., & Peng, W. (2005) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1081870.1081972 · Cited by 73
Cited by
DeepLog: Anomaly Detection and Diagnosis from System Logs through Deep Learning
Du, M., Li, F., Zheng, G., & Srikumar, V. (2017) · Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3133956.3134015 · Cited by 1,835
Detecting large-scale system problems by mining console logs
Xu, W., Huang, L., Fox, A., Patterson, D., & Jordan, M. I. (2009) · Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles · doi:10.1145/1629575.1629587 · Cited by 1,332
Experience Report: System Log Analysis for Anomaly Detection
He, S., Zhu, J., He, P., & Lyu, M. R. (2016) · 2016 IEEE 27th International Symposium on Software Reliability Engineering (ISSRE) · doi:10.1109/issre.2016.21 · Cited by 593
Tools and benchmarks for automated log parsing
Zhu, J., He, S., Liu, J., He, P., Xie, Q., Zheng, Z., & Lyu, M. R. (2019) · 2019 IEEE/ACM 41st International Conference on Software Engineering: Software Engineering in Practice (ICSE-SEIP) · doi:10.1109/icse-seip.2019.00021 · Cited by 574
Spell: Streaming Parsing of System Event Logs
Du, M., & Li, F. (2016) · 2016 IEEE 16th International Conference on Data Mining (ICDM) · doi:10.1109/icdm.2016.0103 · Cited by 423
Metadata
- Authors
- Makanju, A. A. O., Zincir-Heywood, A. N., & Milios, E. E.
- Venue
- Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2009-06-28
- Pages
- 1255-1264
- OpenAlex
- W2115056012
- Cited by
- 338
- References
- 11
- FWCI
- 7.22
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Clustering event logs using iterative partitioning. https://app.cochat.ai/papers/10.1145/1557019.1557154
- The paper
- Makanju, A. A. O., Zincir-Heywood, A. N., & Milios, E. E. (2009). Clustering event logs using iterative partitioning. Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. https://doi.org/10.1145/1557019.1557154
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.