The Community for Technology Leaders
Green Image
Issue No. 03 - Third Quarter (2012 vol. 5)
ISSN: 1939-1374
pp: 345-357
Yang Song , IBM Research, Hawthrone
Anca Sailer , Microsoft Research, Redmond
Hidayatullah Shaikh , IBM Research, Hawthorne
The overwhelming amount of various monitoring and log data generated in multitier IT systems makes problem determination one of the most expensive and labor-intensive tasks in IT Services arena. Particularly the initial step of problem classification is complicated by error propagation making secondary problems surfacing on multiple dependent resources. In this paper, we propose to automate the process of problem classification by leveraging machine learning. The main focus is to categorize the problem a user experiences by recognizing the real root cause specificity leveraging available training data such as monitoring and logs across the systems. We transform the structure of the problem into a hierarchy using an existing taxonomy. We then propose an efficient hierarchical incremental learning algorithm which is capable of adjusting its internal local classifier parameters in realtime. Comparing to the traditional batch learning algorithms, this online solution decreases the computational complexity of the training process by learning from new instances on an incremental fashion. Our approach significantly reduces the memory required to store the training instances. We demonstrate the efficiency of our approach by learning hierarchical problem patterns for several issues occurring in distributed web applications. Experimental results show that our approach substantially outperforms previous methods.
Training, Taxonomy, Training data, Monitoring, Prediction algorithms, Frequency modulation, Machine learning, services computing, Machine learning, artificial intelligence, computing methodologies, services technologies, principles of services

A. Sailer, H. Shaikh and Y. Song, "Hierarchical Online Problem Classification for IT Support Services," in IEEE Transactions on Services Computing, vol. 5, no. , pp. 345-357, 2012.
83 ms
(Ver 3.3 (11022016))