Spatial Clustering Analysis of K-Means Algorithm in the Classification of Bank Card Customers

2014 ◽  
Vol 687-691 ◽  
pp. 1274-1277
Author(s):  
Kang Lv

K-means algorithm is a simple and efficient data mining clustering algorithm. For the current status of the bank card customer relationship management, based on data mining technology, design based on K-means clustering algorithm banking customer classification system. Data mining techniques can extract vast amounts of customer information data bank card implicit knowledge and spatial relationship model will represent the bank customers feature set of data objects automatically classified into each composed of clusters of similar objects, bank card customers in the banking system classification. This paper analyzes the existing spatial clustering methods summary and conclusion, based on the combined data bank card customers, according to the volatility of funds used to different customer groups, the use of K-means analysis to study characteristics of client groups, providing appropriate financial services.

2014 ◽  
Vol 971-973 ◽  
pp. 1565-1568
Author(s):  
Zhi Yong Wang

Facing the particularity of the current limitations and spatial clustering clustering methods, the objective function from concept clustering starting to GIS spatial data management and spatial analysis for technical support, explores the space between the sample direct access to the distance calculated distance and indirect reach up costs. K samples randomly selected as the cluster center, with space for the sample to reach the center of each cluster sample is divided according to the distance, the sum of the spatial clustering center of the sample to reach its cost objective function for clustering, introduction of genetic algorithm, a spatial clustering algorithm based on GIS. Finally, the algorithm is tested by examples.


2013 ◽  
Vol 416-417 ◽  
pp. 1244-1250
Author(s):  
Ting Ting Zhao

With rapid development of space information crawl technology, different types of spatial database and data size of spatial database increases continuously. How to extract valuable information from complicated spatial data has become an urgent issue. Spatial data mining provides a new thought for solving the problem. The paper introduces fuzzy clustering into spatial data clustering field, studies the method that fuzzy set theory is applied to spatial data mining, proposes spatial clustering algorithm based on fuzzy similar matrix, fuzzy similarity clustering algorithm. The algorithm not only can solve the disadvantage that fuzzy clustering cant process large data set, but also can give similarity measurement between objects.


Author(s):  
Jiawei Han ◽  
Micheline Kamber ◽  
Anthony K H Tung

Author(s):  
Jack Cook

Decision makers thirst for answers to questions. As more data is gathered, more questions are posed: Which customers are most likely to respond positively to a marketing campaign, product price change or new product offering? How will the competition react? Which loan applicants are most likely or least likely to default? The ability to raise questions, even those that currently cannot be answered, is a characteristic of a good decision maker. Decision makers no longer have the luxury of making decisions based on gut feeling or intuition. Decisions must be supported by data; otherwise decision makers can expect to be questioned by stockholders, reporters, or attorneys in a court of law. Data mining can support and often direct decision makers in ways that are often counterintuitive. Although data mining can provide considerable insight, there is an “inherent risk that what might be inferred may be private or ethically sensitive” (Fule & Roddick, 2004, p. 159). Extensively used in telecommunications, financial services, insurance, customer relationship management (CRM), retail, and utilities, data mining more recently has been used by educators, government officials, intelligence agencies, and law enforcement. It helps alleviate data overload by extracting value from volume. However, data analysis is not data mining. Query-driven data analysis, perhaps guided by an idea or hypothesis, that tries to deduce a pattern, verify a hypothesis, or generalize information in order to predict future behavior is not data mining (Edelstein, 2003). It may be a first step, but it is not data mining. Data mining is the process of discovering and interpreting meaningful, previously hidden patterns in the data. It is not a set of descriptive statistics. Description is not prediction. Furthermore, the focus of data mining is on the process, not a particular technique, used to make reasonably accurate predictions. It is iterative in nature and generically can be decomposed into the following steps: (1) data acquisition through translating, cleansing, and transforming data from numerous sources, (2) goal setting or hypotheses construction, (3) data mining, and (4) validating or interpreting results. The process of generating rules through a mining operation becomes an ethical issue, when the results are used in decision-making processes that affect people or when mining customer data unwittingly compromises the privacy of those customers (Fule & Roddick, 2004). Data miners and decision makers must contemplate ethical issues before encountering one. Otherwise, they risk not identifying when a dilemma exists or making poor choices, since all aspects of the problem have not been identified.


2018 ◽  
Vol 120 (3) ◽  
pp. 665-675 ◽  
Author(s):  
Wen-Yu Chiang

Purpose The purpose of this paper is to propose a data mining approach for mining valuable markets for online customer relationship management (CRM) marketing strategy. The industry of coffee shops in Taiwan is employed as an empirical case study in this research. Design/methodology/approach Via a proposed data mining approach, the study used fuzzy clustering algorithm and Apriori algorithm to analyze customers for obtaining more marketing and purchasing knowledge of online CRM systems. Findings The research found three hard markets and one fuzzy market. Furthermore, the study discovered two association rules and two fuzzy association rules. Originality/value However, industry of coffee shops has been always a fast-growing and competitive business around the world. Thus, marketing strategy is important for this industry. The results and the proposed data mining approach of this research can be used in the industry of coffee shop or other retailers for their online CRM marketing systems.


2018 ◽  
Vol 204 ◽  
pp. 04017 ◽  
Author(s):  
Anik Dwiastuti ◽  
Aisyah Larasati ◽  
Endang Prahastuti

Supply chain in textile industry requires an involvement of several other related industry therefore it divide into several sub-sector industry. The market dynamic and complexity of supply chain network are causing problem. This study aims to classify the market base on consumers behaviour through their preferences in textile product in East Java. Analysis of data using data mining approach. Algorithm K-means type clustering is use as clustering methods by integrating with Customer Relationship Management (CRM) concept. The simulation result of data set using five cluster depends on their variability value are Lumajang, Malang, Madura, Tulungagung, and Ponorogo. The clusters formed have the highest importance predictor in “way of purchase” and the lowest in “purchase flexibility”. The result in this study is generally indicate that consumers of textile products in East Java prioritize values in customer value compared to product quality.


Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-17
Author(s):  
Qi Diao ◽  
Yaping Dai ◽  
Qichao An ◽  
Weixing Li ◽  
Xiaoxue Feng ◽  
...  

This paper presents an improved clustering algorithm for categorizing data with arbitrary shapes. Most of the conventional clustering approaches work only with round-shaped clusters. This task can be accomplished by quickly searching and finding clustering methods for density peaks (DPC), but in some cases, it is limited by density peaks and allocation strategy. To overcome these limitations, two improvements are proposed in this paper. To describe the clustering center more comprehensively, the definitions of local density and relative distance are fused with multiple distances, including K-nearest neighbors (KNN) and shared-nearest neighbors (SNN). A similarity-first search algorithm is designed to search the most matching cluster centers for noncenter points in a weighted KNN graph. Extensive comparison with several existing DPC methods, e.g., traditional DPC algorithm, density-based spatial clustering of applications with noise (DBSCAN), affinity propagation (AP), FKNN-DPC, and K-means methods, has been carried out. Experiments based on synthetic data and real data show that the proposed clustering algorithm can outperform DPC, DBSCAN, AP, and K-means in terms of the clustering accuracy (ACC), the adjusted mutual information (AMI), and the adjusted Rand index (ARI).


2014 ◽  
Vol 23 (4) ◽  
pp. 379-389 ◽  
Author(s):  
Jun Ye

AbstractClustering plays an important role in data mining, pattern recognition, and machine learning. Single-valued neutrosophic sets (SVNSs) are useful means to describe and handle indeterminate and inconsistent information that fuzzy sets and intuitionistic fuzzy sets cannot describe and deal with. To cluster the data represented by single-valued neutrosophic information, this article proposes single-valued neutrosophic clustering methods based on similarity measures between SVNSs. First, we define a generalized distance measure between SVNSs and propose two distance-based similarity measures of SVNSs. Then, we present a clustering algorithm based on the similarity measures of SVNSs to cluster single-valued neutrosophic data. Finally, an illustrative example is given to demonstrate the application and effectiveness of the developed clustering methods.


Sign in / Sign up

Export Citation Format

Share Document