메뉴 건너뛰기




Volumn , Issue , 2011, Pages 785-794

LogSig: Generating system events from raw textual logs

Author keywords

event generation; message signature; system logs

Indexed keywords

ALTERNATIVE ALGORITHMS; COMPUTING SYSTEM; DOMAIN EXPERTS; DOMAIN KNOWLEDGE; EVENT GENERATION; GENERATING SYSTEM; LARGE VOCABULARY; LOG ANALYSIS; LOG DATA; MESSAGE SIGNATURE; POOR PERFORMANCE; REAL SYSTEMS; SYSTEM ADMINISTRATORS; SYSTEM BEHAVIORS; SYSTEM LOGS; TEXT CLUSTERING; TEXT MESSAGES;

EID: 83055187032     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2063576.2063690     Document Type: Conference Paper
Times cited : (216)

References (30)
  • 6
    • 70350662718 scopus 로고    scopus 로고
    • One graph is worth a thousand logs: Uncovering hidden structures in massive system event logs
    • Bled, Slovenia, September
    • M. Aharon, G. Barash, I. Cohen, and E. Mordechai. One graph is worth a thousand logs: Uncovering hidden structures in massive system event logs. In Proceedings of ECML/PKDD, pages 227-243, Bled, Slovenia, September 2009.
    • (2009) Proceedings of ECML/PKDD , pp. 227-243
    • Aharon, M.1    Barash, G.2    Cohen, I.3    Mordechai, E.4
  • 7
    • 33845917083 scopus 로고    scopus 로고
    • RNA multiple structural alignment with longest common subsequences
    • DOI 10.1007/s10878-006-9020-x
    • S. Bereg, M. Kubica, T. Walen, and B. Zhu. RNA multiple structural alignment with longest common subsequences. Journal of Combinatorial Optimization, 13(2):179-188, 2007. (Pubitemid 46034292)
    • (2007) Journal of Combinatorial Optimization , vol.13 , Issue.2 , pp. 179-188
    • Bereg, S.1    Kubica, M.2    Walen, T.3    Zhu, B.4
  • 9
    • 77958144057 scopus 로고    scopus 로고
    • Incremental learning of system log formats
    • K. Fisher, D. Walker, and K. Q. Zhu. Incremental learning of system log formats. SIGOPS Oper. Syst. Rev., 44(1):85-90, 2010.
    • (2010) SIGOPS Oper. Syst. Rev. , vol.44 , Issue.1 , pp. 85-90
    • Fisher, K.1    Walker, D.2    Zhu, K.Q.3
  • 13
    • 0036997440 scopus 로고    scopus 로고
    • Discovering actionable patterns in event data
    • J. L. Hellerstein, S. Ma, and C.-S. Perng. Discovering actionable patterns in event data. IBM Systems Journal, 43(3):475-493, 2002.
    • (2002) IBM Systems Journal , vol.43 , Issue.3 , pp. 475-493
    • Hellerstein, J.L.1    Ma, S.2    Perng, C.-S.3
  • 14
    • 65449159832 scopus 로고    scopus 로고
    • Constructing comprehensive summaries of large event sequences
    • Las Vegas, Nevada, USA, August
    • J. Kiernan and E. Terzi. Constructing comprehensive summaries of large event sequences. In Proceedings of ACM KDD, pages 417-425, Las Vegas, Nevada, USA, August 2008.
    • (2008) Proceedings of ACM KDD , pp. 417-425
    • Kiernan, J.1    Terzi, E.2
  • 15
    • 32344445828 scopus 로고    scopus 로고
    • An integrated framework on mining logs files for computing system management
    • Chicago, Illinois, USA, August
    • T. Li, F. Liang, S. Ma, and W. Peng. An integrated framework on mining logs files for computing system management. In Proceedings of ACM KDD, pages 776-781, Chicago, Illinois, USA, August 2005.
    • (2005) Proceedings of ACM KDD , pp. 776-781
    • Li, T.1    Liang, F.2    Ma, S.3    Peng, W.4
  • 17
    • 84976657294 scopus 로고
    • The complexity of some problems on subsequences and supersequences
    • April
    • D. Maier. The complexity of some problems on subsequences and supersequences. Journal of the ACM, 25:322-336, April 1978.
    • (1978) Journal of the ACM , vol.25 , pp. 322-336
    • Maier, D.1
  • 18
    • 70350639547 scopus 로고    scopus 로고
    • Clustering event logs using iterative partitioning
    • Paris, France, June
    • A. Makanju, A. N. Zincir-Heywood, and E. E. Milios. Clustering event logs using iterative partitioning. In Proceedings of ACM KDD, pages 1255-1264, Paris, France, June 2009.
    • (2009) Proceedings of ACM KDD , pp. 1255-1264
    • Makanju, A.1    Zincir-Heywood, A.N.2    Milios, E.E.3
  • 19
    • 34547396309 scopus 로고    scopus 로고
    • Finding patterns in biological sequences by longest common subsequencesand shortest common supersequences
    • Arlington, Virginia, USA
    • K. Ning, H. K. Ng, and H. W. Leong. Finding patterns in biological sequences by longest common subsequencesand shortest common supersequences. In Proceedings of BIBE, pages 53-60, Arlington, Virginia, USA, 2006.
    • (2006) Proceedings of BIBE , pp. 53-60
    • Ning, K.1    Ng, H.K.2    Leong, H.W.3
  • 20
    • 67049096648 scopus 로고    scopus 로고
    • Alert detection in system logs
    • Pisa, Italy, December
    • A. J. Oliner, A. Aiken, and J. Stearley. Alert detection in system logs. In Proccedings of ICDM, pages 959-964, Pisa, Italy, December 2008.
    • (2008) Proccedings of ICDM , pp. 959-964
    • Oliner, A.J.1    Aiken, A.2    Stearley, J.3
  • 21
    • 36049013419 scopus 로고    scopus 로고
    • What supercomputers say: A study of five system logs
    • Edinburgh, UK, June
    • A. J. Oliner and J. Stearley:. What supercomputers say: A study of five system logs. In Proceedings of DSN 2007, pages 575-584, Edinburgh, UK, June 2007.
    • (2007) Proceedings of DSN 2007 , pp. 575-584
    • Oliner, A.J.1    Stearley, J.2
  • 22
    • 36849041061 scopus 로고    scopus 로고
    • Event summarization for system management
    • San Jose, California, USA, August
    • W. Peng, C. Perng, T. Li, and H. Wang. Event summarization for system management. In Proceedings of ACM KDD, pages 1028-1032, San Jose, California, USA, August 2007.
    • (2007) Proceedings of ACM KDD , pp. 1028-1032
    • Peng, W.1    Perng, C.2    Li, T.3    Wang, H.4
  • 26
    • 79951729098 scopus 로고    scopus 로고
    • LogTree: A framework for generating system events from raw textual logs
    • Sydney, Australia, December
    • L. Tang and T. Li. LogTree: A framework for generating system events from raw textual logs. In Proceedings of ICDM, pages 491-500, Sydney, Australia, December 2010.
    • (2010) Proceedings of ICDM , pp. 491-500
    • Tang, L.1    Li, T.2
  • 28
    • 0042377235 scopus 로고    scopus 로고
    • Constrained k-means clustering with background knowledge
    • June
    • K. Wagstaff, C. Cardie, S. Rogers, and S. Schrodl:. Constrained k-means clustering with background knowledge. In Proceedings of ICML, pages 577-584, June 2001.
    • (2001) Proceedings of ICML , pp. 577-584
    • Wagstaff, K.1    Cardie, C.2    Rogers, S.3    Schrodl, S.4
  • 29
    • 77954736323 scopus 로고    scopus 로고
    • An algorithmic approach to event summarization
    • Indianapolis, Indiana, USA, June
    • P. Wang, H. Wang, M. Liu, and W. Wang. An algorithmic approach to event summarization. In Proceedings of ACM SIGMOD, pages 183-194, Indianapolis, Indiana, USA, June 2010.
    • (2010) Proceedings of ACM SIGMOD , pp. 183-194
    • Wang, P.1    Wang, H.2    Liu, M.3    Wang, W.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.