am

Name Card

Name: 
Ambuj Mahanti
Position: 
Professor
Academic Group: 
Management Information Systems
Phone No.: 
+91-33-2467 8300 to 8304 Extn: 405
Contact Details: 
Work: I.I.M. Calcutta, Joka, D.H.Road, Calcutta 700 104. Residence: 1/55 Dover Place, Calcutta 700 019, Mobile: +919874583438
Personal Details: 
Work: I.I.M. Calcutta, Joka, D.H.Road, Calcutta 700 104, Phone: 033-2467 8300 to 8304, Extn:405. Residence: 1/55 Dover Place, Calcutta 700 019, Mobile: +919874583438
Email (@iimcal.ac.in): 
am

Academics

Academic Background: 
D.Sc. in Computer Science (University of Calcutta) in 1988; Post-Graduate Diploma in Computer Science (Indian Statistical Institute, Calcutta) in 1978; Master’s in Statistics (University of Calcutta) in 1977; Post-Graduate Diploma in Operations Research (Operational Research Society of India, Calcutta) in 1976.
Courses Taught: 
Strategic Business Intelligence Business Intelligence Tools and Techniques I and II Business Applications of AI and Expert Systems Electronic Commerce Business Process Re-engineering Database Management Systems

Experience

Consulting Interests: 
Tea Board, Production Information System of Tea; Royal Norwegian Embassy, Delhi, Assessment of Training Needs for the Health Personnel in Uttar Pradesh; Hindustan Copper Limited, Identification of Computing Needs;Indian Oil Corporation, IMS: Integrated Manpower Study for the Haldia Refinery; Andrew Yule Group, CADS: Comprehensive Assessment of a Diversification Strategy for the Dishergarh Power Supply Limited etc.
Work Experience: 
Dean (Planning and Administration) from 2005 to 2007, IIM Calcutta; Visiting Associate Professor for nearly three years at University of Maryland College Park, USA from 1990 to 1992; Assistant Professor, MIS, IIMC from 1983 to 1990; Research Fellow (MIS) at IIM Calcutta from 1981 to 1983; Associate Project Coordinator (and also as acting Project Coordinator) during 1984 - 1988, for the Computer Aided Management Project at IIM Calcutta, jointly sponsored by the United Nations Development Programme (UNDP) and the Department of Electronics, Govt. of India. Senior Programmer, at National Informatics Centre, Kolkata from 1978 to 1981.
Current Projects: 
• “Towards An Automated Adaptive Compliance Auditing System”, IIMC Internal Research Grant, for a Category-III project, Work Order No.019/RP: TAACAS/ 3483/2011-2012,This project is in collaboration with the University of New South Wales, Australia. • “Select Issues in Recommender Systems”, IIMC Internal Research Grant, for a Category-II project, W.O. No. 019/RP:SIRS/3397/2008-09. • "Bidirectional Heuristic Search - Revisited", IIMC Internal Research Grant, for a Category-I W.O. No. 019/RP:STACA/3392/2008-09

Research

Journal Publications: 
Ambuj Mahanti – Combined Publication List (September, 2012) [1] J. Sethuraman, A. Mahanti, D. Saha, and S. K. Sadhukhan, “A best first search based optimal wavelength assignment algorithm to minimize the number of SONET ADMs in WDM rings,” in Computer Communications and Networks, 2005. ICCCN 2005. Proceedings. 14th International Conference on, 2005, p. 597. [2] P. Saha, N. Parameswaran, B. B. Chakrabarti, and A. Mahanti, “A Formal Analysis of Fraud in Banking Sector,” presented at the HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES -46, Hawaii, USA, 2013. [3] A. Mahanti, S. Ghose, and S. K. Sadhukhan, “A framework for searching AND/OR graphs with cycles,” Arxiv preprint cs/0305001, 2003. [4] S. Perumal and A. Mahanti, “A graph-search based algorithm for verifying workflow graphs,” in Database and Expert Systems Applications, 2005. Proceedings. Sixteenth International Workshop on, 2005, pp. 992–996. [5] S. Mandal, D. Saha, and A. Mahanti, “A heuristic search for generalized cellular network planning,” in Personal Wireless Communications, 2002 IEEE International Conference on, 2002, pp. 105–109. [6] A. Mahanti, S. Ghosh, and A. K. Pal, “A high-performance limited-memory admissible and real time search algorithm for networks,” University of Maryland at College Park, 1992. [7] A. Mahanti and K. Ray, “A New Algorithm for Searching Networks with Loops,” in Proceedings of IASTED Conference, Switzerland, 1989. [8] Z. Li and A. Mahanti, “A progressive flow auction approach for low-cost on-demand P2P media streaming,” Proc. of ACM QShine, 2006. [9] S. Mandal, D. Saha, and A. Mahanti, “A Real-time and Limited-Memory Algorithm for Location Area Planning in Cellular Networks,” WPS-476/2003, IIM Calcutta, 2003. [10] S. Mandal, D. Saha, and A. Mahanti, “A real-time heuristic search technique for fixed channel allocation (FCA) in mobile cellular communications,” Microprocessors and Microsystems, vol. 28, no. 8, pp. 411–416, 2004. [11] S. Janardhanan, A. Mahanti, D. Saha, and S. K. Sadhukhan, “A routing and wavelength assignment (RWA) technique to minimize the number of SONET ADMs in WDM rings,” in System Sciences, 2006. HICSS’06. Proceedings of the 39th Annual Hawaii International Conference on, 2006, vol. 2, p. 32c–32c. [12] A. Mahanti and C. J. Daniels, “A SIMD approach to parallel heuristic search,” Artificial Intelligence, vol. 60, no. 2, pp. 243–282, 1993. [13] S. Perumal and A. Mahanti, “A Simple and Efficient Algorithm for Verifying Workflow Graphs,” Workflow Handbook 2005, pp. 233–256, 2005. [14] A. Mahanti, S. K. Sadhukhan, and S. Ghose, “A Tale of Two Searches: Bidirectional Search Algorithm that Meets in the Middle,” Working Paper, WPS No. 678/2011, Tndian Tnstitltue of Management Calcutta, 2011. [15] S. Mandal, D. Saha, and A. Mahanti, “A technique to support dynamic pricing strategy for differentiated cellular mobile services,” in Global Telecommunications Conference, 2005. GLOBECOM’05. IEEE, 2005, vol. 6, p. 5 pp.–3392. [16] A. Bagchi and A. Mahanti, “Admissible heuristic search in and/or graphs,” Theoretical Computer Science, vol. 24, no. 2, pp. 207–219, Jul. 1983. [17] A. Mahanti, R. Karinthi, S. Ghosh, and A. Pal, “AI Search for Minimum-Cost Set Cover and Multiple-Goal Plan Optimization Problems: Applications to Process Planning,” Report No. UMIACS-TR-90-125, Institute for Advanced Computer Studies, University of Maryland at College Park, Sep. 1990. [18] R. Dass and A. Mahanti, “An Efficient Algorithm for Real-Time Frequent Pattern Mining for Real-Time Business Intelligence Analytics,” in System Sciences, 2006. HICSS’06. Proceedings of the 39th Annual Hawaii International Conference on, 2006, vol. 8, p. 170b–170b. [19] R. Dass and A. Mahanti, “An Efficient Heuristic Search for Real-Time Frequent Pattern Mining,” in System Sciences, 2006. HICSS’06. Proceedings of the 39th Annual Hawaii International Conference on, 2006, vol. 2, p. 40b–40b. [20] R. Dass and A. Mahanti, “An efficient real-time frequent pattern mining technique using diff-sets,” Computational Science–ICCS 2005, pp. 64–72, 2005. [21] S. Mandal, D. Saha, S. Bera, S. Ray, and A. Mahanti, “An efficient technique for dynamic lightpath establishment in survivable local/metro WDM optical networks,” Distributed Computing-IWDC 2003, pp. 830–830, 2003. [22] R. Dass and A. Mahanti, “An efficient technique for frequent pattern mining in real-time business applications,” in System Sciences, 2005. HICSS’05. Proceedings of the 38th Annual Hawaii International Conference on, 2005, p. 76a–76a. [23] M. Nandy and A. Mahanti, “An improved search technique for optimal winner determination in combinatorial auctions,” in System Sciences, 2004. Proceedings of the 37th Annual Hawaii International Conference on, 2004, p. 10 pp. [24] J. Sethuraman, A. Mahanti, and D. Saha, “An Optimal Uninformed Best First Search Based Wavelength Assignment Algorithm to Minimize the Number of Sonet ADMs in WDM Rings,” Telecommunications planning: innovations in pricing, network design and management, pp. 225–239, 2006. [25] A. Mahanti and A. Bagchi, “AND/OR graph heuristic search methods,” J. ACM, vol. 32, no. 1, pp. 28–51, 1985. [26] S. Perumal and A. Mahanti, “Applying graph search techniques for workflow verification,” in System Sciences, 2007. HICSS 2007. 40th Annual Hawaii International Conference on, 2007, pp. 48–48. [27] S. Janardhanan, A. Mahanti, D. Saha, and S. K. Sadhukhan, “BDFS: A Real-Time Search Algorithm for Central Office (CO) Optimization,” in System Sciences, 2007. HICSS 2007. 40th Annual Hawaii International Conference on, 2007, pp. 48–48. [28] A. Mahanti and S. Ghosh, “Best-first search with controlled time and storage,” 1990. [29] S. Ghosh and A. Mahanti, “Bidirectional heuristic search with limited resources,” Information processing letters, vol. 40, no. 6, pp. 335–340, 1991. [30] S. Saha, S. Majumder, S. Ray, and A. Mahanti, “Categorizing user interests in recommender systems,” in Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part II, Cardiff, UK, 2010, pp. 282–291. [31] P. Mereault, P. Ray, and A. Mahanti, “Categorizing User Interests in Recommender Systems,” in 3rd International Symposium of Information Systems, Hyderabad, 2008. [32] S. Mandal, D. Saha, A. Mahanti, and P. C. Pendharkar, “Cell-to-switch level planning in mobile wireless networks for efficient management of radio resources,” Omega, vol. 35, no. 6, pp. 697–705, 2007. [33] S. Saha and A. Mahanti, “Cloud based HIMS - An Indian Perspective,” in CLOSER, 2012, pp. 438–442. [34] S. Saha and A. Mahanti, “Collaborative Preference Elicitation Based on Dynamic Peer Recommendations,” in COLLA 2012, The Second International Conference on Advanced Collaborative Networks, Systems and Applications, 2012, pp. 88–94. [35] A. Mahanti and S. Ghosh, “Controlled best-first search for near optimal solutions,” in Applied Computing, 1991.,[Proceedings of the 1991] Symposium on, 1991, pp. 109–118. [36] S. Ray and A. Mahanti, “Designing Accurate Trust-Aware Recommender Systems for Cold Start Users,” in Artificial Intelligence and Applications, 2010. [37] S. Saha, S. Majumder, S. Ray, and A. Mahanti, “Drifting Preferences in Recommender Systems.” IIM Calcutta WPS No. 654, 2010. [38] S. Ghosh, A. Mahanti, and D. S. Nau, “Efficient Limited Memory Heuristic Search.” [39] A. Mukhopadhyay, S. Chatterjee, D. Saha, A. Mahanti, and S. K. Sadhukhan, “E-Risk Insurance Product Design: A Copula Based Bayesian Belief Network Model.” [40] A. Mukhopadhyay, B. Bhushan, D. Saha, and A. Mahanti, “E-Risk Management through Self Insurance: An Option Model,” in System Sciences, 2007. HICSS 2007. 40th Annual Hawaii International Conference on, 2007, p. 158b–158b. [41] A. Mukhopadhyay, S. Chatterjee, D. Saha, A. Mahanti, and S. K. Sadhukhan, “e-Risk management with insurance: a framework using copula aided Bayesian belief networks,” in System Sciences, 2006. HICSS’06. Proceedings of the 39th Annual Hawaii International Conference on, 2006, vol. 6, p. 126a–126a. [42] A. Mukhopadhyay, S. Chatterjee, D. Saha, A. Mahanti, and A. K. Podder, “e-risk: A case for insurance,” Proceedings of the Conference on Information Systems and Technology Management, New Delhi, 2005. [43] R. Dass and A. Mahanti, “Fast Frequent Pattern Mining in Real-Time,” Proceedings of the Eleventh International Conference on Management of Data (COMAD 2005), Goa, India, 2005. [44] S. Ray and A. Mahanti, “Filler Item Strategies for Shilling Attacks against Recommender Systems,” in System Sciences, 2009. HICSS’09. 42nd Hawaii International Conference on, 2009, pp. 1–10. [45] S. Ray and A. Mahanti, “Filler items strategies for effective shilling attacks,” Workshop on Recommender Systems, p. 31, 2008. [46] S. Perumal and A. Mahanti, “Formal Foundation of Workflow Hyperpaths and a Graph Search Algorithm for Workflow Hyperpath Generation,” in Hawaii International Conference on System Sciences, Proceedings of the 41st Annual, 2008, pp. 102–102. [47] R. Dass and A. Mahanti, “Frequent Pattern Mining in Real-Time–First Results,” TDM2004/ACM SIGKDD, 2004. [48] R. Dass and A. Mahanti, “h1-max: A Domain Independent Heuristic for Real-Time Frequent Pattern Mining,” 2005. [49] A. Mahanti and K. Ray, “Heuristic search in networks with modifiable estimate,” in ACM Conference on Computer Science, 1987, pp. 166–174. [50] S. Mandal, D. Saha, and A. Mahanti, “Heuristic search techniques for cell to switch assignment in location area planning for cellular networks,” in Communications, 2004 IEEE International Conference on, 2004, vol. 7, pp. 4307–4311 Vol. 7. [51] A. Mahanti and C. J. Daniels, “IDPS: a massively parallel heuristic search algorithm,” in Parallel Processing Symposium, 1992. Proceedings., Sixth International, 1992, pp. 220–223. [52] R. Dass and A. Mahanti, “Implementing BDFS (b) with diff-sets for real-time frequent pattern mining in dense datasets-first findings,” in Ubiquitous Data Management, 2005. UDM 2005. International Workshop on, 2005, pp. 113–120. [53] S. Ray and A. Mahanti, “Improving Prediction Accuracy in Trust-Aware Recommender Systems,” in System Sciences (HICSS), 2010 43rd Hawaii International Conference on, 2010, pp. 1–9. [54] S. Ghosh, A. Mahanti, and D. S. Nau, “Improving the efficiency of limited-memory heuristic search,” 1998. [55] A. Mukhopadhyay, D. Saha, A. Mahanti, B. B. Chakrabarti, and A. Podder, “Insurance for cyber-risk: A Utility Model,” Decision, 32 (1), pp. 153–169, 2005. [56] A. Mukhopadhyay, S. Chatterjee, R. Roy, D. Saha, A. Mahanti, and S. K. Sadhukhan, “Insuring big losses due to security breaches through insurance: A business model,” in System Sciences, 2007. HICSS 2007. 40th Annual Hawaii International Conference on, 2007, p. 158a–158a. [57] S. Ghosh, A. Mahanti, and D. S. Nau, “ITS: An Efficient Limited-Memory Heuristic Tree Search Algorithm,” Proc. of AAAI-94, Menlo Park, California, USA, pp. 1353–1358, 1994. [58] S. Ghosh, A. Mahanti, R. Nagi, and D. S. Nau, “Manufacturing cell formation by state-space search,” Annals of Operations Research, vol. 65, no. 1, pp. 35–54, 1996. [59] A. Mahanti, C. J. Daniels, S. Ghosh, M. Evett, and A. Pal, “Massively Parallel Heuristic Search for Approximate Optimization Problems,” in Proceedings of the Sixth Conference of Distributed Memory Computing Conference, 1991, pp. 339–346. [60] A. Mukhopadhyay, S. Chatterjee, D. Saha, A. Mahanti, B. B. Chakrabarti, and A. K. Podder, “Mitigating Security breach losses in e-commerce through Insurance,” Proceedings of 4th Security Conference, Las Vegas, Nevada, 2005. [61] S. Perumal and A. Mahanti, “MSCWV: Cyclic Workflow Verification Algorithm for Workflow Graphs,” 2007 BPM and Workflow Handbook, p. 223, 2007. [62] A. Mahanti and K. Ray, “Network Search Algorithms with Modifiable Heuristic,” in Search in AI, USA: Springer, 1988, pp. 200–222. [63] A. Mahanti and K. Ray, “Network Search with Inadmissible Heuristics,” Narosa Publishing, pp. 441–450, 1989. [64] A. Mahanti, S. Ghosh, D. S. Nau, A. K. Pal, and L. N. Kanal, “On the asymptotic optimality of IDA,” 1992. [65] A. Mahanti, S. Ghosh, D. S. Nau, A. K. Pal, and L. N. Kanal, “On the asymptotic performance of IDA*,” Annals of Mathematics and Artificial Intelligence, vol. 20, no. 1, pp. 161–193, 1997. [66] P. Saha, N. Parameswaran, P. Ray, and A. Mahanti, “Ontology Based Modeling for Information Security Management,” in Dependable, Autonomic and Secure Computing (DASC), 2011 IEEE Ninth International Conference on, 2011, pp. 73–80. [67] P. Saha, N. Parameswaran, P. Ray, and A. Mahanti, “Ontology Based Modelling for Information Security Management,” presented at the 9th IEEE International Conference on Dependable, Autonomic and Secure Computing, 2011. [68] P. Saha and A. Mahanti, “Ontology Based Multi Agent Modelling for Information Security Measurement,” in IT Security Governance Innovations:Theory and Research, Hershey, Pennsylvania: IGI Global, 2012, pp. 225–255. [69] A. Mahanti, A. K. Pal, and L. Davis, “Performance of A under inadmissible heuristics—a probabilistic analysis,” 1990. [70] A. Mahanti, A. K. Pal, S. Ghosh, L. N. Kanal, and D. S. Nau, “Performance of A* and IDA*-a worst case analysis,” in Applied Computing, 1991.,[Proceedings of the 1991] Symposium on, 1991, p. 123. [71] A. Mahanti, S. Ghosh, D. S. Nau, L. N. Kanal, and A. K. Pal, “Performance of IDA on Trees and Graphs,” PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, pp. 539–539, 1992. [72] M. Evett, J. Hendler, A. Mahanti, and D. Nau, “PRA*: A memory-limited heuristic search procedure for the connection machine,” in Frontiers of Massively Parallel Computation, 1990. Proceedings., 3rd Symposium on the, 1990, pp. 145–149. [73] M. Evett, J. Hendler, A. Mahanti, and D. Nau, “PRA*: Massively parallel heuristic search,” Journal of Parallel and Distributed Computing, vol. 25, no. 2, pp. 133–143, 1995. [74] J. Hendler, D. Nau, M. Evett, and A. Mahanti, PRA: Massively Parallel Heuristic Search. MARYLAND UNIV COLLEGE PARK SYSTEMS RESEARCH CENTER, 1991. [75] S. Ghose and A. Mahanti, “Search Algorithms for AND/OR Graphs with Cycles,” Working Paper, WPS-295/97, Tndian Tnstitltue of Management Calcutta, 1997. [76] A. Bagchi and A. Mahanti, “Search algorithms under different kinds of heuristics—A comparative study,” Journal of the ACM (JACM), vol. 30, no. 1, pp. 1–21, 1983. [77] S. Mandal, D. Saha, S. Bera, S. Ray, and A. Mahanti, “Session VII-Optical Networking-An Efficient Technique for Dynamic Lightpath Establishment in Survivable Local/Metro WDM Optical Networks,” Lecture Notes in Computer Science, vol. 2918, pp. 350–360, 2003. [78] A. Mahanti and C. J. Daniels, “Simd parallel heuristic search,” 1991. [79] S. Ray and A. Mahanti, “Strategies for effective shilling attacks against recommender systems,” Privacy, Security, and Trust in KDD, pp. 111–125, 2009. [80] A. Bagchi and A. Mahanti, “Three approaches to heuristic search in networks,” Journal of the ACM (JACM), vol. 32, no. 1, pp. 1–27, 1985. [81] A. Mukhopadhyay, S. Chatterjee, D. Saha, A. Mahanti, and S. K. Sadhukhan, “Tiered Approach for Mitigating Big Security Losses: A Variance Reduction Model,” in AMCIS’07, 2007, pp. 260–260. [82] P. Chakraborty, S. Ray, and A. Mahanti, “USE OF TAGS IN RECOMMENDER SYSTEMS: A SURVEY.” [83] S. Ray and A. Mahanti, “Weighted class based hybrid algorithm for top-N recommender systems,” in Proceedings of the 26th IASTED International Conference on Artificial Intelligence and Applications, 2008, pp. 245–251.
Conferences: 
Ambuj Mahanti – Combined Publication List (September, 2012) [1] J. Sethuraman, A. Mahanti, D. Saha, and S. K. Sadhukhan, “A best first search based optimal wavelength assignment algorithm to minimize the number of SONET ADMs in WDM rings,” in Computer Communications and Networks, 2005. ICCCN 2005. Proceedings. 14th International Conference on, 2005, p. 597. [2] P. Saha, N. Parameswaran, B. B. Chakrabarti, and A. Mahanti, “A Formal Analysis of Fraud in Banking Sector,” presented at the HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES -46, Hawaii, USA, 2013. [3] A. Mahanti, S. Ghose, and S. K. Sadhukhan, “A framework for searching AND/OR graphs with cycles,” Arxiv preprint cs/0305001, 2003. [4] S. Perumal and A. Mahanti, “A graph-search based algorithm for verifying workflow graphs,” in Database and Expert Systems Applications, 2005. Proceedings. Sixteenth International Workshop on, 2005, pp. 992–996. [5] S. Mandal, D. Saha, and A. Mahanti, “A heuristic search for generalized cellular network planning,” in Personal Wireless Communications, 2002 IEEE International Conference on, 2002, pp. 105–109. [6] A. Mahanti, S. Ghosh, and A. K. Pal, “A high-performance limited-memory admissible and real time search algorithm for networks,” University of Maryland at College Park, 1992. [7] A. Mahanti and K. Ray, “A New Algorithm for Searching Networks with Loops,” in Proceedings of IASTED Conference, Switzerland, 1989. [8] Z. Li and A. Mahanti, “A progressive flow auction approach for low-cost on-demand P2P media streaming,” Proc. of ACM QShine, 2006. [9] S. Mandal, D. Saha, and A. Mahanti, “A Real-time and Limited-Memory Algorithm for Location Area Planning in Cellular Networks,” WPS-476/2003, IIM Calcutta, 2003. [10] S. Mandal, D. Saha, and A. Mahanti, “A real-time heuristic search technique for fixed channel allocation (FCA) in mobile cellular communications,” Microprocessors and Microsystems, vol. 28, no. 8, pp. 411–416, 2004. [11] S. Janardhanan, A. Mahanti, D. Saha, and S. K. Sadhukhan, “A routing and wavelength assignment (RWA) technique to minimize the number of SONET ADMs in WDM rings,” in System Sciences, 2006. HICSS’06. Proceedings of the 39th Annual Hawaii International Conference on, 2006, vol. 2, p. 32c–32c. [12] A. Mahanti and C. J. Daniels, “A SIMD approach to parallel heuristic search,” Artificial Intelligence, vol. 60, no. 2, pp. 243–282, 1993. [13] S. Perumal and A. Mahanti, “A Simple and Efficient Algorithm for Verifying Workflow Graphs,” Workflow Handbook 2005, pp. 233–256, 2005. [14] A. Mahanti, S. K. Sadhukhan, and S. Ghose, “A Tale of Two Searches: Bidirectional Search Algorithm that Meets in the Middle,” Working Paper, WPS No. 678/2011, Tndian Tnstitltue of Management Calcutta, 2011. [15] S. Mandal, D. Saha, and A. Mahanti, “A technique to support dynamic pricing strategy for differentiated cellular mobile services,” in Global Telecommunications Conference, 2005. GLOBECOM’05. IEEE, 2005, vol. 6, p. 5 pp.–3392. [16] A. Bagchi and A. Mahanti, “Admissible heuristic search in and/or graphs,” Theoretical Computer Science, vol. 24, no. 2, pp. 207–219, Jul. 1983. [17] A. Mahanti, R. Karinthi, S. Ghosh, and A. Pal, “AI Search for Minimum-Cost Set Cover and Multiple-Goal Plan Optimization Problems: Applications to Process Planning,” Report No. UMIACS-TR-90-125, Institute for Advanced Computer Studies, University of Maryland at College Park, Sep. 1990. [18] R. Dass and A. Mahanti, “An Efficient Algorithm for Real-Time Frequent Pattern Mining for Real-Time Business Intelligence Analytics,” in System Sciences, 2006. HICSS’06. Proceedings of the 39th Annual Hawaii International Conference on, 2006, vol. 8, p. 170b–170b. [19] R. Dass and A. Mahanti, “An Efficient Heuristic Search for Real-Time Frequent Pattern Mining,” in System Sciences, 2006. HICSS’06. Proceedings of the 39th Annual Hawaii International Conference on, 2006, vol. 2, p. 40b–40b. [20] R. Dass and A. Mahanti, “An efficient real-time frequent pattern mining technique using diff-sets,” Computational Science–ICCS 2005, pp. 64–72, 2005. [21] S. Mandal, D. Saha, S. Bera, S. Ray, and A. Mahanti, “An efficient technique for dynamic lightpath establishment in survivable local/metro WDM optical networks,” Distributed Computing-IWDC 2003, pp. 830–830, 2003. [22] R. Dass and A. Mahanti, “An efficient technique for frequent pattern mining in real-time business applications,” in System Sciences, 2005. HICSS’05. Proceedings of the 38th Annual Hawaii International Conference on, 2005, p. 76a–76a. [23] M. Nandy and A. Mahanti, “An improved search technique for optimal winner determination in combinatorial auctions,” in System Sciences, 2004. Proceedings of the 37th Annual Hawaii International Conference on, 2004, p. 10 pp. [24] J. Sethuraman, A. Mahanti, and D. Saha, “An Optimal Uninformed Best First Search Based Wavelength Assignment Algorithm to Minimize the Number of Sonet ADMs in WDM Rings,” Telecommunications planning: innovations in pricing, network design and management, pp. 225–239, 2006. [25] A. Mahanti and A. Bagchi, “AND/OR graph heuristic search methods,” J. ACM, vol. 32, no. 1, pp. 28–51, 1985. [26] S. Perumal and A. Mahanti, “Applying graph search techniques for workflow verification,” in System Sciences, 2007. HICSS 2007. 40th Annual Hawaii International Conference on, 2007, pp. 48–48. [27] S. Janardhanan, A. Mahanti, D. Saha, and S. K. Sadhukhan, “BDFS: A Real-Time Search Algorithm for Central Office (CO) Optimization,” in System Sciences, 2007. HICSS 2007. 40th Annual Hawaii International Conference on, 2007, pp. 48–48. [28] A. Mahanti and S. Ghosh, “Best-first search with controlled time and storage,” 1990. [29] S. Ghosh and A. Mahanti, “Bidirectional heuristic search with limited resources,” Information processing letters, vol. 40, no. 6, pp. 335–340, 1991. [30] S. Saha, S. Majumder, S. Ray, and A. Mahanti, “Categorizing user interests in recommender systems,” in Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part II, Cardiff, UK, 2010, pp. 282–291. [31] P. Mereault, P. Ray, and A. Mahanti, “Categorizing User Interests in Recommender Systems,” in 3rd International Symposium of Information Systems, Hyderabad, 2008. [32] S. Mandal, D. Saha, A. Mahanti, and P. C. Pendharkar, “Cell-to-switch level planning in mobile wireless networks for efficient management of radio resources,” Omega, vol. 35, no. 6, pp. 697–705, 2007. [33] S. Saha and A. Mahanti, “Cloud based HIMS - An Indian Perspective,” in CLOSER, 2012, pp. 438–442. [34] S. Saha and A. Mahanti, “Collaborative Preference Elicitation Based on Dynamic Peer Recommendations,” in COLLA 2012, The Second International Conference on Advanced Collaborative Networks, Systems and Applications, 2012, pp. 88–94. [35] A. Mahanti and S. Ghosh, “Controlled best-first search for near optimal solutions,” in Applied Computing, 1991.,[Proceedings of the 1991] Symposium on, 1991, pp. 109–118. [36] S. Ray and A. Mahanti, “Designing Accurate Trust-Aware Recommender Systems for Cold Start Users,” in Artificial Intelligence and Applications, 2010. [37] S. Saha, S. Majumder, S. Ray, and A. Mahanti, “Drifting Preferences in Recommender Systems.” IIM Calcutta WPS No. 654, 2010. [38] S. Ghosh, A. Mahanti, and D. S. Nau, “Efficient Limited Memory Heuristic Search.” [39] A. Mukhopadhyay, S. Chatterjee, D. Saha, A. Mahanti, and S. K. Sadhukhan, “E-Risk Insurance Product Design: A Copula Based Bayesian Belief Network Model.” [40] A. Mukhopadhyay, B. Bhushan, D. Saha, and A. Mahanti, “E-Risk Management through Self Insurance: An Option Model,” in System Sciences, 2007. HICSS 2007. 40th Annual Hawaii International Conference on, 2007, p. 158b–158b. [41] A. Mukhopadhyay, S. Chatterjee, D. Saha, A. Mahanti, and S. K. Sadhukhan, “e-Risk management with insurance: a framework using copula aided Bayesian belief networks,” in System Sciences, 2006. HICSS’06. Proceedings of the 39th Annual Hawaii International Conference on, 2006, vol. 6, p. 126a–126a. [42] A. Mukhopadhyay, S. Chatterjee, D. Saha, A. Mahanti, and A. K. Podder, “e-risk: A case for insurance,” Proceedings of the Conference on Information Systems and Technology Management, New Delhi, 2005. [43] R. Dass and A. Mahanti, “Fast Frequent Pattern Mining in Real-Time,” Proceedings of the Eleventh International Conference on Management of Data (COMAD 2005), Goa, India, 2005. [44] S. Ray and A. Mahanti, “Filler Item Strategies for Shilling Attacks against Recommender Systems,” in System Sciences, 2009. HICSS’09. 42nd Hawaii International Conference on, 2009, pp. 1–10. [45] S. Ray and A. Mahanti, “Filler items strategies for effective shilling attacks,” Workshop on Recommender Systems, p. 31, 2008. [46] S. Perumal and A. Mahanti, “Formal Foundation of Workflow Hyperpaths and a Graph Search Algorithm for Workflow Hyperpath Generation,” in Hawaii International Conference on System Sciences, Proceedings of the 41st Annual, 2008, pp. 102–102. [47] R. Dass and A. Mahanti, “Frequent Pattern Mining in Real-Time–First Results,” TDM2004/ACM SIGKDD, 2004. [48] R. Dass and A. Mahanti, “h1-max: A Domain Independent Heuristic for Real-Time Frequent Pattern Mining,” 2005. [49] A. Mahanti and K. Ray, “Heuristic search in networks with modifiable estimate,” in ACM Conference on Computer Science, 1987, pp. 166–174. [50] S. Mandal, D. Saha, and A. Mahanti, “Heuristic search techniques for cell to switch assignment in location area planning for cellular networks,” in Communications, 2004 IEEE International Conference on, 2004, vol. 7, pp. 4307–4311 Vol. 7. [51] A. Mahanti and C. J. Daniels, “IDPS: a massively parallel heuristic search algorithm,” in Parallel Processing Symposium, 1992. Proceedings., Sixth International, 1992, pp. 220–223. [52] R. Dass and A. Mahanti, “Implementing BDFS (b) with diff-sets for real-time frequent pattern mining in dense datasets-first findings,” in Ubiquitous Data Management, 2005. UDM 2005. International Workshop on, 2005, pp. 113–120. [53] S. Ray and A. Mahanti, “Improving Prediction Accuracy in Trust-Aware Recommender Systems,” in System Sciences (HICSS), 2010 43rd Hawaii International Conference on, 2010, pp. 1–9. [54] S. Ghosh, A. Mahanti, and D. S. Nau, “Improving the efficiency of limited-memory heuristic search,” 1998. [55] A. Mukhopadhyay, D. Saha, A. Mahanti, B. B. Chakrabarti, and A. Podder, “Insurance for cyber-risk: A Utility Model,” Decision, 32 (1), pp. 153–169, 2005. [56] A. Mukhopadhyay, S. Chatterjee, R. Roy, D. Saha, A. Mahanti, and S. K. Sadhukhan, “Insuring big losses due to security breaches through insurance: A business model,” in System Sciences, 2007. HICSS 2007. 40th Annual Hawaii International Conference on, 2007, p. 158a–158a. [57] S. Ghosh, A. Mahanti, and D. S. Nau, “ITS: An Efficient Limited-Memory Heuristic Tree Search Algorithm,” Proc. of AAAI-94, Menlo Park, California, USA, pp. 1353–1358, 1994. [58] S. Ghosh, A. Mahanti, R. Nagi, and D. S. Nau, “Manufacturing cell formation by state-space search,” Annals of Operations Research, vol. 65, no. 1, pp. 35–54, 1996. [59] A. Mahanti, C. J. Daniels, S. Ghosh, M. Evett, and A. Pal, “Massively Parallel Heuristic Search for Approximate Optimization Problems,” in Proceedings of the Sixth Conference of Distributed Memory Computing Conference, 1991, pp. 339–346. [60] A. Mukhopadhyay, S. Chatterjee, D. Saha, A. Mahanti, B. B. Chakrabarti, and A. K. Podder, “Mitigating Security breach losses in e-commerce through Insurance,” Proceedings of 4th Security Conference, Las Vegas, Nevada, 2005. [61] S. Perumal and A. Mahanti, “MSCWV: Cyclic Workflow Verification Algorithm for Workflow Graphs,” 2007 BPM and Workflow Handbook, p. 223, 2007. [62] A. Mahanti and K. Ray, “Network Search Algorithms with Modifiable Heuristic,” in Search in AI, USA: Springer, 1988, pp. 200–222. [63] A. Mahanti and K. Ray, “Network Search with Inadmissible Heuristics,” Narosa Publishing, pp. 441–450, 1989. [64] A. Mahanti, S. Ghosh, D. S. Nau, A. K. Pal, and L. N. Kanal, “On the asymptotic optimality of IDA,” 1992. [65] A. Mahanti, S. Ghosh, D. S. Nau, A. K. Pal, and L. N. Kanal, “On the asymptotic performance of IDA*,” Annals of Mathematics and Artificial Intelligence, vol. 20, no. 1, pp. 161–193, 1997. [66] P. Saha, N. Parameswaran, P. Ray, and A. Mahanti, “Ontology Based Modeling for Information Security Management,” in Dependable, Autonomic and Secure Computing (DASC), 2011 IEEE Ninth International Conference on, 2011, pp. 73–80. [67] P. Saha, N. Parameswaran, P. Ray, and A. Mahanti, “Ontology Based Modelling for Information Security Management,” presented at the 9th IEEE International Conference on Dependable, Autonomic and Secure Computing, 2011. [68] P. Saha and A. Mahanti, “Ontology Based Multi Agent Modelling for Information Security Measurement,” in IT Security Governance Innovations:Theory and Research, Hershey, Pennsylvania: IGI Global, 2012, pp. 225–255. [69] A. Mahanti, A. K. Pal, and L. Davis, “Performance of A under inadmissible heuristics—a probabilistic analysis,” 1990. [70] A. Mahanti, A. K. Pal, S. Ghosh, L. N. Kanal, and D. S. Nau, “Performance of A* and IDA*-a worst case analysis,” in Applied Computing, 1991.,[Proceedings of the 1991] Symposium on, 1991, p. 123. [71] A. Mahanti, S. Ghosh, D. S. Nau, L. N. Kanal, and A. K. Pal, “Performance of IDA on Trees and Graphs,” PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, pp. 539–539, 1992. [72] M. Evett, J. Hendler, A. Mahanti, and D. Nau, “PRA*: A memory-limited heuristic search procedure for the connection machine,” in Frontiers of Massively Parallel Computation, 1990. Proceedings., 3rd Symposium on the, 1990, pp. 145–149. [73] M. Evett, J. Hendler, A. Mahanti, and D. Nau, “PRA*: Massively parallel heuristic search,” Journal of Parallel and Distributed Computing, vol. 25, no. 2, pp. 133–143, 1995. [74] J. Hendler, D. Nau, M. Evett, and A. Mahanti, PRA: Massively Parallel Heuristic Search. MARYLAND UNIV COLLEGE PARK SYSTEMS RESEARCH CENTER, 1991. [75] S. Ghose and A. Mahanti, “Search Algorithms for AND/OR Graphs with Cycles,” Working Paper, WPS-295/97, Tndian Tnstitltue of Management Calcutta, 1997. [76] A. Bagchi and A. Mahanti, “Search algorithms under different kinds of heuristics—A comparative study,” Journal of the ACM (JACM), vol. 30, no. 1, pp. 1–21, 1983. [77] S. Mandal, D. Saha, S. Bera, S. Ray, and A. Mahanti, “Session VII-Optical Networking-An Efficient Technique for Dynamic Lightpath Establishment in Survivable Local/Metro WDM Optical Networks,” Lecture Notes in Computer Science, vol. 2918, pp. 350–360, 2003. [78] A. Mahanti and C. J. Daniels, “Simd parallel heuristic search,” 1991. [79] S. Ray and A. Mahanti, “Strategies for effective shilling attacks against recommender systems,” Privacy, Security, and Trust in KDD, pp. 111–125, 2009. [80] A. Bagchi and A. Mahanti, “Three approaches to heuristic search in networks,” Journal of the ACM (JACM), vol. 32, no. 1, pp. 1–27, 1985. [81] A. Mukhopadhyay, S. Chatterjee, D. Saha, A. Mahanti, and S. K. Sadhukhan, “Tiered Approach for Mitigating Big Security Losses: A Variance Reduction Model,” in AMCIS’07, 2007, pp. 260–260. [82] P. Chakraborty, S. Ray, and A. Mahanti, “USE OF TAGS IN RECOMMENDER SYSTEMS: A SURVEY.” [83] S. Ray and A. Mahanti, “Weighted class based hybrid algorithm for top-N recommender systems,” in Proceedings of the 26th IASTED International Conference on Artificial Intelligence and Applications, 2008, pp. 245–251.
Articles/Cases: 
Ambuj Mahanti – Combined Publication List (September, 2012) [1] J. Sethuraman, A. Mahanti, D. Saha, and S. K. Sadhukhan, “A best first search based optimal wavelength assignment algorithm to minimize the number of SONET ADMs in WDM rings,” in Computer Communications and Networks, 2005. ICCCN 2005. Proceedings. 14th International Conference on, 2005, p. 597. [2] P. Saha, N. Parameswaran, B. B. Chakrabarti, and A. Mahanti, “A Formal Analysis of Fraud in Banking Sector,” presented at the HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES -46, Hawaii, USA, 2013. [3] A. Mahanti, S. Ghose, and S. K. Sadhukhan, “A framework for searching AND/OR graphs with cycles,” Arxiv preprint cs/0305001, 2003. [4] S. Perumal and A. Mahanti, “A graph-search based algorithm for verifying workflow graphs,” in Database and Expert Systems Applications, 2005. Proceedings. Sixteenth International Workshop on, 2005, pp. 992–996. [5] S. Mandal, D. Saha, and A. Mahanti, “A heuristic search for generalized cellular network planning,” in Personal Wireless Communications, 2002 IEEE International Conference on, 2002, pp. 105–109. [6] A. Mahanti, S. Ghosh, and A. K. Pal, “A high-performance limited-memory admissible and real time search algorithm for networks,” University of Maryland at College Park, 1992. [7] A. Mahanti and K. Ray, “A New Algorithm for Searching Networks with Loops,” in Proceedings of IASTED Conference, Switzerland, 1989. [8] Z. Li and A. Mahanti, “A progressive flow auction approach for low-cost on-demand P2P media streaming,” Proc. of ACM QShine, 2006. [9] S. Mandal, D. Saha, and A. Mahanti, “A Real-time and Limited-Memory Algorithm for Location Area Planning in Cellular Networks,” WPS-476/2003, IIM Calcutta, 2003. [10] S. Mandal, D. Saha, and A. Mahanti, “A real-time heuristic search technique for fixed channel allocation (FCA) in mobile cellular communications,” Microprocessors and Microsystems, vol. 28, no. 8, pp. 411–416, 2004. [11] S. Janardhanan, A. Mahanti, D. Saha, and S. K. Sadhukhan, “A routing and wavelength assignment (RWA) technique to minimize the number of SONET ADMs in WDM rings,” in System Sciences, 2006. HICSS’06. Proceedings of the 39th Annual Hawaii International Conference on, 2006, vol. 2, p. 32c–32c. [12] A. Mahanti and C. J. Daniels, “A SIMD approach to parallel heuristic search,” Artificial Intelligence, vol. 60, no. 2, pp. 243–282, 1993. [13] S. Perumal and A. Mahanti, “A Simple and Efficient Algorithm for Verifying Workflow Graphs,” Workflow Handbook 2005, pp. 233–256, 2005. [14] A. Mahanti, S. K. Sadhukhan, and S. Ghose, “A Tale of Two Searches: Bidirectional Search Algorithm that Meets in the Middle,” Working Paper, WPS No. 678/2011, Tndian Tnstitltue of Management Calcutta, 2011. [15] S. Mandal, D. Saha, and A. Mahanti, “A technique to support dynamic pricing strategy for differentiated cellular mobile services,” in Global Telecommunications Conference, 2005. GLOBECOM’05. IEEE, 2005, vol. 6, p. 5 pp.–3392. [16] A. Bagchi and A. Mahanti, “Admissible heuristic search in and/or graphs,” Theoretical Computer Science, vol. 24, no. 2, pp. 207–219, Jul. 1983. [17] A. Mahanti, R. Karinthi, S. Ghosh, and A. Pal, “AI Search for Minimum-Cost Set Cover and Multiple-Goal Plan Optimization Problems: Applications to Process Planning,” Report No. UMIACS-TR-90-125, Institute for Advanced Computer Studies, University of Maryland at College Park, Sep. 1990. [18] R. Dass and A. Mahanti, “An Efficient Algorithm for Real-Time Frequent Pattern Mining for Real-Time Business Intelligence Analytics,” in System Sciences, 2006. HICSS’06. Proceedings of the 39th Annual Hawaii International Conference on, 2006, vol. 8, p. 170b–170b. [19] R. Dass and A. Mahanti, “An Efficient Heuristic Search for Real-Time Frequent Pattern Mining,” in System Sciences, 2006. HICSS’06. Proceedings of the 39th Annual Hawaii International Conference on, 2006, vol. 2, p. 40b–40b. [20] R. Dass and A. Mahanti, “An efficient real-time frequent pattern mining technique using diff-sets,” Computational Science–ICCS 2005, pp. 64–72, 2005. [21] S. Mandal, D. Saha, S. Bera, S. Ray, and A. Mahanti, “An efficient technique for dynamic lightpath establishment in survivable local/metro WDM optical networks,” Distributed Computing-IWDC 2003, pp. 830–830, 2003. [22] R. Dass and A. Mahanti, “An efficient technique for frequent pattern mining in real-time business applications,” in System Sciences, 2005. HICSS’05. Proceedings of the 38th Annual Hawaii International Conference on, 2005, p. 76a–76a. [23] M. Nandy and A. Mahanti, “An improved search technique for optimal winner determination in combinatorial auctions,” in System Sciences, 2004. Proceedings of the 37th Annual Hawaii International Conference on, 2004, p. 10 pp. [24] J. Sethuraman, A. Mahanti, and D. Saha, “An Optimal Uninformed Best First Search Based Wavelength Assignment Algorithm to Minimize the Number of Sonet ADMs in WDM Rings,” Telecommunications planning: innovations in pricing, network design and management, pp. 225–239, 2006. [25] A. Mahanti and A. Bagchi, “AND/OR graph heuristic search methods,” J. ACM, vol. 32, no. 1, pp. 28–51, 1985. [26] S. Perumal and A. Mahanti, “Applying graph search techniques for workflow verification,” in System Sciences, 2007. HICSS 2007. 40th Annual Hawaii International Conference on, 2007, pp. 48–48. [27] S. Janardhanan, A. Mahanti, D. Saha, and S. K. Sadhukhan, “BDFS: A Real-Time Search Algorithm for Central Office (CO) Optimization,” in System Sciences, 2007. HICSS 2007. 40th Annual Hawaii International Conference on, 2007, pp. 48–48. [28] A. Mahanti and S. Ghosh, “Best-first search with controlled time and storage,” 1990. [29] S. Ghosh and A. Mahanti, “Bidirectional heuristic search with limited resources,” Information processing letters, vol. 40, no. 6, pp. 335–340, 1991. [30] S. Saha, S. Majumder, S. Ray, and A. Mahanti, “Categorizing user interests in recommender systems,” in Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part II, Cardiff, UK, 2010, pp. 282–291. [31] P. Mereault, P. Ray, and A. Mahanti, “Categorizing User Interests in Recommender Systems,” in 3rd International Symposium of Information Systems, Hyderabad, 2008. [32] S. Mandal, D. Saha, A. Mahanti, and P. C. Pendharkar, “Cell-to-switch level planning in mobile wireless networks for efficient management of radio resources,” Omega, vol. 35, no. 6, pp. 697–705, 2007. [33] S. Saha and A. Mahanti, “Cloud based HIMS - An Indian Perspective,” in CLOSER, 2012, pp. 438–442. [34] S. Saha and A. Mahanti, “Collaborative Preference Elicitation Based on Dynamic Peer Recommendations,” in COLLA 2012, The Second International Conference on Advanced Collaborative Networks, Systems and Applications, 2012, pp. 88–94. [35] A. Mahanti and S. Ghosh, “Controlled best-first search for near optimal solutions,” in Applied Computing, 1991.,[Proceedings of the 1991] Symposium on, 1991, pp. 109–118. [36] S. Ray and A. Mahanti, “Designing Accurate Trust-Aware Recommender Systems for Cold Start Users,” in Artificial Intelligence and Applications, 2010. [37] S. Saha, S. Majumder, S. Ray, and A. Mahanti, “Drifting Preferences in Recommender Systems.” IIM Calcutta WPS No. 654, 2010. [38] S. Ghosh, A. Mahanti, and D. S. Nau, “Efficient Limited Memory Heuristic Search.” [39] A. Mukhopadhyay, S. Chatterjee, D. Saha, A. Mahanti, and S. K. Sadhukhan, “E-Risk Insurance Product Design: A Copula Based Bayesian Belief Network Model.” [40] A. Mukhopadhyay, B. Bhushan, D. Saha, and A. Mahanti, “E-Risk Management through Self Insurance: An Option Model,” in System Sciences, 2007. HICSS 2007. 40th Annual Hawaii International Conference on, 2007, p. 158b–158b. [41] A. Mukhopadhyay, S. Chatterjee, D. Saha, A. Mahanti, and S. K. Sadhukhan, “e-Risk management with insurance: a framework using copula aided Bayesian belief networks,” in System Sciences, 2006. HICSS’06. Proceedings of the 39th Annual Hawaii International Conference on, 2006, vol. 6, p. 126a–126a. [42] A. Mukhopadhyay, S. Chatterjee, D. Saha, A. Mahanti, and A. K. Podder, “e-risk: A case for insurance,” Proceedings of the Conference on Information Systems and Technology Management, New Delhi, 2005. [43] R. Dass and A. Mahanti, “Fast Frequent Pattern Mining in Real-Time,” Proceedings of the Eleventh International Conference on Management of Data (COMAD 2005), Goa, India, 2005. [44] S. Ray and A. Mahanti, “Filler Item Strategies for Shilling Attacks against Recommender Systems,” in System Sciences, 2009. HICSS’09. 42nd Hawaii International Conference on, 2009, pp. 1–10. [45] S. Ray and A. Mahanti, “Filler items strategies for effective shilling attacks,” Workshop on Recommender Systems, p. 31, 2008. [46] S. Perumal and A. Mahanti, “Formal Foundation of Workflow Hyperpaths and a Graph Search Algorithm for Workflow Hyperpath Generation,” in Hawaii International Conference on System Sciences, Proceedings of the 41st Annual, 2008, pp. 102–102. [47] R. Dass and A. Mahanti, “Frequent Pattern Mining in Real-Time–First Results,” TDM2004/ACM SIGKDD, 2004. [48] R. Dass and A. Mahanti, “h1-max: A Domain Independent Heuristic for Real-Time Frequent Pattern Mining,” 2005. [49] A. Mahanti and K. Ray, “Heuristic search in networks with modifiable estimate,” in ACM Conference on Computer Science, 1987, pp. 166–174. [50] S. Mandal, D. Saha, and A. Mahanti, “Heuristic search techniques for cell to switch assignment in location area planning for cellular networks,” in Communications, 2004 IEEE International Conference on, 2004, vol. 7, pp. 4307–4311 Vol. 7. [51] A. Mahanti and C. J. Daniels, “IDPS: a massively parallel heuristic search algorithm,” in Parallel Processing Symposium, 1992. Proceedings., Sixth International, 1992, pp. 220–223. [52] R. Dass and A. Mahanti, “Implementing BDFS (b) with diff-sets for real-time frequent pattern mining in dense datasets-first findings,” in Ubiquitous Data Management, 2005. UDM 2005. International Workshop on, 2005, pp. 113–120. [53] S. Ray and A. Mahanti, “Improving Prediction Accuracy in Trust-Aware Recommender Systems,” in System Sciences (HICSS), 2010 43rd Hawaii International Conference on, 2010, pp. 1–9. [54] S. Ghosh, A. Mahanti, and D. S. Nau, “Improving the efficiency of limited-memory heuristic search,” 1998. [55] A. Mukhopadhyay, D. Saha, A. Mahanti, B. B. Chakrabarti, and A. Podder, “Insurance for cyber-risk: A Utility Model,” Decision, 32 (1), pp. 153–169, 2005. [56] A. Mukhopadhyay, S. Chatterjee, R. Roy, D. Saha, A. Mahanti, and S. K. Sadhukhan, “Insuring big losses due to security breaches through insurance: A business model,” in System Sciences, 2007. HICSS 2007. 40th Annual Hawaii International Conference on, 2007, p. 158a–158a. [57] S. Ghosh, A. Mahanti, and D. S. Nau, “ITS: An Efficient Limited-Memory Heuristic Tree Search Algorithm,” Proc. of AAAI-94, Menlo Park, California, USA, pp. 1353–1358, 1994. [58] S. Ghosh, A. Mahanti, R. Nagi, and D. S. Nau, “Manufacturing cell formation by state-space search,” Annals of Operations Research, vol. 65, no. 1, pp. 35–54, 1996. [59] A. Mahanti, C. J. Daniels, S. Ghosh, M. Evett, and A. Pal, “Massively Parallel Heuristic Search for Approximate Optimization Problems,” in Proceedings of the Sixth Conference of Distributed Memory Computing Conference, 1991, pp. 339–346. [60] A. Mukhopadhyay, S. Chatterjee, D. Saha, A. Mahanti, B. B. Chakrabarti, and A. K. Podder, “Mitigating Security breach losses in e-commerce through Insurance,” Proceedings of 4th Security Conference, Las Vegas, Nevada, 2005. [61] S. Perumal and A. Mahanti, “MSCWV: Cyclic Workflow Verification Algorithm for Workflow Graphs,” 2007 BPM and Workflow Handbook, p. 223, 2007. [62] A. Mahanti and K. Ray, “Network Search Algorithms with Modifiable Heuristic,” in Search in AI, USA: Springer, 1988, pp. 200–222. [63] A. Mahanti and K. Ray, “Network Search with Inadmissible Heuristics,” Narosa Publishing, pp. 441–450, 1989. [64] A. Mahanti, S. Ghosh, D. S. Nau, A. K. Pal, and L. N. Kanal, “On the asymptotic optimality of IDA,” 1992. [65] A. Mahanti, S. Ghosh, D. S. Nau, A. K. Pal, and L. N. Kanal, “On the asymptotic performance of IDA*,” Annals of Mathematics and Artificial Intelligence, vol. 20, no. 1, pp. 161–193, 1997. [66] P. Saha, N. Parameswaran, P. Ray, and A. Mahanti, “Ontology Based Modeling for Information Security Management,” in Dependable, Autonomic and Secure Computing (DASC), 2011 IEEE Ninth International Conference on, 2011, pp. 73–80. [67] P. Saha, N. Parameswaran, P. Ray, and A. Mahanti, “Ontology Based Modelling for Information Security Management,” presented at the 9th IEEE International Conference on Dependable, Autonomic and Secure Computing, 2011. [68] P. Saha and A. Mahanti, “Ontology Based Multi Agent Modelling for Information Security Measurement,” in IT Security Governance Innovations:Theory and Research, Hershey, Pennsylvania: IGI Global, 2012, pp. 225–255. [69] A. Mahanti, A. K. Pal, and L. Davis, “Performance of A under inadmissible heuristics—a probabilistic analysis,” 1990. [70] A. Mahanti, A. K. Pal, S. Ghosh, L. N. Kanal, and D. S. Nau, “Performance of A* and IDA*-a worst case analysis,” in Applied Computing, 1991.,[Proceedings of the 1991] Symposium on, 1991, p. 123. [71] A. Mahanti, S. Ghosh, D. S. Nau, L. N. Kanal, and A. K. Pal, “Performance of IDA on Trees and Graphs,” PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, pp. 539–539, 1992. [72] M. Evett, J. Hendler, A. Mahanti, and D. Nau, “PRA*: A memory-limited heuristic search procedure for the connection machine,” in Frontiers of Massively Parallel Computation, 1990. Proceedings., 3rd Symposium on the, 1990, pp. 145–149. [73] M. Evett, J. Hendler, A. Mahanti, and D. Nau, “PRA*: Massively parallel heuristic search,” Journal of Parallel and Distributed Computing, vol. 25, no. 2, pp. 133–143, 1995. [74] J. Hendler, D. Nau, M. Evett, and A. Mahanti, PRA: Massively Parallel Heuristic Search. MARYLAND UNIV COLLEGE PARK SYSTEMS RESEARCH CENTER, 1991. [75] S. Ghose and A. Mahanti, “Search Algorithms for AND/OR Graphs with Cycles,” Working Paper, WPS-295/97, Tndian Tnstitltue of Management Calcutta, 1997. [76] A. Bagchi and A. Mahanti, “Search algorithms under different kinds of heuristics—A comparative study,” Journal of the ACM (JACM), vol. 30, no. 1, pp. 1–21, 1983. [77] S. Mandal, D. Saha, S. Bera, S. Ray, and A. Mahanti, “Session VII-Optical Networking-An Efficient Technique for Dynamic Lightpath Establishment in Survivable Local/Metro WDM Optical Networks,” Lecture Notes in Computer Science, vol. 2918, pp. 350–360, 2003. [78] A. Mahanti and C. J. Daniels, “Simd parallel heuristic search,” 1991. [79] S. Ray and A. Mahanti, “Strategies for effective shilling attacks against recommender systems,” Privacy, Security, and Trust in KDD, pp. 111–125, 2009. [80] A. Bagchi and A. Mahanti, “Three approaches to heuristic search in networks,” Journal of the ACM (JACM), vol. 32, no. 1, pp. 1–27, 1985. [81] A. Mukhopadhyay, S. Chatterjee, D. Saha, A. Mahanti, and S. K. Sadhukhan, “Tiered Approach for Mitigating Big Security Losses: A Variance Reduction Model,” in AMCIS’07, 2007, pp. 260–260. [82] P. Chakraborty, S. Ray, and A. Mahanti, “USE OF TAGS IN RECOMMENDER SYSTEMS: A SURVEY.” [83] S. Ray and A. Mahanti, “Weighted class based hybrid algorithm for top-N recommender systems,” in Proceedings of the 26th IASTED International Conference on Artificial Intelligence and Applications, 2008, pp. 245–251.
Books/Book Chapters: 
Ambuj Mahanti – Combined Publication List (September, 2012) [1] J. Sethuraman, A. Mahanti, D. Saha, and S. K. Sadhukhan, “A best first search based optimal wavelength assignment algorithm to minimize the number of SONET ADMs in WDM rings,” in Computer Communications and Networks, 2005. ICCCN 2005. Proceedings. 14th International Conference on, 2005, p. 597. [2] P. Saha, N. Parameswaran, B. B. Chakrabarti, and A. Mahanti, “A Formal Analysis of Fraud in Banking Sector,” presented at the HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES -46, Hawaii, USA, 2013. [3] A. Mahanti, S. Ghose, and S. K. Sadhukhan, “A framework for searching AND/OR graphs with cycles,” Arxiv preprint cs/0305001, 2003. [4] S. Perumal and A. Mahanti, “A graph-search based algorithm for verifying workflow graphs,” in Database and Expert Systems Applications, 2005. Proceedings. Sixteenth International Workshop on, 2005, pp. 992–996. [5] S. Mandal, D. Saha, and A. Mahanti, “A heuristic search for generalized cellular network planning,” in Personal Wireless Communications, 2002 IEEE International Conference on, 2002, pp. 105–109. [6] A. Mahanti, S. Ghosh, and A. K. Pal, “A high-performance limited-memory admissible and real time search algorithm for networks,” University of Maryland at College Park, 1992. [7] A. Mahanti and K. Ray, “A New Algorithm for Searching Networks with Loops,” in Proceedings of IASTED Conference, Switzerland, 1989. [8] Z. Li and A. Mahanti, “A progressive flow auction approach for low-cost on-demand P2P media streaming,” Proc. of ACM QShine, 2006. [9] S. Mandal, D. Saha, and A. Mahanti, “A Real-time and Limited-Memory Algorithm for Location Area Planning in Cellular Networks,” WPS-476/2003, IIM Calcutta, 2003. [10] S. Mandal, D. Saha, and A. Mahanti, “A real-time heuristic search technique for fixed channel allocation (FCA) in mobile cellular communications,” Microprocessors and Microsystems, vol. 28, no. 8, pp. 411–416, 2004. [11] S. Janardhanan, A. Mahanti, D. Saha, and S. K. Sadhukhan, “A routing and wavelength assignment (RWA) technique to minimize the number of SONET ADMs in WDM rings,” in System Sciences, 2006. HICSS’06. Proceedings of the 39th Annual Hawaii International Conference on, 2006, vol. 2, p. 32c–32c. [12] A. Mahanti and C. J. Daniels, “A SIMD approach to parallel heuristic search,” Artificial Intelligence, vol. 60, no. 2, pp. 243–282, 1993. [13] S. Perumal and A. Mahanti, “A Simple and Efficient Algorithm for Verifying Workflow Graphs,” Workflow Handbook 2005, pp. 233–256, 2005. [14] A. Mahanti, S. K. Sadhukhan, and S. Ghose, “A Tale of Two Searches: Bidirectional Search Algorithm that Meets in the Middle,” Working Paper, WPS No. 678/2011, Tndian Tnstitltue of Management Calcutta, 2011. [15] S. Mandal, D. Saha, and A. Mahanti, “A technique to support dynamic pricing strategy for differentiated cellular mobile services,” in Global Telecommunications Conference, 2005. GLOBECOM’05. IEEE, 2005, vol. 6, p. 5 pp.–3392. [16] A. Bagchi and A. Mahanti, “Admissible heuristic search in and/or graphs,” Theoretical Computer Science, vol. 24, no. 2, pp. 207–219, Jul. 1983. [17] A. Mahanti, R. Karinthi, S. Ghosh, and A. Pal, “AI Search for Minimum-Cost Set Cover and Multiple-Goal Plan Optimization Problems: Applications to Process Planning,” Report No. UMIACS-TR-90-125, Institute for Advanced Computer Studies, University of Maryland at College Park, Sep. 1990. [18] R. Dass and A. Mahanti, “An Efficient Algorithm for Real-Time Frequent Pattern Mining for Real-Time Business Intelligence Analytics,” in System Sciences, 2006. HICSS’06. Proceedings of the 39th Annual Hawaii International Conference on, 2006, vol. 8, p. 170b–170b. [19] R. Dass and A. Mahanti, “An Efficient Heuristic Search for Real-Time Frequent Pattern Mining,” in System Sciences, 2006. HICSS’06. Proceedings of the 39th Annual Hawaii International Conference on, 2006, vol. 2, p. 40b–40b. [20] R. Dass and A. Mahanti, “An efficient real-time frequent pattern mining technique using diff-sets,” Computational Science–ICCS 2005, pp. 64–72, 2005. [21] S. Mandal, D. Saha, S. Bera, S. Ray, and A. Mahanti, “An efficient technique for dynamic lightpath establishment in survivable local/metro WDM optical networks,” Distributed Computing-IWDC 2003, pp. 830–830, 2003. [22] R. Dass and A. Mahanti, “An efficient technique for frequent pattern mining in real-time business applications,” in System Sciences, 2005. HICSS’05. Proceedings of the 38th Annual Hawaii International Conference on, 2005, p. 76a–76a. [23] M. Nandy and A. Mahanti, “An improved search technique for optimal winner determination in combinatorial auctions,” in System Sciences, 2004. Proceedings of the 37th Annual Hawaii International Conference on, 2004, p. 10 pp. [24] J. Sethuraman, A. Mahanti, and D. Saha, “An Optimal Uninformed Best First Search Based Wavelength Assignment Algorithm to Minimize the Number of Sonet ADMs in WDM Rings,” Telecommunications planning: innovations in pricing, network design and management, pp. 225–239, 2006. [25] A. Mahanti and A. Bagchi, “AND/OR graph heuristic search methods,” J. ACM, vol. 32, no. 1, pp. 28–51, 1985. [26] S. Perumal and A. Mahanti, “Applying graph search techniques for workflow verification,” in System Sciences, 2007. HICSS 2007. 40th Annual Hawaii International Conference on, 2007, pp. 48–48. [27] S. Janardhanan, A. Mahanti, D. Saha, and S. K. Sadhukhan, “BDFS: A Real-Time Search Algorithm for Central Office (CO) Optimization,” in System Sciences, 2007. HICSS 2007. 40th Annual Hawaii International Conference on, 2007, pp. 48–48. [28] A. Mahanti and S. Ghosh, “Best-first search with controlled time and storage,” 1990. [29] S. Ghosh and A. Mahanti, “Bidirectional heuristic search with limited resources,” Information processing letters, vol. 40, no. 6, pp. 335–340, 1991. [30] S. Saha, S. Majumder, S. Ray, and A. Mahanti, “Categorizing user interests in recommender systems,” in Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part II, Cardiff, UK, 2010, pp. 282–291. [31] P. Mereault, P. Ray, and A. Mahanti, “Categorizing User Interests in Recommender Systems,” in 3rd International Symposium of Information Systems, Hyderabad, 2008. [32] S. Mandal, D. Saha, A. Mahanti, and P. C. Pendharkar, “Cell-to-switch level planning in mobile wireless networks for efficient management of radio resources,” Omega, vol. 35, no. 6, pp. 697–705, 2007. [33] S. Saha and A. Mahanti, “Cloud based HIMS - An Indian Perspective,” in CLOSER, 2012, pp. 438–442. [34] S. Saha and A. Mahanti, “Collaborative Preference Elicitation Based on Dynamic Peer Recommendations,” in COLLA 2012, The Second International Conference on Advanced Collaborative Networks, Systems and Applications, 2012, pp. 88–94. [35] A. Mahanti and S. Ghosh, “Controlled best-first search for near optimal solutions,” in Applied Computing, 1991.,[Proceedings of the 1991] Symposium on, 1991, pp. 109–118. [36] S. Ray and A. Mahanti, “Designing Accurate Trust-Aware Recommender Systems for Cold Start Users,” in Artificial Intelligence and Applications, 2010. [37] S. Saha, S. Majumder, S. Ray, and A. Mahanti, “Drifting Preferences in Recommender Systems.” IIM Calcutta WPS No. 654, 2010. [38] S. Ghosh, A. Mahanti, and D. S. Nau, “Efficient Limited Memory Heuristic Search.” [39] A. Mukhopadhyay, S. Chatterjee, D. Saha, A. Mahanti, and S. K. Sadhukhan, “E-Risk Insurance Product Design: A Copula Based Bayesian Belief Network Model.” [40] A. Mukhopadhyay, B. Bhushan, D. Saha, and A. Mahanti, “E-Risk Management through Self Insurance: An Option Model,” in System Sciences, 2007. HICSS 2007. 40th Annual Hawaii International Conference on, 2007, p. 158b–158b. [41] A. Mukhopadhyay, S. Chatterjee, D. Saha, A. Mahanti, and S. K. Sadhukhan, “e-Risk management with insurance: a framework using copula aided Bayesian belief networks,” in System Sciences, 2006. HICSS’06. Proceedings of the 39th Annual Hawaii International Conference on, 2006, vol. 6, p. 126a–126a. [42] A. Mukhopadhyay, S. Chatterjee, D. Saha, A. Mahanti, and A. K. Podder, “e-risk: A case for insurance,” Proceedings of the Conference on Information Systems and Technology Management, New Delhi, 2005. [43] R. Dass and A. Mahanti, “Fast Frequent Pattern Mining in Real-Time,” Proceedings of the Eleventh International Conference on Management of Data (COMAD 2005), Goa, India, 2005. [44] S. Ray and A. Mahanti, “Filler Item Strategies for Shilling Attacks against Recommender Systems,” in System Sciences, 2009. HICSS’09. 42nd Hawaii International Conference on, 2009, pp. 1–10. [45] S. Ray and A. Mahanti, “Filler items strategies for effective shilling attacks,” Workshop on Recommender Systems, p. 31, 2008. [46] S. Perumal and A. Mahanti, “Formal Foundation of Workflow Hyperpaths and a Graph Search Algorithm for Workflow Hyperpath Generation,” in Hawaii International Conference on System Sciences, Proceedings of the 41st Annual, 2008, pp. 102–102. [47] R. Dass and A. Mahanti, “Frequent Pattern Mining in Real-Time–First Results,” TDM2004/ACM SIGKDD, 2004. [48] R. Dass and A. Mahanti, “h1-max: A Domain Independent Heuristic for Real-Time Frequent Pattern Mining,” 2005. [49] A. Mahanti and K. Ray, “Heuristic search in networks with modifiable estimate,” in ACM Conference on Computer Science, 1987, pp. 166–174. [50] S. Mandal, D. Saha, and A. Mahanti, “Heuristic search techniques for cell to switch assignment in location area planning for cellular networks,” in Communications, 2004 IEEE International Conference on, 2004, vol. 7, pp. 4307–4311 Vol. 7. [51] A. Mahanti and C. J. Daniels, “IDPS: a massively parallel heuristic search algorithm,” in Parallel Processing Symposium, 1992. Proceedings., Sixth International, 1992, pp. 220–223. [52] R. Dass and A. Mahanti, “Implementing BDFS (b) with diff-sets for real-time frequent pattern mining in dense datasets-first findings,” in Ubiquitous Data Management, 2005. UDM 2005. International Workshop on, 2005, pp. 113–120. [53] S. Ray and A. Mahanti, “Improving Prediction Accuracy in Trust-Aware Recommender Systems,” in System Sciences (HICSS), 2010 43rd Hawaii International Conference on, 2010, pp. 1–9. [54] S. Ghosh, A. Mahanti, and D. S. Nau, “Improving the efficiency of limited-memory heuristic search,” 1998. [55] A. Mukhopadhyay, D. Saha, A. Mahanti, B. B. Chakrabarti, and A. Podder, “Insurance for cyber-risk: A Utility Model,” Decision, 32 (1), pp. 153–169, 2005. [56] A. Mukhopadhyay, S. Chatterjee, R. Roy, D. Saha, A. Mahanti, and S. K. Sadhukhan, “Insuring big losses due to security breaches through insurance: A business model,” in System Sciences, 2007. HICSS 2007. 40th Annual Hawaii International Conference on, 2007, p. 158a–158a. [57] S. Ghosh, A. Mahanti, and D. S. Nau, “ITS: An Efficient Limited-Memory Heuristic Tree Search Algorithm,” Proc. of AAAI-94, Menlo Park, California, USA, pp. 1353–1358, 1994. [58] S. Ghosh, A. Mahanti, R. Nagi, and D. S. Nau, “Manufacturing cell formation by state-space search,” Annals of Operations Research, vol. 65, no. 1, pp. 35–54, 1996. [59] A. Mahanti, C. J. Daniels, S. Ghosh, M. Evett, and A. Pal, “Massively Parallel Heuristic Search for Approximate Optimization Problems,” in Proceedings of the Sixth Conference of Distributed Memory Computing Conference, 1991, pp. 339–346. [60] A. Mukhopadhyay, S. Chatterjee, D. Saha, A. Mahanti, B. B. Chakrabarti, and A. K. Podder, “Mitigating Security breach losses in e-commerce through Insurance,” Proceedings of 4th Security Conference, Las Vegas, Nevada, 2005. [61] S. Perumal and A. Mahanti, “MSCWV: Cyclic Workflow Verification Algorithm for Workflow Graphs,” 2007 BPM and Workflow Handbook, p. 223, 2007. [62] A. Mahanti and K. Ray, “Network Search Algorithms with Modifiable Heuristic,” in Search in AI, USA: Springer, 1988, pp. 200–222. [63] A. Mahanti and K. Ray, “Network Search with Inadmissible Heuristics,” Narosa Publishing, pp. 441–450, 1989. [64] A. Mahanti, S. Ghosh, D. S. Nau, A. K. Pal, and L. N. Kanal, “On the asymptotic optimality of IDA,” 1992. [65] A. Mahanti, S. Ghosh, D. S. Nau, A. K. Pal, and L. N. Kanal, “On the asymptotic performance of IDA*,” Annals of Mathematics and Artificial Intelligence, vol. 20, no. 1, pp. 161–193, 1997. [66] P. Saha, N. Parameswaran, P. Ray, and A. Mahanti, “Ontology Based Modeling for Information Security Management,” in Dependable, Autonomic and Secure Computing (DASC), 2011 IEEE Ninth International Conference on, 2011, pp. 73–80. [67] P. Saha, N. Parameswaran, P. Ray, and A. Mahanti, “Ontology Based Modelling for Information Security Management,” presented at the 9th IEEE International Conference on Dependable, Autonomic and Secure Computing, 2011. [68] P. Saha and A. Mahanti, “Ontology Based Multi Agent Modelling for Information Security Measurement,” in IT Security Governance Innovations:Theory and Research, Hershey, Pennsylvania: IGI Global, 2012, pp. 225–255. [69] A. Mahanti, A. K. Pal, and L. Davis, “Performance of A under inadmissible heuristics—a probabilistic analysis,” 1990. [70] A. Mahanti, A. K. Pal, S. Ghosh, L. N. Kanal, and D. S. Nau, “Performance of A* and IDA*-a worst case analysis,” in Applied Computing, 1991.,[Proceedings of the 1991] Symposium on, 1991, p. 123. [71] A. Mahanti, S. Ghosh, D. S. Nau, L. N. Kanal, and A. K. Pal, “Performance of IDA on Trees and Graphs,” PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, pp. 539–539, 1992. [72] M. Evett, J. Hendler, A. Mahanti, and D. Nau, “PRA*: A memory-limited heuristic search procedure for the connection machine,” in Frontiers of Massively Parallel Computation, 1990. Proceedings., 3rd Symposium on the, 1990, pp. 145–149. [73] M. Evett, J. Hendler, A. Mahanti, and D. Nau, “PRA*: Massively parallel heuristic search,” Journal of Parallel and Distributed Computing, vol. 25, no. 2, pp. 133–143, 1995. [74] J. Hendler, D. Nau, M. Evett, and A. Mahanti, PRA: Massively Parallel Heuristic Search. MARYLAND UNIV COLLEGE PARK SYSTEMS RESEARCH CENTER, 1991. [75] S. Ghose and A. Mahanti, “Search Algorithms for AND/OR Graphs with Cycles,” Working Paper, WPS-295/97, Tndian Tnstitltue of Management Calcutta, 1997. [76] A. Bagchi and A. Mahanti, “Search algorithms under different kinds of heuristics—A comparative study,” Journal of the ACM (JACM), vol. 30, no. 1, pp. 1–21, 1983. [77] S. Mandal, D. Saha, S. Bera, S. Ray, and A. Mahanti, “Session VII-Optical Networking-An Efficient Technique for Dynamic Lightpath Establishment in Survivable Local/Metro WDM Optical Networks,” Lecture Notes in Computer Science, vol. 2918, pp. 350–360, 2003. [78] A. Mahanti and C. J. Daniels, “Simd parallel heuristic search,” 1991. [79] S. Ray and A. Mahanti, “Strategies for effective shilling attacks against recommender systems,” Privacy, Security, and Trust in KDD, pp. 111–125, 2009. [80] A. Bagchi and A. Mahanti, “Three approaches to heuristic search in networks,” Journal of the ACM (JACM), vol. 32, no. 1, pp. 1–27, 1985. [81] A. Mukhopadhyay, S. Chatterjee, D. Saha, A. Mahanti, and S. K. Sadhukhan, “Tiered Approach for Mitigating Big Security Losses: A Variance Reduction Model,” in AMCIS’07, 2007, pp. 260–260. [82] P. Chakraborty, S. Ray, and A. Mahanti, “USE OF TAGS IN RECOMMENDER SYSTEMS: A SURVEY.” [83] S. Ray and A. Mahanti, “Weighted class based hybrid algorithm for top-N recommender systems,” in Proceedings of the 26th IASTED International Conference on Artificial Intelligence and Applications, 2008, pp. 245–251.
Research Interests: 
Artificial Intelligence Heuristic Search Techniques Business Intelligence Cloud Computing Recommender Systems Ontology Based Compliance Risk Management