Digging in the Details: A Case Study in Network Data Mining

2005 ◽  
pp. 14-26 ◽  
Author(s):  
John Galloway ◽  
Simeon J. Simoff
Keyword(s):  
Data Mining ◽  
Network Data

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

Incremental Community Detection on Large Complex Attributed Network

2021 ◽  
Vol 15 (6) ◽  
pp. 1-20
Author(s):  
Zhe Chen ◽  
Aixin Sun ◽  
Xiaokui Xiao
Keyword(s):  
Community Detection ◽  
Large Scale ◽  
Network Data ◽  
Topological Information ◽  
Community Membership ◽  
Attributed Network ◽  
Benchmark Datasets ◽  
Modularity Maximization ◽  
Large Scale Networks

Community detection on network data is a fundamental task, and has many applications in industry. Network data in industry can be very large, with incomplete and complex attributes, and more importantly, growing. This calls for a community detection technique that is able to handle both attribute and topological information on large scale networks, and also is incremental. In this article, we propose inc-AGGMMR, an incremental community detection framework that is able to effectively address the challenges that come from scalability, mixed attributes, incomplete values, and evolving of the network. Through construction of augmented graph, we map attributes into the network by introducing attribute centers and belongingness edges. The communities are then detected by modularity maximization. During this process, we adjust the weights of belongingness edges to balance the contribution between attribute and topological information to the detection of communities. The weight adjustment mechanism enables incremental updates of community membership of all vertices. We evaluate inc-AGGMMR on five benchmark datasets against eight strong baselines. We also provide a case study to incrementally detect communities on a PayPal payment network which contains users with transactions. The results demonstrate inc-AGGMMR’s effectiveness and practicability.

Sign in / Sign up

Export Citation Format

Share Document