Learning from past experiences to enhance decision support in IT change management

the number of changes that IT departments have to deal with is growing at a fast pace in response to changing business needs of enterprises. As changes are getting executed and deployed, knowledge is being created and stored. It is of paramount importance to the success of the business to re-use that knowledge for future changes. In fact, those who do not learn from past experiences are doomed to repeat the same mistakes as well as not bear the fruit of the ones that were successful. This paper addresses this concern by providing for every change being worked out the most similar past changes. Our solution combines data mining and optimization paradigms to model the problem of finding past similar changes by designing and learning similarity functions. Our approach enhances the efficiency and effectiveness of dealing with changes, by reducing the risk and shortening the time of introducing new changes.

[1]  Kun-Lung Wu,et al.  The CHAMPS system: change management with planning and scheduling , 2004, 2004 IEEE/IFIP Network Operations and Management Symposium (IEEE Cat. No.04CH37507).

[2]  Dekang Lin,et al.  An Information-Theoretic Definition of Similarity , 1998, ICML.

[3]  Claudio Bartolini,et al.  Activity-Based Scheduling of IT Changes , 2007, AIMS.

[4]  Lisandro Zambenedetti Granville,et al.  Enabling rollback support in IT change management systems , 2008, NOMS 2008 - 2008 IEEE Network Operations and Management Symposium.

[5]  Claudio Bartolini,et al.  A decision support tool to optimize scheduling of IT changes , 2007, 2007 10th IFIP/IEEE International Symposium on Integrated Network Management.

[6]  Lisandro Zambenedetti Granville,et al.  ChangeLedge: Change design and planning in networked systems based on reuse of knowledge and automation , 2009, Comput. Networks.

[7]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

[8]  Irina Matveeva.  Document Representation and Multilevel Measures of Document Similarity , 2006, HLT-NAACL.

[9]  Claudio Bartolini,et al.  Change Priority Determination in IT Service Management Based on Risk Exposure , 2008, IEEE Transactions on Network and Service Management.

[10]  John W. Chinneck,et al.  Fast Heuristics for the Maximum Feasible Subsystem Problem , 2001, INFORMS J. Comput..

[11]  Tudor Dumitras,et al.  Ecotopia: An Ecological Framework for Change Management in Distributed Systems , 2006, WADS.

[12]  N. Chakravarti.  Some results concerning post-infeasibility analysis , 1994 .

[13]  Edoardo Amaldi,et al.  The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations , 1995, Theor. Comput. Sci..

[14]  Tong Zhang,et al.  Text Mining: Predictive Methods for Analyzing Unstructured Information , 2004 .

[15]  David McPhee,et al.  Information Technology Infrastructure Library (ITIL®) , 2011, Encyclopedia of Information Assurance.

[16]  Philip Resnik,et al.  Semantic Similarity in a Taxonomy: An Information-Based Measure and its Application to Problems of Ambiguity in Natural Language , 1999, J. Artif. Intell. Res..

[17]  Jayaram K. Sankaran.  A note on resolving infeasibility in linear programs by constraint relaxation , 1993, Oper. Res. Lett..

[18]  J. V. Bon.  It Service Management: An Introduction: Based on Itil (Japanese Version) , 2002 .

[19]  Hidekazu Nakawatase,et al.  Calculating similarity between texts using graph-based text representation model , 2004, CIKM '04.

[20]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .

[21]  Arlei Calazans,et al.  Information Technology Infrastructure Library , 2007 .

[22]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[23]  Alexander Dockhorn,et al.  Classification Algorithms , 2017, Encyclopedia of Machine Learning and Data Mining.

[24]  Michael McGill,et al.  Introduction to Modern Information Retrieval , 1983 .