Data Mining and Complex Problems: Case Study in Composite Materials

2009 ◽  
Vol 2 (1) ◽  
pp. 165-170 ◽  
Author(s):  
Luis Rabelo ◽  
Mario Marin ◽  
Lisa Huddleston
Keyword(s):  
Data Mining ◽  
Composite Materials ◽  
Complex Problems

Penerapan Metode Klasifikasi Decision Tree dan Algoritma C4.5 dalam Memprediksi Kriteria Nasabah Kredit Mega Auto Finance

2020 ◽  
Vol 7 (2) ◽  
pp. 200
Author(s):  
Puji Santoso ◽  
Rudy Setiawan
Keyword(s):  
Data Mining ◽  
Decision Tree ◽  
Microsoft Excel ◽  
Customer Data ◽  
Data Mining Techniques ◽  
C4.5 Algorithm ◽  
Marketing Costs ◽  
Excel Format ◽  
Data Mining Application

One of the tasks in the field of marketing finance is to analyze customer data to find out which customers have the potential to do credit again. The method used to analyze customer data is by classifying all customers who have completed their credit installments into marketing targets, so this method causes high operational marketing costs. Therefore this research was conducted to help solve the above problems by designing a data mining application that serves to predict the criteria of credit customers with the potential to lend (credit) to Mega Auto Finance. The Mega Auto finance Fund Section located in Kotim Regency is a place chosen by researchers as a case study, assuming the Mega Auto finance Fund Section has experienced the same problems as described above. Data mining techniques that are applied to the application built is a classification while the classification method used is the Decision Tree (decision tree). While the algorithm used as a decision tree forming algorithm is the C4.5 Algorithm. The data processed in this study is the installment data of Mega Auto finance loan customers in July 2018 in Microsoft Excel format. The results of this study are an application that can facilitate the Mega Auto finance Funds Section in obtaining credit marketing targets in the future

Agent-Enriched Data Mining: A Case Study in Brain Informatics

2009 ◽  
Vol 24 (3) ◽  
pp. 38-45 ◽  
Author(s):  
Ning Zhong ◽  
Shinichi Motomura
Keyword(s):  
Data Mining

A Data Mining Approach to Forming Generic Bills of Materials in Support of Variant Design Activities

2004 ◽  
Vol 4 (4) ◽  
pp. 316-328 ◽  
Author(s):  
Carol J. Romanowski , ◽  
Rakesh Nagi
Keyword(s):  
Data Mining ◽  
Product Family ◽  
Research Direction ◽  
Design Constraints ◽  
Variant Design ◽  
Data Mining Approach ◽  
Design Activities ◽  
Using Data ◽  
New Research

In variant design, the proliferation of bills of materials makes it difficult for designers to find previous designs that would aid in completing a new design task. This research presents a novel, data mining approach to forming generic bills of materials (GBOMs), entities that represent the different variants in a product family and facilitate the search for similar designs and configuration of new variants. The technical difficulties include: (i) developing families or categories for products, assemblies, and component parts; (ii) generalizing purchased parts and quantifying their similarity; (iii) performing tree union; and (iv) establishing design constraints. These challenges are met through data mining methods such as text and tree mining, a new tree union procedure, and embodying the GBOM and design constraints in constrained XML. The paper concludes with a case study, using data from a manufacturer of nurse call devices, and identifies a new research direction for data mining motivated by the domains of engineering design and information.

scholarly journals MINING STARS WITH FP-GROWTH: A CASE STUDY ON BIBLIOGRAPHIC DATA

2011 ◽  
Vol 19 (supp01) ◽  
pp. 65-91
Author(s):  
ANDREIA SILVA ◽  
CLÁUDIA ANTUNES
Keyword(s):  
Data Mining ◽  
Feasible Solution ◽  
Small Dimension ◽  
Frequent Patterns ◽  
Dimensional Model ◽  
Relational Context ◽  
Star Schema ◽  
Bibliographic Data ◽  
Massive Number

Traditional data mining approaches look for patterns in a single table, while multi-relational data mining aims for identifying patterns that involve multiple tables. In recent years, the most common mining techniques have been extended to the multi-relational context, but there are few dedicated to deal with data stored following the multi-dimensional model, in particular the star schema. These schemas are composed of a central huge fact table linking a set of small dimension tables. Joining all the tables before mining may not be a feasible solution due to the usual massive number of records. This work proposes a method for mining frequent patterns on data following a star schema that does not materialize the join between the tables. As it extends the algorithm FP-Growth, it constructs an FP-Tree for each dimension and then combines them through the records in the fact table to form a super FP-Tree. This tree is then mined with FP-growth to find all frequent patterns. The paper presents a case study on bibliographic data, comparing efficiency and scalability of our algorithm against FP-Growth.

Sign in / Sign up

Export Citation Format

Share Document