IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i23p4797-d1289234.html
   My bibliography  Save this article

Polo: Adaptive Trie-Based Log Parser for Anomaly Detection

Author

Listed:
  • Yuezhou Zhou

    (School of Software Engineering, Sun Yat-sen University, Zhuhai 528406, China)

  • Yuxin Su

    (School of Software Engineering, Sun Yat-sen University, Zhuhai 528406, China)

Abstract

Automated log parsing is essential for many log-mining applications, as logs provide a vast range of information on events and variations within an operating system or software at runtime. Over the years, various methods have been proposed for log parsing. With improved log-parsing methods, log-mining applications can gain deeper insights into system behaviors and identify anomalies or failures promptly. However, current log parsers still face limitations, such as insufficient parsing of log templates and a lack of parallelism, as well as inaccurate log template parsing. To overcome these limitations, we have designed Polo, a parser that leverages a prefix forest composed of ternary search trees to mine templates from logs. We then conducted extensive experiments to evaluate the accuracy of Polo on nine representative system logs, achieving an average accuracy of 0.987. It is 9.93% to 40.95% faster than the state-of-the-art parsing methods. Furthermore, we evaluated our approach on a downstream log analysis task, specifically anomaly detection. The experimental results demonstrated that, in terms of F1-score, our parser outperformed Deeplog, LogAnomaly, CNN, and LogRobust by 11.5%, 4%, 1%, and 19.1%, respectively, exhibiting a promising recall score of 0.971. These results indicate the effectiveness of Polo for anomaly detection.

Suggested Citation

  • Yuezhou Zhou & Yuxin Su, 2023. "Polo: Adaptive Trie-Based Log Parser for Anomaly Detection," Mathematics, MDPI, vol. 11(23), pages 1-14, November.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:23:p:4797-:d:1289234
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/23/4797/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/23/4797/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:23:p:4797-:d:1289234. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.