scholarly journals Market Segmentation of Innovative Products Using Genetic Algoritms

2021 ◽  
Vol 5 (2) ◽  
pp. 67-74
Author(s):  
Serhii Zatsarynin ◽  
Keyword(s):  
Market Segmentation ◽  
Medical Equipment ◽  
Clustering Algorithm ◽  
Fitness Function ◽  
Marketing Research ◽  
Clustering Methods ◽  
Genetic Operators ◽  
Starting Point ◽  
Innovative Products ◽  
Market Niche

One way to increase the company's competitiveness is to find new market niches. The market niche is the result of innovations that stimulate hidden, potential demand, as a result of which the company, developing a new market, avoids intense competition and receives a higher rate of return. It is proved that the growing number and complexity of tasks in the field of marketing research, working with a large amount of information, leads to the need to group data. The aim of the study is to develop a universal approach to solving the problem of market segmentation of innovative products based on a combination of genetic algorithm with traditional clustering methods. An ideal market niche can be defined as a compact and isolated series of points, which in some space of characteristics are objects or data elements. The selection of a market niche in the medical equipment market is carried out using a top-down approach. This approach implies the traditional segmentation of customers, which is carried out in the following order: segmentation, segment selection, positioning. It is believed that segmentation is the starting point for the formation of a market niche. To segment the medical equipment market, it is proposed to use cluster analysis methods. According to the results of the analysis, it can be seen that the market segments of potential consumers of medical equipment and consumables of Siemens in Ukraine are characterized by a fairly dense grouping of images of consumers around the center of its cluster in the space of features. The presented genetic clustering algorithm is flexible in relation to the decision-making process, as it allows to perform clustering based on various criteria, such as maximum mutual removal of clusters, proximity of geometric images of objects to the center of the cluster, other criteria. This is achieved by changing the calculation formula of the fitness function, which takes into account the necessary combination of clustering criteria without changing the structure of the algorithm. The algorithm is insensitive to initialization, as in the process of evolution of chromosomes through the use of genetic operators, the algorithm completely covers the whole set of acceptable solutions, which, in turn, provides high quality market segmentation.

A Survey of the Challenges and Pifalls of Cluster Analysis Application in Market Segmentation

2011 ◽  
Vol 53 (3) ◽  
pp. 391-414 ◽  
Author(s):  
Michael N. Tuma ◽  
Reinhold Decker ◽  
Sören W. Scholz
Keyword(s):  
Cluster Analysis ◽  
Best Practices ◽  
Market Segmentation ◽  
Marketing Research ◽  
Journal Articles ◽  
Research Setting ◽  
Empirical Survey ◽  
Critical Issues ◽  
Analysis Application

Market segmentation is a widely accepted concept in marketing research and planning. Although cluster analysis has been extensively applied to segment markets in the last 50 years, the ways in which the results were obtained have often been reported to be less than satisfactory by both practitioners (Yankelovich & Meer 2006) and academics (Dolnièar 2003). In order to provide guidance to those undertaking market segmentation, this study discusses the critical issues involved when using cluster analysis to segment markets, makes suggestions for best practices and potential improvements, and presents an empirical survey that seeks to provide an up-to-date assessment of cluster analysis application in market segmentation within a six-stage framework. Analyses of more than 200 journal articles published since 2000, in which cluster analysis was empirically used in a marketing research setting, indicate that many critical issues are still ignored rather than addressed adequately.

CLUSTERING USING AN IMPROVED HYBRID GENETIC ALGORITHM

2007 ◽  
Vol 16 (06) ◽  
pp. 919-934
Author(s):  
YONGGUO LIU ◽  
XIAORONG PU ◽  
YIDONG SHEN ◽  
ZHANG YI ◽  
XIAOFENG LIAO
Keyword(s):  
Genetic Algorithm ◽  
Clustering Algorithm ◽  
Hybrid Genetic Algorithm ◽  
Sum Of Squares ◽  
Clustering Methods ◽  
Clustering Problem ◽  
Mutation Operation ◽  
Iteration Methods ◽  
Genetic Clustering ◽  
The Individual

In this article, a new genetic clustering algorithm called the Improved Hybrid Genetic Clustering Algorithm (IHGCA) is proposed to deal with the clustering problem under the criterion of minimum sum of squares clustering. In IHGCA, the improvement operation including five local iteration methods is developed to tune the individual and accelerate the convergence speed of the clustering algorithm, and the partition-absorption mutation operation is designed to reassign objects among different clusters. By experimental simulations, its superiority over some known genetic clustering methods is demonstrated.

Empirical Evaluation of Genetic Clustering Methods Using Multilocus Genotypes From 20 Chicken Breeds

Genetics ◽  
2001 ◽  
Vol 159 (2) ◽  
pp. 699-713
Author(s):  
Noah A Rosenberg ◽  
Terry Burke ◽  
Kari Elo ◽  
Marcus W Feldman ◽  
Paul J Freidlin ◽  
...  
Keyword(s):  
Cluster Analysis ◽  
Population Structure ◽  
Clustering Algorithm ◽  
Empirical Evaluation ◽  
Unknown Origin ◽  
Clustering Methods ◽  
Genetic Cluster ◽  
Data Set ◽  
Multilocus Genotypes ◽  
Chicken Breeds

Abstract We tested the utility of genetic cluster analysis in ascertaining population structure of a large data set for which population structure was previously known. Each of 600 individuals representing 20 distinct chicken breeds was genotyped for 27 microsatellite loci, and individual multilocus genotypes were used to infer genetic clusters. Individuals from each breed were inferred to belong mostly to the same cluster. The clustering success rate, measuring the fraction of individuals that were properly inferred to belong to their correct breeds, was consistently ~98%. When markers of highest expected heterozygosity were used, genotypes that included at least 8–10 highly variable markers from among the 27 markers genotyped also achieved >95% clustering success. When 12–15 highly variable markers and only 15–20 of the 30 individuals per breed were used, clustering success was at least 90%. We suggest that in species for which population structure is of interest, databases of multilocus genotypes at highly variable markers should be compiled. These genotypes could then be used as training samples for genetic cluster analysis and to facilitate assignments of individuals of unknown origin to populations. The clustering algorithm has potential applications in defining the within-species genetic units that are useful in problems of conservation.

Assembly Planning: A Genetic Approach

1998 ◽  
Author(s):  
Shiang-Fong Chen
Keyword(s):  
Genetic Algorithms ◽  
Fitness Function ◽  
Assembly Planning ◽  
Genetic Approach ◽  
Genetic Operators ◽  
Complex Problems ◽  
All Solutions ◽  
Assembly Problem ◽  
Optimal Assembly

Abstract The difficulty of an assembly problem is the inherent complexity of possible solutions. If the most suitable plan is selected after all solutions are found, it will be very time consuming and unrealistic. Motivated by the success of genetic algorithms (GAs) in solving combinatorial and complex problems by examining a small number of possible candidate solutions, GAs are employed to find a near-optimal assembly plan for a general environment. Five genetic operators are used: tree crossover, tree mutation, cut-and-paste, break-and-joint, and reproduction. The fitness function can adapt to different criteria easily. This assembly planner can help an inexperienced technician to find a good solution efficiently. The algorithm has been fully implemented. One example product is given to show the applications and results.

scholarly journals A Novel High-Dimensional Trajectories Construction Network based on Multi-Clustering Algorithm

2021 ◽  
Author(s):  
Feiyang Ren ◽  
Yi Han ◽  
Shaohan Wang ◽  
He Jiang
Keyword(s):  
Economic Analysis ◽  
Clustering Algorithm ◽  
Transportation Network ◽  
High Dimensional ◽  
Clustering Methods ◽  
Marine Transportation ◽  
Network Construction ◽  
National Economic ◽  
Multi Level ◽  
State Of Art

Abstract A novel marine transportation network based on high-dimensional AIS data with a multi-level clustering algorithm is proposed to discover important waypoints in trajectories based on selected navigation features. This network contains two parts: the calculation of major nodes with CLIQUE and BIRCH clustering methods and navigation network construction with edge construction theory. Unlike the state-of-art work for navigation clustering with only ship coordinate, the proposed method contains more high-dimensional features such as drafting, weather, and fuel consumption. By comparing the historical AIS data, more than 220,133 lines of data in 30 days were used to extract 440 major nodal points in less than 4 minutes with ordinary PC specs (i5 processer). The proposed method can be performed on more dimensional data for better ship path planning or even national economic analysis. Current work has shown good performance on complex ship trajectories distinction and great potential for future shipping transportation market analytical predictions.

scholarly journals Analysis of new nosological models from disease similarities using clustering

2020 ◽  
Author(s):  
Lucía Prieto Santamaría ◽  
Eduardo P. García del Valle ◽  
Gerardo Lagunes García ◽  
Massimiliano Zanin ◽  
Alejandro Rodríguez González ◽  
...  
Keyword(s):  
Clustering Algorithm ◽  
Molecular Data ◽  
Modern Medicine ◽  
Biological Information ◽  
Distributed Data ◽  
Feature Vectors ◽  
Dbscan Clustering ◽  
Disease Similarity ◽  
Starting Point ◽  
Evaluation Metric

AbstractWhile classical disease nosology is based on phenotypical characteristics, the increasing availability of biological and molecular data is providing new understanding of diseases and their underlying relationships, that could lead to a more comprehensive paradigm for modern medicine. In the present work, similarities between diseases are used to study the generation of new possible disease nosologic models that include both phenotypical and biological information. To this aim, disease similarity is measured in terms of disease feature vectors, that stood for genes, proteins, metabolic pathways and PPIs in the case of biological similarity, and for symptoms in the case of phenotypical similarity. An improvement in similarity computation is proposed, considering weighted instead of Booleans feature vectors. Unsupervised learning methods were applied to these data, specifically, density-based DBSCAN clustering algorithm. As evaluation metric silhouette coefficient was chosen, even though the number of clusters and the number of outliers were also considered. As a results validation, a comparison with randomly distributed data was performed. Results suggest that weighted biological similarities based on proteins, and computed according to cosine index, may provide a good starting point to rearrange disease taxonomy and nosology.

scholarly journals PERKEMBANGAN INOVASI PRODUK TERHADAP KEGIATAN PEMASARAN DALAM RUANG LINGKUP MASA PANDEMI COVID 19

2021 ◽  
Vol 1 (1) ◽  
pp. 1-7
Author(s):  
Yayan Andriani
Keyword(s):  
Product Innovation ◽  
Marketing Research ◽  
Industrial Sector ◽  
Marketing Process ◽  
Product Innovations ◽  
Innovative Products ◽  
The Right ◽  
Selling Process ◽  
Marketing Methods ◽  
Marketing Position

In Indonesia, there is a wide variety of product innovations related to activities carried out by the community by promoting the marketing process. This development is also related to the matters of companies that compete with various innovations in developing their business to be more advanced. In a business, a lot of considerations are needed so that the profit or profit obtained is more than the capital spent but the quality is still prioritized. One of them is in marketing research which is a place for providers of products or goods to be traded. Market and Marketing Aspects are needed so that the buying and selling process can run smoothly and for transactions. It can be seen how vital the Market and Marketing Aspects are in a business. Where in a business this aspect is the most essential aspect. Market and Marketing Aspects are used in marketing methods in which you can find out how much demand there is so that the business runs properly. Many competitors that occur in the market make a study of the marketing aspects necessary to reduce things that can harm the company. The right marketing position will make the company get the desired profit. In marketing research, also states that there are various methods that can be used in society to support the economy by prioritizing innovative products, but problems in product innovation must be constraints with business capital and advantages or disadvantages, with the COVID-19 pandemic problem with the industrial sector experiencing a decline. Which is very drastic, thereby reducing the innovation that will be carried out.

scholarly journals A Hybrid Deep Clustering Approach for Robust Cell Type Profiling Using Single-cell RNA-seq Data

2019 ◽  
Author(s):  
Suhas Srinivasan ◽  
Nathan T. Johnson ◽  
Dmitry Korkin
Keyword(s):  
Deep Learning ◽  
Single Cell ◽  
Clustering Algorithm ◽  
Hybrid Approach ◽  
Feature Learning ◽  
Specific Cell ◽  
Clustering Methods ◽  
Model Based Clustering ◽  
Clustering And Classification ◽  
Living Organisms

AbstractSingle-cell RNA sequencing (scRNA-seq) is a recent technology that enables fine-grained discovery of cellular subtypes and specific cell states. It routinely uses machine learning methods, such as feature learning, clustering, and classification, to assist in uncovering novel information from scRNA-seq data. However, current methods are not well suited to deal with the substantial amounts of noise that is created by the experiments or the variation that occurs due to differences in the cells of the same type. Here, we develop a new hybrid approach, Deep Unsupervised Single-cell Clustering (DUSC), that integrates feature generation based on a deep learning architecture with a model-based clustering algorithm, to find a compact and informative representation of the single-cell transcriptomic data generating robust clusters. We also include a technique to estimate an efficient number of latent features in the deep learning model. Our method outperforms both classical and state-of-the-art feature learning and clustering methods, approaching the accuracy of supervised learning. The method is freely available to the community and will hopefully facilitate our understanding of the cellular atlas of living organisms as well as provide the means to improve patient diagnostics and treatment.

scholarly journals Comparison of dimensionality reduction and clustering methods for SARS-CoV-2 genome

2021 ◽  
Vol 10 (4) ◽  
pp. 2170-2180
Author(s):  
Untari N. Wisesty ◽  
Tati Rajab Mengko
Keyword(s):  
Dimensionality Reduction ◽  
Dimensional Reduction ◽  
Clustering Algorithm ◽  
Sequence Data ◽  
Clustering Algorithms ◽  
Gaussian Mixture Models ◽  
Reduction Process ◽  
Principal Component ◽  
Gaussian Mixture ◽  
Clustering Methods

This paper aims to conduct an analysis of the SARS-CoV-2 genome variation was carried out by comparing the results of genome clustering using several clustering algorithms and distribution of sequence in each cluster. The clustering algorithms used are K-means, Gaussian mixture models, agglomerative hierarchical clustering, mean-shift clustering, and DBSCAN. However, the clustering algorithm has a weakness in grouping data that has very high dimensions such as genome data, so that a dimensional reduction process is needed. In this research, dimensionality reduction was carried out using principal component analysis (PCA) and autoencoder method with three models that produce 2, 10, and 50 features. The main contributions achieved were the dimensional reduction and clustering scheme of SARS-CoV-2 sequence data and the performance analysis of each experiment on each scheme and hyper parameters for each method. Based on the results of experiments conducted, PCA and DBSCAN algorithm achieve the highest silhouette score of 0.8770 with three clusters when using two features. However, dimensionality reduction using autoencoder need more iterations to converge. On the testing process with Indonesian sequence data, more than half of them enter one cluster and the rest are distributed in the other two clusters.

scholarly journals Adaptive Unified Differential Evolution for Clustering

2018 ◽  
Vol 12 (1) ◽  
pp. 53
Author(s):  
Maulida Ayu Fitriani ◽  
Aina Musdholifah ◽  
Sri Hartati
Keyword(s):  
Differential Evolution ◽  
Fitness Function ◽  
Single Mutation ◽  
Clustering Methods ◽  
Mutation Strategy ◽  
Clustering Quality ◽  
Silhouette Index ◽  
Mutation Strategies ◽  
Time Required

Various clustering methods to obtain optimal information continues to evolve one of its development is Evolutionary Algorithm (EA). Adaptive Unified Differential Evolution (AuDE), is the development of Differential Evolution (DE) which is one of the EA techniques. AuDE has self adaptive scale factor control parameters (F) and crossover-rate (Cr).. It also has a single mutation strategy that represents the most commonly used standard mutation strategies from previous studies.The AuDE clustering method was tested using 4 datasets. Silhouette Index and CS Measure is a fitness function used as a measure of the quality of clustering results. The quality of the AuDE clustering results is then compared against the quality of clustering results using the DE method.The results show that the AuDE mutation strategy can expand the cluster central search produced by ED so that better clustering quality can be obtained. The comparison of the quality of AuDE and DE using Silhoutte Index is 1:0.816, whereas the use of CS Measure shows a comparison of 0.565:1. The execution time required AuDE shows better but Number significant results, aimed at the comparison of Silhoutte Index usage of 0.99:1 , Whereas on the use of CS Measure obtained the comparison of 0.184:1.

Sign in / Sign up

Export Citation Format

Share Document