Automatic Resolver Group Assignment of IT Service Desk Outsourcing
|
|
|
- Millicent Atkinson
- 10 years ago
- Views:
Transcription
1 Automatic Resolver Group Assignment of IT Service Desk Outsourcing in Banking Business Padej Phomasakha Na Sakolnakorn*, Phayung Meesad ** and Gareth Clayton*** Abstract This paper proposes a framework of automatic resolver group assignments of IT service desk outsourcing in banking firms. Recently, service desk technologies have not addressed the problem of performance in resolving incidents dropped due to overwhelming reassignments. This article makes two contributions: (1) data preparation procedures proposed for text mining discovery algorithms; and (2) rule generation from data based on decision tree procedures proposed for knowledge acquisition. In the experiments, we acquired the incident dataset from Tivoli CTI system as text documents and then conducted data pre-processing, data transforming, decision-tree-from-text mining, and decision-tree-to-rules generation. The method of model was validated using the test dataset by the 10-fold cross validation technique. The experimental results indicated that ID3 method could correctly assign jobs to the right group based on the incidents documents in text or typing keywords. Furthermore, the rules resulting from the rule generation from the decision tree could be properly kept in a knowledge database in order to support and assist with future assignments. Keywords: text mining, decision tree, automatic resolver group assignment, service desk, and outsourcing. 1. Introduction Beyond the rapid change in technology and competition among the banks in Thailand, therefore, they need to reduce costs and to improve their quality of services by strategic IT outsourcing. The IT outsourcings are understood as a process in which certain service providers, external to organizations, take over IT functions formerly conducted within the boundaries of the firm [1], [2]. In the IT outsourcing, the IT service desk is an important function of incident management driven by alignment with the business objectives of the enterprise that requires IT support, balancing their operations and achieving desired service level targets. By the case study of knowledge management systems applied to IT service desk outsourcing in the bank, it appears that the IT service desk outsourcing s role is not quite a single point of contact [3]. The bank takes ownership of the help desk agents called first level support (FLS) which acts an interface for internal users and external customers. Thus, the IT service desk as a second level support (SLS) will resolve the assigned incidents from the FLS by ensuring that the incident is in the outsourcing scope and still owned, tracked, and monitored throughout its life cycle. The service desk technology of computer telephony integration (CTI) has not been focusing and supporting automatic resolver group assignment. The assignment is still performed manually by IT service desk agents. The problem is there may be a mistake in assigning a resolver group to deal with the incident due to human errors. This problem of incorrect resolver group assignment will be resolved by means of the automatic assignment approach. 2. R elated works 2.1 Decision support system In the past decade, contributions of decision support systems for resource assignments have been proposed in several areas. In R&D project selection, Sun [5] presented a hybrid knowledge and model approach which integrated mathematical decision models for the assignment of external reviewers to R&D project proposals. The purpose of the model was to assign the most appropriate expert to relevant proposals. Before the research above, Fan [6] proposed a decision support system for proposal grouping, which is a hybrid approach for proposal grouping, in which knowledge rules were designed to deal with proposal identification and proposal classification, and a genetic algorithm was used to search for the expected groupings. Next was a decision support system for multiattribute utility evaluation based on imprecise assignments was proposed by Jiménez [7]. The paper describes a decision support system based on an additive or multiplicative multiattribute utility model for identifying the optimal strategy. Last but not least, in research for a rule-based system of automatic assignment of technicians to service faults, Lazarov and Shoval [8] presented a model and prototype system for the assignment of technicians to handle computer faults. Selection of the technician most suited to deal with the reported failure was based on the assignment rules which are correlations between the nature of the fault and the technicians skills. The model was evaluated using simulation tests, comparing the results of the model assignment process against assignment carried out by experts. The results showed that the system s assignments were better than the experts. * Department of Information Technology, Faculty of Information Technology, KMUTNB ** Department of Teacher Training in Electrical Engineering, Faculty of Technical Education, KMUTNB *** Department of Applied Statistics, Faculty of Applied Science, KMUTNB»Õ Õè 4 ºÑº Õè 7 Á ÃÒ Á - ÁÔ Ø¹Ò¹ 2551 ÇÒÃÊÒÃà â¹âåâõêòãê¹à È 73
2 For the technologies regarding service desk, many organizations have focused on computer telephony integration (CTI). The basis of CTI is to integrate computers and telephones so that they can work together seamlessly and intelligently [9]. The major hardware technologies are as follows: automatic call distributor (ACD), voice response unit (VRU), interactive voice response unit (IVR), predictive dialing, headsets, and reader bounds [10]. These technologies are used to make the existing process more efficient by focusing on minimizing the agent s idle time [11]. These technologies do not address the problem of resolving performance dropped due to incorrect assignments. Incorrect assignment is still taking place because of human errors, because the assignment of resolver group to deal with the incident is performed manually by IT service desk agents. In fact, technologies for the service desk management do not focus on automatic assignment, although the ITIL framework guides the IT service desk outsourcing to resolve incidents by putting in place the best practice processes for IT service desk decision making regarding assignment and reassignment. In this paper, we propose a model for automatic resolver group assignment which is based on text mining discovery algorithms, and implementing the optimal algorithm in the model as well as validating the selected method of the model. 2.2 Methods A decision tree is a simple structure where a tree in which each branch node represents a choice between a number of alternatives, and each leaf node represents a classification or decision. The ordinary tree consists of one root, branches, nodes (places where branches are divided), and leaves. In the same way, the decision tree consists of nodes, which stand for circles or cones, the branches stand for segments connecting the nodes [12]. The decision tree algorithms can be applied to solve the problem under discussion. The decision trees also represent a supervised approach to classification. In this case, we used several decision trees including ID3, J48, NBTree, Random Forest, Random Tree, and REPTtree. The below are brief descriptions of various decision tree methods. An ID3 [13] has been found to construct simple decision trees and can be described using the information gain criterion. It splits the data in two parts. The exact criterion is determined by examining the entropy of the two subsets. The split results in the largest information gain or decrease entropy. J48 [13], [14] classifier generates an unpruned or a pruned C4.5 decision tree with slightly modified C4.5. The decision is grown using depth-first strategy. The algorithm considers all the possible tests that can split the data set and selects a test that gives the best information gain. The naïve Bayesian tree learner, NBTree [15], combines naïve Bayesian classification and decision tree learning. In NBTree, a local naïve Bayes is deployed on each leaf of a traditional decision tree, and an instance is classified using the local naive Bayes on the leaf into which it falls. A random forest [16] is an ensemble of unpruned classification or regression trees, induced from bootstrap samples of the training data, using random feature selection in the tree induction process. Prediction is done by aggregating (majority vote for classification or averaging for regression) the predictions of the ensemble. A random tree is a tree drawn at random from a set of possible trees. The random means that each tree in the set of trees has an equal chance of being sampled. Another way of saying this is that the distribution of trees is uniform. Random trees can be generated efficiently and the combination of large sets of random trees leads to accurate models. REPTree [4] is a fast decision tree learner that builds a decision tree using information gain as the splitting criterion, and prunes it using reduced-error pruning. It only sorts values for numeric attributes once. Missing values are dealt with using the C4.5 s method of using fractional instances. 2.3 Evaluation of classification trees The evaluation of classification trees commonly uses 10- fold smooth out cross-validation [15] for estimation. The 10- fold cross-validation which is helpful in preventing overfitting. The cross-validation process is repeated 10 times, with 10 subsets of equal size, training on nine datasets and testing on one dataset and then used exactly one which mean is accuracy. 2.4 Text mining Text mining is data mining applied to information extracted from text. It can be broadly defined as a knowledge-intensive process in which a user interacts with a document collection over time by using a suite of analysis tools [17]. A text mining handbook written by Feldman and Sanger [17] presents a comprehensive discussion of text mining and links detection algorithms and their operations. 3. The Proposed Framework This section are to describe IT service desk outsourcing functions in terms of business understanding and technology usages, a sample of incident dataset and correlation of system type failures and resolver groups, and to illustrate the framework of automatic resolver group assignment. 3.1 IT service desk outsourcing IT service desk is a cruial function of an IT outsourcing provider who takes over IT functions from the bank. However, the bank desires service level targets based on the service level agreement (SLA) to control the IT service desk operations [18]. The purpose of the IT service desk outsourcing is to support customer services on behalf of the bank s technology driven business goals. The role of the IT service desk is to ensure that IT incident tickets are owned, tracked, and monitored throughout their life cycle. In this case, we study the IT service desk outsourcing of a bank in Thailand. There are three main agent levels for resolving incident end-to-end process. These are (1) First level support, called FLS, which is the Bank help desk agents; (2) Second level support called SLS is IT service desk outsourcing agents; and (3) Third level support called TLS is resolver groups. In this case, we focus on the IT service desk outsourcing, including SLS and TLS. The Tivoli CTI technology is used to interface among the three levels of agents in order to make them work simultaneously on the current ticket to be resolved by the target time. The internal users or external customers directly 74 ÇÒÃÊÒÃà â¹âåâõêòãê¹à È»Õ Õè 4 ºÑº Õè 7 Á ÃÒ Á - ÁÔ Ø¹Ò¹ 2551
3 contact the FLS agents with various incident reports. The incident reports are divided into two types depending upon the IT related that incident. One is Non-IT incident and another type is IT incident. Both are reported to FLS agents and then the agents review the reports in terms of incident types, initiate severity, complete necessary incident descriptions and then open the ticket one-by-one without recurring. The Non-IT incident tickets are resolved by bank s resolvers while IT incident tickets are assigned to the IT service desk outsourcing or SLS agents to resolve those incidents. Thus, the SLS agents review and validate the assigned IT incident ticket for adequacy and correctness based on outsourcing scope, incident types, and severity criteria. If the assignment is not correct both of FLS and SLS will be requested to solve the issue. The valid IT incident ticket may be resolved by the SLS agents using knowledge management system [3] or be assigned to the TLS to resolve the incident. TLS agents include five main resolver groups; (1) EOS (Enterprise Operation Support), (2) IE-AMS (Application Management Support), (3) NWS (Network Management Support), (4) OS-EC (Electrical Operating Support), and (5) VEN (Vendor). In this case, we improve IT service desk outsourcing s roles by proposing the model of automatic resolver group assignment. Figure 1 shows the framework of IT service desk outsourcing with automatic assignment. 3.2 Sample Raw datasets are provided by the Tivoli system in a spreadsheet for 14,440 cases. They were collected for 4-months (April to July as shown in Appendix A, Figure A-1). Each column (or attributes) contains information about incident records. However, in this study, we focus on the information of four columns: incident descriptions, system-type failures, component failures, and the assigned resolver groups who are related to those system-type failures, since the objective of this paper is a text mining discovery methods to automatic assignment approach. Table 1 shows the number of incidents of various system types and resolver groups. Table 1. The number of incidents of system-type failures and resolver System-Type Failures EOS IE-MS NWS OS-EC VEN Hardware 0 0 5,605 1, Software , Network ,120 Operation Power Supply Users / Customers Bank Help Desk Agents First Level Support called FLS Non-IT incidents Bank s Resolver All incidents IT incidents IT Service Desk Agents Second Level Support called SLS Knowledge Database Domain Expert Validate resolutions and rules IT Service Desk Outsourcing Automatic Resolver Group Assignment Generated rules Provided resolutions Resolver Groups Third Level Support called TLS Resolver Groups: 1) EOS 2) IE-AMS 3) NWS 4) OS-EC 5) VEN 3.3 Data preparation and method discovery The raw dataset contains structured information about incident cases as previously described in Section 3.2. Figure 2 shows data preparation procedure for text mining discovery algorithms. Raw Text Documents (Incident Records) 1. Data Preparation 2. Document Collection (Text Corpus) 4. Text Measures 3. Divide data for training and testing Figure 1. The model for IT service desk outsourcing with automatic resolver group assignment. 5. Method Selection Training Document (1) (2) For the reason that the bank is already deploying strategies to improve the quality of IT services and reduce service delivery cost using some combination of outsourcing and internal process improvements as well as technology. Therefore, CTI technology and ITIL best practice frameworks are applied to the bank s and the outsourcing s functions. CTI technology such as Tivoli can help several agents working simultaneously and comfortably in tracking an incident through its life, the selection of the suitable resolver group to deal with that incident is still performed manually by IT service desk agents. However, the issue of incorrect assignment is still taking place. Another issue from the IT expert is that a one-to-one assignment may not help the ticket close completely, since one ticket may need more than one resolver. Assigned Group 1 6. Method Evaluation Assigned Group Assigned Group 5 Testing Document Figure 2. Data preparation procedure for text mining discovery algorithms. For the model approach, we use the following six steps: 1) Data preparation with text documents of incident records; 2) Document collection or Text corpus; 3) Data divided for training documents and test documents; 4) Text measurement; 5) Method selection based on the training documents; and 6) Model validation based on the test documents.»õ Õè 4 ºÑº Õè 7 Á ÃÒ Á - ÁÔ Ø¹Ò¹ 2551 ÇÒÃÊÒÃà â¹âåâõêòãê¹à È 75
4 3.3.1 Data preparation Data preparation processes include data recognition, parsing, filtering, data cleansing [19], and transformation. In this case, we add data grouping by keywords. Hence, in this case, the data preparation processes are as follows: (a) Data Recognition: identify the incident records collected from Tivoli CTI system as the sample of raw structured data in spreadsheet format. (b) Data parsing: the purpose of data parsing is to resolve a sentence into its component parts of speech. We created another keyword dictionary and modify the program to execute both of a standard dictionary and the modified dictionary. (c) Data filtering: involves selecting rows and columns of data for further document collection or text corpus. Consequently, the text corpus includes several columns, including system failure types, sub-system or component failures, incident descriptions, and assigned resolver group. (d) Data cleaning: correct inconsistent data, checking to see the data conform across its columns and filling in missing values in particular for the component failures and assigned resolver groups. (e) Data grouping: from the word extraction obtain a lot of words and then grouped them into the words of component and system-type failures. (f) Data transformation: we transformed data prior to data analysis. Several steps need data transformation such as word extraction, text measurement, text mining via WEKA[4] and machine learning, which is applied to discover algorithms or methods, comparing several decision tree algorithms to find out the most suitable method for the nature of incident data Data separation The sample dataset is divided into two document sets, (1) A training document consisting of 66% of the samples and (2) A test document set consisting of 34% of the cases Document collection Document collection or so called Text corpus is the database containing text fields, which includes a sample of data. The data is a subset of the incident database. The textual fields are selected columns such as system type failures, component failures, incident descriptions, and assigned resolver group [20] Text measures The purpose of text measures is to find attributes that describe text in order to know how many keywords (KW 1, KW 2,, KW n, where n is the number of words) related to the assigned groups are in the documents. We developed a program that provides text measures based upon word counts across the sample of the text documents. It displays the text measures Method selection Method discovery is the core of text mining algorithms. Several decision tree methods; ID3, J48, NBTree, random forest, random tree, and REP Tree were implemented within the WEKA framework based upon the training dataset. The ID3 decision tree method was found to be the strongest method for the nature of that dataset Method evaluation We propose an ID3-based model for the automatic resolver group assignment. In order to validate the model, we implemented ID3 within the WEKA based on the test dataset. 4. Experimental Results In this section, we divide the results into two parts, including: (1) the comparison results; and (2) method evaluation. The experimental results are as follows: 4.1 Comparison results We conducted experiments to compare various decision tree algorithms within the WEKA framework. Based on the 66% of the sample dataset of 9,530 records, we used classified implementation of random tree, random forest, ID3, J48, NBTree, and REPTree by using 10-fold cross validation, which is to prevent overfitting. Table 2 shows the number of correct Table 2. The number and percentage of correct incidents for various types of decision trees Decision Tree classifiers No. of Correct Instances No. of Incorrect Instances Accuracy of Classification (%) ID Random tree Random forest J NBTree REPTree Method evaluation To validate the Decision Tree-based model, the test data by default value 10-fold cross validation within WEKA platform were used. The test dataset is randomly selecting from 34% of the sample dataset for 4,910 cases. In addition, the IT experts who participate in the experiments also validated the result of validation. The results show the accuracy assignment was % of the cases, which indicates the ID3 method is significantly suited for the model of decision support system for automatic resolution of group assignment. 4.3 Rule Generation results A rule generation from the testing dataset based on ID3 decision tree method are shown in Figure 3 and Figure 4. Figure 3. An Extended parts of the results of ID3 76 ÇÒÃÊÒÃà â¹âåâõêòãê¹à È»Õ Õè 4 ºÑº Õè 7 Á ÃÒ Á - ÁÔ Ø¹Ò¹ 2551
5 Figure 4. Rule Table and Rule Generation from ID3. 5. Conclusion This article makes two contributions. Firstly, data preparation procedures proposed for text mining discovery algorithms. Secondly, the rule generation from data based on decision tree procedures proposed for knowledge acquisition. The comparison of several decision tree methods gave an ID3 decision tree is the strongest algorithm. It yielded correctively classified instance more than 93% of the cases. The proposed ID3-Based model for automatic resolver group assignment of IT service desk outsourcing in the bank. The method was validated based on the training dataset with 10-fold crossvalidation and the accuracy of the results of the method was 93.54% of the cases. The experimental results indicate that the ID3 method is the optimal method to provide the model with automatic resolver group assignment that would significantly increasing productivity in terms of more assignments that are correct and thus decrease reassignment turnaround time. Furthermore, the results of the generated decision tree patterns by the methods that could also be kept in knowledge database in order to support and assist with future incident resolver assignments For the future work, an ID3 decision tree method is suitable for automatic resolver group assignments based on dataset of IT outsourcing in the bank firm. The application of decision support system and automatic resolve group assignments should be developed based on the method. 6. Acknowledgment The authors thank the Science and Technology Research Institute of King Mongut s University of Technology North Bangkok for financial support, and NECTEC (National Electronic Computer Technology Center) for modified word extraction program support. 7. References [1] M. H. Grote, and F. A. Täube, When outsourcing is not an option: International relocation of investment bank research-or isn t it?, Journal of International Management, vol.13, no.1, pp , [2] V. Mahnke, et al., Strategic outsourcing of IT services: theoretical stocktaking and empirical challenges, Industry and Innovation, vol. 12, no. 2, pp , [3] P. Phomasakha, and P. Meesad, Knowledge Management System with Root Cause Analysis for IT Service Desk in Banking Business, Proceedings of the 2007 Electrical Engineering/Electronics, vol. 2, pp , [4] I. Witten, and E. Frank, Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations, Morgan Kaufmann, ed. 2, [5] Y. H. Sun, et al., A hybrid knowledge and model approach for reviewer assignment, Expert Systems with Applications, vol. 34, no.2, pp , [6] Z.-P. Fan, etal. Decision support for proposal grouping: A hybrid approach using knowledge rule and genetic algorithm, Elsevier, Expert Systems with Applications, [7] A. Jiménez, et al., A decision support system for multiattribute utility evaluation based on imprecise assignments, Elsevier, Decision Support Systems, vol. 36, no.1, pp , [8] A. Lazarov, and P. Shoval, A rule-based system for automatic assignment of technicians to service faults, Elsevier, Decision Support Systems, vol. 32, pp , [9] B. Cleveland, J. Mayben, Call Center Management on Fast Forward: Succeeding Today s Dynamic Inbound environment, Call Center Press, Maryland, [10] Anton, J., Gusting, D, Call Center Benchmarking: How Good Is Good Enough, Purdue University Press, Indiana, [11] L. M. Gonza lez, et al., Knowledge management-centric help desk specification and performance evaluation, Elsevier, Decision Support Systems, vol. 40, pp , [12] Y. Zhao, and Y. Zhang, Comparison of decision tree model of finding active objects, Advances in Space Research, [13] J. R. Quinlan, Induction of Decision Trees. Readings in Machine Learning, Morgan Kaufmann, ed.1, [14] T. M. Mitchell, Machine Learning, McGraw-Hill, [15] R. Kohavi, A study of cross-validation and bootstrap for accuracy estimation and model selection, Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, vol. 2, no. 2, pp , [16] L. Breiman, Random Forests, Springer, Machine Learning, vol. 45, no.1, pp. 5-32, [17] R. Feldman, and J. Sanger, The Text Mining Book: Advanced Approaches in Analysing Unstructured Data, Cambridge University Press, [18] N. Frey, et al., A Guide to Successful SLA Development and Management, Gartner Group Research, Strategic Analysis Report, [19] T.W. Miller, Data Text Mining: A business applications approach, Prentice Hall, [20] Liu Y., et al. Handling of Imbalanced Data in Text Classification: Category-Based Term Weights, Springer, Natural Language Processing and Text Mining, 2007.»Õ Õè 4 ºÑº Õè 7 Á ÃÒ Á - ÁÔ Ø¹Ò¹ 2551 ÇÒÃÊÒÃà â¹âåâõêòãê¹à È 77
6 Appendix A Figure A-1 shows a sample of incident dataset in spreadsheet. Research Paper : Automatic Resolver Group Assignment of IT Service Desk Outsourcing Figure A-1. A sample of incident dataset. 78 ÇÒÃÊÒÃà â¹âåâõêòãê¹à È»Õ Õè 4 ºÑº Õè 7 Á ÃÒ Á - ÁÔ Ø¹Ò¹ 2551
Decision Tree-Based Model for Automatic Assignment of IT Service Desk Outsourcing in Banking Business
Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing Decision Tree-Based Model for Automatic Assignment of IT Service Desk
Decision Trees from large Databases: SLIQ
Decision Trees from large Databases: SLIQ C4.5 often iterates over the training set How often? If the training set does not fit into main memory, swapping makes C4.5 unpractical! SLIQ: Sort the values
Decision Tree Learning on Very Large Data Sets
Decision Tree Learning on Very Large Data Sets Lawrence O. Hall Nitesh Chawla and Kevin W. Bowyer Department of Computer Science and Engineering ENB 8 University of South Florida 4202 E. Fowler Ave. Tampa
DECISION TREE INDUCTION FOR FINANCIAL FRAUD DETECTION USING ENSEMBLE LEARNING TECHNIQUES
DECISION TREE INDUCTION FOR FINANCIAL FRAUD DETECTION USING ENSEMBLE LEARNING TECHNIQUES Vijayalakshmi Mahanra Rao 1, Yashwant Prasad Singh 2 Multimedia University, Cyberjaya, MALAYSIA 1 [email protected]
Experiments in Web Page Classification for Semantic Web
Experiments in Web Page Classification for Semantic Web Asad Satti, Nick Cercone, Vlado Kešelj Faculty of Computer Science, Dalhousie University E-mail: {rashid,nick,vlado}@cs.dal.ca Abstract We address
BOOSTING - A METHOD FOR IMPROVING THE ACCURACY OF PREDICTIVE MODEL
The Fifth International Conference on e-learning (elearning-2014), 22-23 September 2014, Belgrade, Serbia BOOSTING - A METHOD FOR IMPROVING THE ACCURACY OF PREDICTIVE MODEL SNJEŽANA MILINKOVIĆ University
Studying Auto Insurance Data
Studying Auto Insurance Data Ashutosh Nandeshwar February 23, 2010 1 Introduction To study auto insurance data using traditional and non-traditional tools, I downloaded a well-studied data from http://www.statsci.org/data/general/motorins.
Data Mining. Nonlinear Classification
Data Mining Unit # 6 Sajjad Haider Fall 2014 1 Nonlinear Classification Classes may not be separable by a linear boundary Suppose we randomly generate a data set as follows: X has range between 0 to 15
Predicting Student Performance by Using Data Mining Methods for Classification
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 13, No 1 Sofia 2013 Print ISSN: 1311-9702; Online ISSN: 1314-4081 DOI: 10.2478/cait-2013-0006 Predicting Student Performance
A NEW DECISION TREE METHOD FOR DATA MINING IN MEDICINE
A NEW DECISION TREE METHOD FOR DATA MINING IN MEDICINE Kasra Madadipouya 1 1 Department of Computing and Science, Asia Pacific University of Technology & Innovation ABSTRACT Today, enormous amount of data
Knowledge Discovery and Data Mining
Knowledge Discovery and Data Mining Unit # 11 Sajjad Haider Fall 2013 1 Supervised Learning Process Data Collection/Preparation Data Cleaning Discretization Supervised/Unuspervised Identification of right
Analysis of WEKA Data Mining Algorithm REPTree, Simple Cart and RandomTree for Classification of Indian News
Analysis of WEKA Data Mining Algorithm REPTree, Simple Cart and RandomTree for Classification of Indian News Sushilkumar Kalmegh Associate Professor, Department of Computer Science, Sant Gadge Baba Amravati
ANALYSIS OF FEATURE SELECTION WITH CLASSFICATION: BREAST CANCER DATASETS
ANALYSIS OF FEATURE SELECTION WITH CLASSFICATION: BREAST CANCER DATASETS Abstract D.Lavanya * Department of Computer Science, Sri Padmavathi Mahila University Tirupati, Andhra Pradesh, 517501, India [email protected]
IDENTIFYING BANK FRAUDS USING CRISP-DM AND DECISION TREES
IDENTIFYING BANK FRAUDS USING CRISP-DM AND DECISION TREES Bruno Carneiro da Rocha 1,2 and Rafael Timóteo de Sousa Júnior 2 1 Bank of Brazil, Brasília-DF, Brazil [email protected] 2 Network Engineering
Getting Even More Out of Ensemble Selection
Getting Even More Out of Ensemble Selection Quan Sun Department of Computer Science The University of Waikato Hamilton, New Zealand [email protected] ABSTRACT Ensemble Selection uses forward stepwise
ENSEMBLE DECISION TREE CLASSIFIER FOR BREAST CANCER DATA
ENSEMBLE DECISION TREE CLASSIFIER FOR BREAST CANCER DATA D.Lavanya 1 and Dr.K.Usha Rani 2 1 Research Scholar, Department of Computer Science, Sree Padmavathi Mahila Visvavidyalayam, Tirupati, Andhra Pradesh,
Data Mining Practical Machine Learning Tools and Techniques
Ensemble learning Data Mining Practical Machine Learning Tools and Techniques Slides for Chapter 8 of Data Mining by I. H. Witten, E. Frank and M. A. Hall Combining multiple models Bagging The basic idea
Comparison of Data Mining Techniques used for Financial Data Analysis
Comparison of Data Mining Techniques used for Financial Data Analysis Abhijit A. Sawant 1, P. M. Chawan 2 1 Student, 2 Associate Professor, Department of Computer Technology, VJTI, Mumbai, INDIA Abstract
Extension of Decision Tree Algorithm for Stream Data Mining Using Real Data
Fifth International Workshop on Computational Intelligence & Applications IEEE SMC Hiroshima Chapter, Hiroshima University, Japan, November 10, 11 & 12, 2009 Extension of Decision Tree Algorithm for Stream
Evaluating Data Mining Models: A Pattern Language
Evaluating Data Mining Models: A Pattern Language Jerffeson Souza Stan Matwin Nathalie Japkowicz School of Information Technology and Engineering University of Ottawa K1N 6N5, Canada {jsouza,stan,nat}@site.uottawa.ca
Data Mining Framework for Direct Marketing: A Case Study of Bank Marketing
www.ijcsi.org 198 Data Mining Framework for Direct Marketing: A Case Study of Bank Marketing Lilian Sing oei 1 and Jiayang Wang 2 1 School of Information Science and Engineering, Central South University
TOWARDS SIMPLE, EASY TO UNDERSTAND, AN INTERACTIVE DECISION TREE ALGORITHM
TOWARDS SIMPLE, EASY TO UNDERSTAND, AN INTERACTIVE DECISION TREE ALGORITHM Thanh-Nghi Do College of Information Technology, Cantho University 1 Ly Tu Trong Street, Ninh Kieu District Cantho City, Vietnam
An Introduction to Data Mining. Big Data World. Related Fields and Disciplines. What is Data Mining? 2/12/2015
An Introduction to Data Mining for Wind Power Management Spring 2015 Big Data World Every minute: Google receives over 4 million search queries Facebook users share almost 2.5 million pieces of content
How To Solve The Kd Cup 2010 Challenge
A Lightweight Solution to the Educational Data Mining Challenge Kun Liu Yan Xing Faculty of Automation Guangdong University of Technology Guangzhou, 510090, China [email protected] [email protected]
REVIEW OF ENSEMBLE CLASSIFICATION
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320 088X IJCSMC, Vol. 2, Issue.
Chapter 6. The stacking ensemble approach
82 This chapter proposes the stacking ensemble approach for combining different data mining classifiers to get better performance. Other combination techniques like voting, bagging etc are also described
Data Mining Classification: Decision Trees
Data Mining Classification: Decision Trees Classification Decision Trees: what they are and how they work Hunt s (TDIDT) algorithm How to select the best split How to handle Inconsistent data Continuous
Data Mining - Evaluation of Classifiers
Data Mining - Evaluation of Classifiers Lecturer: JERZY STEFANOWSKI Institute of Computing Sciences Poznan University of Technology Poznan, Poland Lecture 4 SE Master Course 2008/2009 revised for 2010
Data quality in Accounting Information Systems
Data quality in Accounting Information Systems Comparing Several Data Mining Techniques Erjon Zoto Department of Statistics and Applied Informatics Faculty of Economy, University of Tirana Tirana, Albania
CI6227: Data Mining. Lesson 11b: Ensemble Learning. Data Analytics Department, Institute for Infocomm Research, A*STAR, Singapore.
CI6227: Data Mining Lesson 11b: Ensemble Learning Sinno Jialin PAN Data Analytics Department, Institute for Infocomm Research, A*STAR, Singapore Acknowledgements: slides are adapted from the lecture notes
Introducing diversity among the models of multi-label classification ensemble
Introducing diversity among the models of multi-label classification ensemble Lena Chekina, Lior Rokach and Bracha Shapira Ben-Gurion University of the Negev Dept. of Information Systems Engineering and
Predicting borrowers chance of defaulting on credit loans
Predicting borrowers chance of defaulting on credit loans Junjie Liang ([email protected]) Abstract Credit score prediction is of great interests to banks as the outcome of the prediction algorithm
Fine Particulate Matter Concentration Level Prediction by using Tree-based Ensemble Classification Algorithms
Fine Particulate Matter Concentration Level Prediction by using Tree-based Ensemble Classification Algorithms Yin Zhao School of Mathematical Sciences Universiti Sains Malaysia (USM) Penang, Malaysia Yahya
Identifying At-Risk Students Using Machine Learning Techniques: A Case Study with IS 100
Identifying At-Risk Students Using Machine Learning Techniques: A Case Study with IS 100 Erkan Er Abstract In this paper, a model for predicting students performance levels is proposed which employs three
Healthcare Data Mining: Prediction Inpatient Length of Stay
3rd International IEEE Conference Intelligent Systems, September 2006 Healthcare Data Mining: Prediction Inpatient Length of Peng Liu, Lei Lei, Junjie Yin, Wei Zhang, Wu Naijun, Elia El-Darzi 1 Abstract
Feature vs. Classifier Fusion for Predictive Data Mining a Case Study in Pesticide Classification
Feature vs. Classifier Fusion for Predictive Data Mining a Case Study in Pesticide Classification Henrik Boström School of Humanities and Informatics University of Skövde P.O. Box 408, SE-541 28 Skövde
Data Mining Application in Direct Marketing: Identifying Hot Prospects for Banking Product
Data Mining Application in Direct Marketing: Identifying Hot Prospects for Banking Product Sagarika Prusty Web Data Mining (ECT 584),Spring 2013 DePaul University,Chicago [email protected] Keywords:
Mining Direct Marketing Data by Ensembles of Weak Learners and Rough Set Methods
Mining Direct Marketing Data by Ensembles of Weak Learners and Rough Set Methods Jerzy B laszczyński 1, Krzysztof Dembczyński 1, Wojciech Kot lowski 1, and Mariusz Paw lowski 2 1 Institute of Computing
Roulette Sampling for Cost-Sensitive Learning
Roulette Sampling for Cost-Sensitive Learning Victor S. Sheng and Charles X. Ling Department of Computer Science, University of Western Ontario, London, Ontario, Canada N6A 5B7 {ssheng,cling}@csd.uwo.ca
Model Combination. 24 Novembre 2009
Model Combination 24 Novembre 2009 Datamining 1 2009-2010 Plan 1 Principles of model combination 2 Resampling methods Bagging Random Forests Boosting 3 Hybrid methods Stacking Generic algorithm for mulistrategy
Three types of messages: A, B, C. Assume A is the oldest type, and C is the most recent type.
Chronological Sampling for Email Filtering Ching-Lung Fu 2, Daniel Silver 1, and James Blustein 2 1 Acadia University, Wolfville, Nova Scotia, Canada 2 Dalhousie University, Halifax, Nova Scotia, Canada
Data Quality Mining: Employing Classifiers for Assuring consistent Datasets
Data Quality Mining: Employing Classifiers for Assuring consistent Datasets Fabian Grüning Carl von Ossietzky Universität Oldenburg, Germany, [email protected] Abstract: Independent
Overview. Evaluation Connectionist and Statistical Language Processing. Test and Validation Set. Training and Test Set
Overview Evaluation Connectionist and Statistical Language Processing Frank Keller [email protected] Computerlinguistik Universität des Saarlandes training set, validation set, test set holdout, stratification
Predictive Modeling for Collections of Accounts Receivable Sai Zeng IBM T.J. Watson Research Center Hawthorne, NY, 10523. Abstract
Paper Submission for ACM SIGKDD Workshop on Domain Driven Data Mining (DDDM2007) Predictive Modeling for Collections of Accounts Receivable Sai Zeng [email protected] Prem Melville Yorktown Heights, NY,
Web Document Clustering
Web Document Clustering Lab Project based on the MDL clustering suite http://www.cs.ccsu.edu/~markov/mdlclustering/ Zdravko Markov Computer Science Department Central Connecticut State University New Britain,
HYBRID PROBABILITY BASED ENSEMBLES FOR BANKRUPTCY PREDICTION
HYBRID PROBABILITY BASED ENSEMBLES FOR BANKRUPTCY PREDICTION Chihli Hung 1, Jing Hong Chen 2, Stefan Wermter 3, 1,2 Department of Management Information Systems, Chung Yuan Christian University, Taiwan
An Overview of Knowledge Discovery Database and Data mining Techniques
An Overview of Knowledge Discovery Database and Data mining Techniques Priyadharsini.C 1, Dr. Antony Selvadoss Thanamani 2 M.Phil, Department of Computer Science, NGM College, Pollachi, Coimbatore, Tamilnadu,
Impact of Boolean factorization as preprocessing methods for classification of Boolean data
Impact of Boolean factorization as preprocessing methods for classification of Boolean data Radim Belohlavek, Jan Outrata, Martin Trnecka Data Analysis and Modeling Lab (DAMOL) Dept. Computer Science,
Keywords Data mining, Classification Algorithm, Decision tree, J48, Random forest, Random tree, LMT, WEKA 3.7. Fig.1. Data mining techniques.
International Journal of Emerging Research in Management &Technology Research Article October 2015 Comparative Study of Various Decision Tree Classification Algorithm Using WEKA Purva Sewaiwar, Kamal Kant
Evaluating an Integrated Time-Series Data Mining Environment - A Case Study on a Chronic Hepatitis Data Mining -
Evaluating an Integrated Time-Series Data Mining Environment - A Case Study on a Chronic Hepatitis Data Mining - Hidenao Abe, Miho Ohsaki, Hideto Yokoi, and Takahira Yamaguchi Department of Medical Informatics,
Using Data Mining for Mobile Communication Clustering and Characterization
Using Data Mining for Mobile Communication Clustering and Characterization A. Bascacov *, C. Cernazanu ** and M. Marcu ** * Lasting Software, Timisoara, Romania ** Politehnica University of Timisoara/Computer
Network Intrusion Detection Using a HNB Binary Classifier
2015 17th UKSIM-AMSS International Conference on Modelling and Simulation Network Intrusion Detection Using a HNB Binary Classifier Levent Koc and Alan D. Carswell Center for Security Studies, University
EMPIRICAL STUDY ON SELECTION OF TEAM MEMBERS FOR SOFTWARE PROJECTS DATA MINING APPROACH
EMPIRICAL STUDY ON SELECTION OF TEAM MEMBERS FOR SOFTWARE PROJECTS DATA MINING APPROACH SANGITA GUPTA 1, SUMA. V. 2 1 Jain University, Bangalore 2 Dayanada Sagar Institute, Bangalore, India Abstract- One
Data Mining Solutions for the Business Environment
Database Systems Journal vol. IV, no. 4/2013 21 Data Mining Solutions for the Business Environment Ruxandra PETRE University of Economic Studies, Bucharest, Romania [email protected] Over
A Regression Approach for Forecasting Vendor Revenue in Telecommunication Industries
A Regression Approach for Forecasting Vendor Revenue in Telecommunication Industries Aida Mustapha *1, Farhana M. Fadzil #2 * Faculty of Computer Science and Information Technology, Universiti Tun Hussein
Ensemble Methods. Knowledge Discovery and Data Mining 2 (VU) (707.004) Roman Kern. KTI, TU Graz 2015-03-05
Ensemble Methods Knowledge Discovery and Data Mining 2 (VU) (707004) Roman Kern KTI, TU Graz 2015-03-05 Roman Kern (KTI, TU Graz) Ensemble Methods 2015-03-05 1 / 38 Outline 1 Introduction 2 Classification
Knowledge Discovery and Data Mining. Bootstrap review. Bagging Important Concepts. Notes. Lecture 19 - Bagging. Tom Kelsey. Notes
Knowledge Discovery and Data Mining Lecture 19 - Bagging Tom Kelsey School of Computer Science University of St Andrews http://tom.host.cs.st-andrews.ac.uk [email protected] Tom Kelsey ID5059-19-B &
Social Media Mining. Data Mining Essentials
Introduction Data production rate has been increased dramatically (Big Data) and we are able store much more data than before E.g., purchase data, social media data, mobile phone data Businesses and customers
Comparison of K-means and Backpropagation Data Mining Algorithms
Comparison of K-means and Backpropagation Data Mining Algorithms Nitu Mathuriya, Dr. Ashish Bansal Abstract Data mining has got more and more mature as a field of basic research in computer science and
A General Approach to Incorporate Data Quality Matrices into Data Mining Algorithms
A General Approach to Incorporate Data Quality Matrices into Data Mining Algorithms Ian Davidson 1st author's affiliation 1st line of address 2nd line of address Telephone number, incl country code 1st
A Study Of Bagging And Boosting Approaches To Develop Meta-Classifier
A Study Of Bagging And Boosting Approaches To Develop Meta-Classifier G.T. Prasanna Kumari Associate Professor, Dept of Computer Science and Engineering, Gokula Krishna College of Engg, Sullurpet-524121,
DATA MINING TECHNIQUES AND APPLICATIONS
DATA MINING TECHNIQUES AND APPLICATIONS Mrs. Bharati M. Ramageri, Lecturer Modern Institute of Information Technology and Research, Department of Computer Application, Yamunanagar, Nigdi Pune, Maharashtra,
Classification of Learners Using Linear Regression
Proceedings of the Federated Conference on Computer Science and Information Systems pp. 717 721 ISBN 978-83-60810-22-4 Classification of Learners Using Linear Regression Marian Cristian Mihăescu Software
Rule based Classification of BSE Stock Data with Data Mining
International Journal of Information Sciences and Application. ISSN 0974-2255 Volume 4, Number 1 (2012), pp. 1-9 International Research Publication House http://www.irphouse.com Rule based Classification
EFFICIENCY OF DECISION TREES IN PREDICTING STUDENT S ACADEMIC PERFORMANCE
EFFICIENCY OF DECISION TREES IN PREDICTING STUDENT S ACADEMIC PERFORMANCE S. Anupama Kumar 1 and Dr. Vijayalakshmi M.N 2 1 Research Scholar, PRIST University, 1 Assistant Professor, Dept of M.C.A. 2 Associate
Financial Trading System using Combination of Textual and Numerical Data
Financial Trading System using Combination of Textual and Numerical Data Shital N. Dange Computer Science Department, Walchand Institute of Rajesh V. Argiddi Assistant Prof. Computer Science Department,
On the effect of data set size on bias and variance in classification learning
On the effect of data set size on bias and variance in classification learning Abstract Damien Brain Geoffrey I Webb School of Computing and Mathematics Deakin University Geelong Vic 3217 With the advent
D-optimal plans in observational studies
D-optimal plans in observational studies Constanze Pumplün Stefan Rüping Katharina Morik Claus Weihs October 11, 2005 Abstract This paper investigates the use of Design of Experiments in observational
Benchmarking Open-Source Tree Learners in R/RWeka
Benchmarking Open-Source Tree Learners in R/RWeka Michael Schauerhuber 1, Achim Zeileis 1, David Meyer 2, Kurt Hornik 1 Department of Statistics and Mathematics 1 Institute for Management Information Systems
Building A Smart Academic Advising System Using Association Rule Mining
Building A Smart Academic Advising System Using Association Rule Mining Raed Shatnawi +962795285056 [email protected] Qutaibah Althebyan +962796536277 [email protected] Baraq Ghalib & Mohammed
Machine Learning and Data Mining. Fundamentals, robotics, recognition
Machine Learning and Data Mining Fundamentals, robotics, recognition Machine Learning, Data Mining, Knowledge Discovery in Data Bases Their mutual relations Data Mining, Knowledge Discovery in Databases,
Index Contents Page No. Introduction . Data Mining & Knowledge Discovery
Index Contents Page No. 1. Introduction 1 1.1 Related Research 2 1.2 Objective of Research Work 3 1.3 Why Data Mining is Important 3 1.4 Research Methodology 4 1.5 Research Hypothesis 4 1.6 Scope 5 2.
Welcome. Data Mining: Updates in Technologies. Xindong Wu. Colorado School of Mines Golden, Colorado 80401, USA
Welcome Xindong Wu Data Mining: Updates in Technologies Dept of Math and Computer Science Colorado School of Mines Golden, Colorado 80401, USA Email: xwu@ mines.edu Home Page: http://kais.mines.edu/~xwu/
Clustering Connectionist and Statistical Language Processing
Clustering Connectionist and Statistical Language Processing Frank Keller [email protected] Computerlinguistik Universität des Saarlandes Clustering p.1/21 Overview clustering vs. classification supervised
Data Mining. 1 Introduction 2 Data Mining methods. Alfred Holl Data Mining 1
Data Mining 1 Introduction 2 Data Mining methods Alfred Holl Data Mining 1 1 Introduction 1.1 Motivation 1.2 Goals and problems 1.3 Definitions 1.4 Roots 1.5 Data Mining process 1.6 Epistemological constraints
DATA MINING AND REPORTING IN HEALTHCARE
DATA MINING AND REPORTING IN HEALTHCARE Divya Gandhi 1, Pooja Asher 2, Harshada Chaudhari 3 1,2,3 Department of Information Technology, Sardar Patel Institute of Technology, Mumbai,(India) ABSTRACT The
Big Data with Rough Set Using Map- Reduce
Big Data with Rough Set Using Map- Reduce Mr.G.Lenin 1, Mr. A. Raj Ganesh 2, Mr. S. Vanarasan 3 Assistant Professor, Department of CSE, Podhigai College of Engineering & Technology, Tirupattur, Tamilnadu,
arxiv:1301.4944v1 [stat.ml] 21 Jan 2013
Evaluation of a Supervised Learning Approach for Stock Market Operations Marcelo S. Lauretto 1, Bárbara B. C. Silva 1 and Pablo M. Andrade 2 1 EACH USP, 2 IME USP. 1 Introduction arxiv:1301.4944v1 [stat.ml]
Gerry Hobbs, Department of Statistics, West Virginia University
Decision Trees as a Predictive Modeling Method Gerry Hobbs, Department of Statistics, West Virginia University Abstract Predictive modeling has become an important area of interest in tasks such as credit
Beating the MLB Moneyline
Beating the MLB Moneyline Leland Chen [email protected] Andrew He [email protected] 1 Abstract Sports forecasting is a challenging task that has similarities to stock market prediction, requiring time-series
Advanced Ensemble Strategies for Polynomial Models
Advanced Ensemble Strategies for Polynomial Models Pavel Kordík 1, Jan Černý 2 1 Dept. of Computer Science, Faculty of Information Technology, Czech Technical University in Prague, 2 Dept. of Computer
ON INTEGRATING UNSUPERVISED AND SUPERVISED CLASSIFICATION FOR CREDIT RISK EVALUATION
ISSN 9 X INFORMATION TECHNOLOGY AND CONTROL, 00, Vol., No.A ON INTEGRATING UNSUPERVISED AND SUPERVISED CLASSIFICATION FOR CREDIT RISK EVALUATION Danuta Zakrzewska Institute of Computer Science, Technical
Customer Classification And Prediction Based On Data Mining Technique
Customer Classification And Prediction Based On Data Mining Technique Ms. Neethu Baby 1, Mrs. Priyanka L.T 2 1 M.E CSE, Sri Shakthi Institute of Engineering and Technology, Coimbatore 2 Assistant Professor
Insurance Analytics - analýza dat a prediktivní modelování v pojišťovnictví. Pavel Kříž. Seminář z aktuárských věd MFF 4.
Insurance Analytics - analýza dat a prediktivní modelování v pojišťovnictví Pavel Kříž Seminář z aktuárských věd MFF 4. dubna 2014 Summary 1. Application areas of Insurance Analytics 2. Insurance Analytics
DATA PREPARATION FOR DATA MINING
Applied Artificial Intelligence, 17:375 381, 2003 Copyright # 2003 Taylor & Francis 0883-9514/03 $12.00 +.00 DOI: 10.1080/08839510390219264 u DATA PREPARATION FOR DATA MINING SHICHAO ZHANG and CHENGQI
Predicting Students Final GPA Using Decision Trees: A Case Study
Predicting Students Final GPA Using Decision Trees: A Case Study Mashael A. Al-Barrak and Muna Al-Razgan Abstract Educational data mining is the process of applying data mining tools and techniques to
Introduction to Machine Learning and Data Mining. Prof. Dr. Igor Trajkovski [email protected]
Introduction to Machine Learning and Data Mining Prof. Dr. Igor Trajkovski [email protected] Ensembles 2 Learning Ensembles Learn multiple alternative definitions of a concept using different training
Predicting Critical Problems from Execution Logs of a Large-Scale Software System
Predicting Critical Problems from Execution Logs of a Large-Scale Software System Árpád Beszédes, Lajos Jenő Fülöp and Tibor Gyimóthy Department of Software Engineering, University of Szeged Árpád tér
Using Predictive Analysis to Improve Invoice-to-Cash Collection Prem Melville
Sai Zeng IBM T.J. Watson Research Center Hawthorne, NY, 10523 [email protected] Using Predictive Analysis to Improve Invoice-to-Cash Collection Prem Melville IBM T.J. Watson Research Center Yorktown Heights,
Distributed forests for MapReduce-based machine learning
Distributed forests for MapReduce-based machine learning Ryoji Wakayama, Ryuei Murata, Akisato Kimura, Takayoshi Yamashita, Yuji Yamauchi, Hironobu Fujiyoshi Chubu University, Japan. NTT Communication
PREDICTING STOCK PRICES USING DATA MINING TECHNIQUES
The International Arab Conference on Information Technology (ACIT 2013) PREDICTING STOCK PRICES USING DATA MINING TECHNIQUES 1 QASEM A. AL-RADAIDEH, 2 ADEL ABU ASSAF 3 EMAN ALNAGI 1 Department of Computer
Using Random Forest to Learn Imbalanced Data
Using Random Forest to Learn Imbalanced Data Chao Chen, [email protected] Department of Statistics,UC Berkeley Andy Liaw, andy [email protected] Biometrics Research,Merck Research Labs Leo Breiman,
First Semester Computer Science Students Academic Performances Analysis by Using Data Mining Classification Algorithms
First Semester Computer Science Students Academic Performances Analysis by Using Data Mining Classification Algorithms Azwa Abdul Aziz, Nor Hafieza IsmailandFadhilah Ahmad Faculty Informatics & Computing
Data Mining: A Preprocessing Engine
Journal of Computer Science 2 (9): 735-739, 2006 ISSN 1549-3636 2005 Science Publications Data Mining: A Preprocessing Engine Luai Al Shalabi, Zyad Shaaban and Basel Kasasbeh Applied Science University,
Software Defect Prediction Modeling
Software Defect Prediction Modeling Burak Turhan Department of Computer Engineering, Bogazici University [email protected] Abstract Defect predictors are helpful tools for project managers and developers.
The multilayer sentiment analysis model based on Random forest Wei Liu1, Jie Zhang2
2nd International Conference on Advances in Mechanical Engineering and Industrial Informatics (AMEII 2016) The multilayer sentiment analysis model based on Random forest Wei Liu1, Jie Zhang2 1 School of
An Experimental Study on Ensemble of Decision Tree Classifiers
An Experimental Study on Ensemble of Decision Tree Classifiers G. Sujatha 1, Dr. K. Usha Rani 2 1 Assistant Professor, Dept. of Master of Computer Applications Rao & Naidu Engineering College, Ongole 2
DATA MINING, DIRTY DATA, AND COSTS (Research-in-Progress)
DATA MINING, DIRTY DATA, AND COSTS (Research-in-Progress) Leo Pipino University of Massachusetts Lowell [email protected] David Kopcso Babson College [email protected] Abstract: A series of simulations
