Data-Driven Decision Tree Classification for Product Portfolio Design Optimization

2009 ◽  
Vol 9 (4) ◽  
Author(s):  
Conrad S. Tucker ◽  
Harrison M. Kim
Keyword(s):  
Data Mining ◽  
Decision Tree ◽  
Engineering Design ◽  
Optimization Techniques ◽  
Product Portfolio ◽  
Performance Expectations ◽  
Data Set ◽  
Tree Data ◽  
Portfolio Design ◽  
Product Concepts

The formulation of a product portfolio requires extensive knowledge about the product market space and also the technical limitations of a company’s engineering design and manufacturing processes. A design methodology is presented that significantly enhances the product portfolio design process by eliminating the need for an exhaustive search of all possible product concepts. This is achieved through a decision tree data mining technique that generates a set of product concepts that are subsequently validated in the engineering design using multilevel optimization techniques. The final optimal product portfolio evaluates products based on the following three criteria: (1) it must satisfy customer price and performance expectations (based on the predictive model) defined here as the feasibility criterion; (2) the feasible set of products/variants validated at the engineering level must generate positive profit that we define as the optimality criterion; (3) the optimal set of products/variants should be a manageable size as defined by the enterprise decision makers and should therefore not exceed the product portfolio limit. The strength of our work is to reveal the tremendous savings in time and resources that exist when decision tree data mining techniques are incorporated into the product portfolio design and selection process. Using data mining tree generation techniques, a customer data set of 40,000 responses with 576 unique attribute combinations (entire set of possible product concepts) is narrowed down to 46 product concepts and then validated through the multilevel engineering design response of feasible products. A cell phone example is presented and an optimal product portfolio solution is achieved that maximizes company profit, without violating customer product performance expectations.

Product Family Concept Generation and Validation Through Predictive Decision Tree Data Mining and Multi-Level Optimization

2007 ◽  
Author(s):  
Conrad S. Tucker ◽  
Harrison M. Kim
Keyword(s):  
Data Mining ◽  
Decision Tree ◽  
Engineering Design ◽  
Product Family ◽  
Optimization Techniques ◽  
Computational Time ◽  
Product Portfolio ◽  
Performance Expectations ◽  
Multi Level ◽  
Product Concepts

The formulation of a product family requires extensive knowledge about the product market space and also the technical limitations of a company’s engineering design and manufacturing processes. We present a methodology to significantly reduce the computational time required to achieve an optimal product portfolio by eliminating the need for an exhaustive search of all possible product concepts. This is achieved through a data mining decision tree technique that generates a set of product concepts that are subsequently validated in the engineering design level using multi-level optimization techniques. The final optimal product portfolio evaluates products based on the following three criteria: 1) The ability to satisfy customer’s price and performance expectations (based on predictive model) defined here as the feasibility criterion. 2) The feasible set of products/variants validated at the engineering level must generate positive profit that we define as the optimality criterion. 3) The optimal set of products/variants should be a manageable size as defined by the enterprise decisions makers and should therefore not exceed the product portfolio limit. The strength of our work is to reveal the tremendous savings in time and resources that exist when data mining predictive techniques are applied to the formulation of an optimal product portfolio. Using data mining tree generation techniques, a customer response data set of 40,000 individual product preferences is narrowed down to 46 product family concepts and then validated through the multilevel engineering design response of feasible architectures. A cell phone example is presented and an optimal product portfolio solution is achieved that maximizes company profit, while concurrently satisfying customer product performance expectations.

A novel Gini index decision tree data mining method with neural network classifiers for prediction of heart disease

2018 ◽  
Vol 22 (3) ◽  
pp. 225-242 ◽  
Author(s):  
K. Mathan ◽  
Priyan Malarvizhi Kumar ◽  
Parthasarathy Panchatcharam ◽  
Gunasekaran Manogaran ◽  
R. Varadharajan
Keyword(s):  
Neural Network ◽  
Data Mining ◽  
Heart Disease ◽  
Decision Tree ◽  
Gini Index ◽  
Mining Method ◽  
Data Mining Method ◽  
Tree Data ◽  
Neural Network Classifiers

scholarly journals CUDT: A CUDA Based Decision Tree Algorithm

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Win-Tsung Lo ◽  
Yue-Shan Chang ◽  
Ruey-Kai Sheu ◽  
Chun-Chieh Chiu ◽  
Shyan-Ming Yuan
Keyword(s):  
Data Mining ◽  
Decision Tree ◽  
New Technology ◽  
Large Data ◽  
Decision Tree Algorithm ◽  
Data Set ◽  
Tree Algorithm ◽  
Ubiquitous Sensing ◽  
Device Architecture ◽  
Huge Data

Decision tree is one of the famous classification methods in data mining. Many researches have been proposed, which were focusing on improving the performance of decision tree. However, those algorithms are developed and run on traditional distributed systems. Obviously the latency could not be improved while processing huge data generated by ubiquitous sensing node in the era without new technology help. In order to improve data processing latency in huge data mining, in this paper, we design and implement a new parallelized decision tree algorithm on a CUDA (compute unified device architecture), which is a GPGPU solution provided by NVIDIA. In the proposed system, CPU is responsible for flow control while the GPU is responsible for computation. We have conducted many experiments to evaluate system performance of CUDT and made a comparison with traditional CPU version. The results show that CUDT is 5∼55 times faster than Weka-j48 and is 18 times speedup than SPRINT for large data set.

scholarly journals Soil Data Analysis and Crop Yield Prediction in Data Mining using R – Programming

2020 ◽  
Vol 9 (3) ◽  
pp. 1857-1860
Keyword(s):  
Data Mining ◽  
Data Analysis ◽  
Decision Tree ◽  
Crop Yield ◽  
Climatic Condition ◽  
Research Work ◽  
Yield Prediction ◽  
Decision Tree Algorithm ◽  
Data Set ◽  
R Programming

Data mining is better choices in emerging research filed- soil data analysis. crop yield prediction is an important issue for selecting the crop. earlier prediction of crop is done by the experience of farmer on a particular type of field and crop. predicting the crop is done by the farmer’s experience based on the factors like soil types, climatic condition, seasons, and weather, rainfall and irrigation facilities. data mining techniques is the better choice for predicting the crop. the analysis of soil plays an important role in agricultural filed. soil fertility prediction is one of the very important factors in agriculture this research work implements to predict yield of crop, decision tree algorithm is used to find yield. the aim of this research to pinpoint the accuracy and to finding the yield of the crop using decision tree and c 4.5 algorithm is used to predict the yield of crop using rprogramming and also to find range of magnesium found in the collected soil data set. this prediction will be very useful for the farmer to predict the crop yield for cultivation

scholarly journals PENERAPAN DATA MINING MENGGUNAKAN ALGORITMA C4.5 TEHADAP PENGARUH PENJUALAN KOPI PADA PT. JPW INDONESIA

2020 ◽  
Vol 3 (1) ◽  
pp. 40-54
Author(s):  
Ikong Ifongki
Keyword(s):  
Data Mining ◽  
Decision Tree ◽  
Decision Rules ◽  
Large Data ◽  
Added Value ◽  
Data Set ◽  
Use Of Data ◽  
Decision Tree Classification ◽  
C4.5 Algorithm

Data mining is a series of processes to explore the added value of a data set in the form of knowledge that has not been known manually. The use of data mining techniques is expected to provide knowledge - knowledge that was previously hidden in the data warehouse, so that it becomes valuable information. C4.5 algorithm is a decision tree classification algorithm that is widely used because it has the main advantages of other algorithms. The advantages of the C4.5 algorithm can produce decision trees that are easily interpreted, have an acceptable level of accuracy, are efficient in handling discrete type attributes and can handle discrete and numeric type attributes. The output of the C4.5 algorithm is a decision tree like other classification techniques, a decision tree is a structure that can be used to divide a large data set into smaller sets of records by applying a series of decision rules, with each series of division members of the resulting set become similar to each other. In this case study what is discussed is the effect of coffee sales by processing 106 data from 1087 coffee sales data at PT. JPW Indonesia. Data samples taken will be calculated manually using Microsoft Excel and Rapidminer software. The results of the calculation of the C4.5 algorithm method show that the Quantity and Price attributes greatly affect coffee sales so that sales at PT. JPW Indonesia is still often unstable.

Data mining of digital phytosanitary

2021 ◽  
Author(s):  
T. Z. Ibragimov ◽  
Keyword(s):  
Neural Network ◽  
Data Mining ◽  
Artificial Neural Network ◽  
Decision Tree ◽  
Bayesian Classifier ◽  
Design Parameters ◽  
Data Set ◽  
Septoria Leaf Blotch ◽  
Leaf Blotch ◽  
Artificial Neural

methods of data mining were used to predict the Septoria leaf blotch of wheat. A system has been developed that allows parallel forecasting with the same data set using the methods of an artificial neural network, a decision tree, and a naive Bayesian classifier. The system allows you to interactively adjust the design parameters for each of the methods, see the results obtained and evaluate their effectiveness.

Identifying Decision Structures Underlying Activity Patterns: An Exploration of Data Mining Algorithms

2000 ◽  
Vol 1718 (1) ◽  
pp. 1-9 ◽  
Author(s):  
Geert Wets ◽  
Koen Vanhoof ◽  
Theo Arentze ◽  
Harry Timmermans
Keyword(s):  
Data Mining ◽  
Decision Tree ◽  
Logit Model ◽  
Goodness Of Fit ◽  
Travel Demand ◽  
Activity Patterns ◽  
Future Research ◽  
Data Set ◽  
Data Mining Algorithms ◽  
Mining Algorithms

The utility-maximizing framework—in particular, the logit model—is the dominantly used framework in transportation demand modeling. Computational process modeling has been introduced as an alternative approach to deal with the complexity of activity-based models of travel demand. Current rule-based systems, however, lack a methodology to derive rules from data. The relevance and performance of data-mining algorithms that potentially can provide the required methodology are explored. In particular, the C4 algorithm is applied to derive a decision tree for transport mode choice in the context of activity scheduling from a large activity diary data set. The algorithm is compared with both an alternative method of inducing decision trees (CHAID) and a logit model on the basis of goodness-of-fit on the same data set. The ratio of correctly predicted cases of a holdout sample is almost identical for the three methods. This suggests that for data sets of comparable complexity, the accuracy of predictions does not provide grounds for either rejecting or choosing the C4 method. However, the method may have advantages related to robustness. Future research is required to determine the ability of decision tree-based models in predicting behavioral change.

Sign in / Sign up

Export Citation Format

Share Document