Open Access Open Access  Restricted Access Subscription or Fee Access

ISD-An Intelligent Service Desk

Febin.A. Vahab, R. J. Anandhi

Abstract


A knowledge base is where an organization documents communal knowledge that the teams are acquiring through hard experience. Customers are the main reason an organization need to use a knowledge base. The turn-around time of the query resolution and correctness is of utmost importance. It is also important to be able to retain the knowledge the employees acquire, rather than letting it walk out the door with them when they eventually move on to another job. The information in a knowledge base can be used to solve the issues which were earlier solved with customer representative help. Many companies use text based or case-based service desk systems to improve customer service quality. But most of the existing knowledge base systems use matching based on the keywords in the cases and rank the cases based on those keyword matches. This method of case retrieval in inefficient and has difficulty in understanding the exact meanings of the cases. The results based on keyword-based retrieval, are inaccurate and incomplete in cases where different keywords are used for the description of similar concepts in artifacts and queries. To address this challenge, ISD, an Intelligent Service Desk, is proposed, to find problem–solution patterns from the past customer–representative interactions automatically. The main aim of the paper is to bring in semantic analysis of the cases in case retrieval. When a new query from the customer arrives, ISD searches the previous cases in the knowledge base and ranks it based on the semantic relevance of the incoming request and the knowledge base cases. A new way is formulated to understand the semantic meanings of the cases. This method can be used to trance the exact meanings of the cases. The proposed system uses tokenization to remove the stop words, part of speech tagging, word sense disambiguation and finally a path length based similarity measurement to capture the semantic similarity between the sentences. ISD calculates a score for the sentence searched for and the reference solutions in the knowledge base using the proposed method and displays the results in the decreasing order of the score. The experimental result and case studies presented in the paper show that the proposed method has high precision of retrieval when compared to case based systems.

Keywords


Part of Speech Tagging, Service-Desk, Semantic Analysis, Word-Sense Disambiguation

Full Text:

PDF

References


Dingding Wang, Tao Li, Shenghuo Zhu, Yihong Gong, ―iHelp: An Intelligent Online Helpdesk System‖, IEEE Transactions on Systems, Man and Cybernetics,vol. 41, pp. 173-182, Feb.2011.

D. Bridge, M. H. Goker, L. Mcginty, and B. Smyth, ―Case-based recommender systems,‖ Knowl. Eng. Rev., vol. 20, no. 3, pp. 315–320, Sep. 2005.

Kriegsman.M, Barletta R, ‖ Building a case-based help desk application‖. IEEE Expert, vol.8, pp.18-26, Dec.1993.

R. Agrawal, R. Rantzau, and E. Terzi, ―Context-sensitive ranking,‖ in Proc. SIGMOD, 2006, pp. 383–394.

S. Berchtold, B. Ertl, D. A. Keim, H.-P. Kriegel, and T. Seidl, ―Fast nearest neighbor search in high-dimensional space,‖ in Proc. ICDE, 1998,pp. 209–218.

S. Chaudhuri and L. Gravano, ―Evaluating top-k selection queries,‖ in Proc. VLDB, M. P. Atkinson, M. E. Orlowska, P. Valduriez, S. B. Zdonik, and M. L. Brodie, Eds., 1999, pp. 397– 410.

K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft, ―When is nearest neighbor meaningful?‖ in Proc. ICDT, 1999, pp. 217–235.

S. Berchtold, B. Ertl, D. A. Keim, H.-P. Kriegel, and T. Seidl, ―Fast nearest neighbor search in high-dimensional space,‖ in Proc. ICDE, 1998,pp. 209–218.

Abtin Refahi Farjadi Tehrani, Faras Zuheir Mustafa Mohamed.‖A CBR-based Approach to ITIL-based Service Desk‖. Journal of Emerging Trends in Computing and Information Sciences, vol.2, pp.476-484, October 2011.

Ahsaee, Mostafa Ghazizadeh, Naghibzadeh, Mahmoud, Yasrebi, S. Ehsan, ‖ Using WordNet to determine semantic similarity of words‖, 5th International Symposium on Telecommunications (IST), 2010, pp. 1019 - 1027 .

Brill, Eric (1992), ―A simple rule-based part of speech tagger‖, HLT ‗91: Proceedings of the workshop on Speech and Natural Language, Morristown, NJ, USA: Association for Computational Linguistics, pp. 112–116.

Siddharth Patwardhan, Satanjeev Banerjee, TedPedersen, ―SenseRelate::TargetWord: a generalized framework for word sense disambiguation‖, ACLdemo '05 Proceedings of the ACL 2005 on Interactive poster and demonstration sessions, 2005, pp.73-76.

Lesk, Michael. ―Automatic sense disambiguation using machine readable dictionaries: How to tell a pine cone from an ice cream cone‖. Proceedings of SIGDOC-86: 5th International Conference on Systems Documentation, Toronto, Canada, 1986, pp.24-26.

Banerjee, S., and Pedersen, T. ―An adapted Lesk algorithm for word sense disambiguation using WordNet‖, Proceedings of the Third International Conference on Intelligent Text Processing and Computational Linguistics, vol 2276, 2002, pp 136-145.

S. Patwardhan, S. Banerjee, and T. Pedersen.. ―Using measures of semantic relatedness for word sense disambiguation‖, Proceedings of the Fourth International Conference on Intelligent Text Processing and Computational Linguistics, 2003, pp 241—257.


Refbacks

  • There are currently no refbacks.