Electricity load profile classification using Fuzzy C-Means method

This paper presents the Fuzzy C-Means (FCM) clustering method. The FCM technique assigns a degree of membership for each data set to several clusters, thus offering the opportunity to deal with load profiles that could belong to more than one group at the same time. The FCM algorithm is based on minimising a c-means objective function to determine an optimal classification. The simulation of FCM was carried out using actual sample data from Indonesia and the results are presented. Some validity index measurements was carried out to estimate the compactness of the resulting clusters or to find the optimal number of clusters for a data set

Designing Mamdani-Type Fuzzy Reasoning for Visualizing Prediction Problems Based on Collaborative Fuzzy Clustering

In this paper a collaborative fuzzy c-means (CFCM) is used to generate fuzzy rules for fuzzy inference systems to evaluate the time series model. CFCM helps system to integrate two or more different datasets having similar features which are collected at the different environment with the different time period and it integrates these datasets together in order to visualize some common patterns among the datasets. In order to do any mode of integration between datasets, there is a necessity to define the common features between datasets by using some kind of collaborative process and also need to preserve the privacy and security at higher levels. This collaboration process gives a common structure between datasets which helps to define an appropriate number of rules for structural learning and also improve the accuracy of the system modeling

Extended Fuzzy Clustering Algorithms

Fuzzy clustering is a widely applied method for obtaining fuzzy models from data. Ithas been applied successfully in various fields including finance and marketing. Despitethe successful applications, there are a number of issues that must be dealt with in practicalapplications of fuzzy clustering algorithms. This technical report proposes two extensionsto the objective function based fuzzy clustering for dealing with these issues. First, the(point) prototypes are extended to hypervolumes whose size is determined automaticallyfrom the data being clustered. These prototypes are shown to be less sensitive to a biasin the distribution of the data. Second, cluster merging by assessing the similarity amongthe clusters during optimization is introduced. Starting with an over-estimated number ofclusters in the data, similar clusters are merged during clustering in order to obtain a suitablepartitioning of the data. An adaptive threshold for merging is introduced. The proposedextensions are applied to Gustafson-Kessel and fuzzy c-means algorithms, and the resultingextended algorithms are given. The properties of the new algorithms are illustrated invarious examples.fuzzy clustering;cluster merging;similarity;volume prototypes

Fuzzy Modeling of Client Preference in Data-Rich Marketing Environments

Advances in computational methods have led, in the world of financial services, to huge databases of client and market information. In the past decade, various computational intelligence (CI) techniques have been applied in mining this data for obtaining knowledge and in-depth information about the clients and the markets. This paper discusses the application of fuzzy clustering in target selection from large databases for direct marketing (DM) purposes. Actual data from the campaigns of a large financial services provider are used as a test case. The results obtained with the fuzzy clustering approach are compared with those resulting from the current practice of using statistical tools for target selection.fuzzy clustering;direct marketing;client segmentation;fuzzy systems

Survey of data mining approaches to user modeling for adaptive hypermedia

The ability of an adaptive hypermedia system to create tailored environments depends mainly on the amount and accuracy of information stored in each user model. Some of the difficulties that user modeling faces are the amount of data available to create user models, the adequacy of the data, the noise within that data, and the necessity of capturing the imprecise nature of human behavior. Data mining and machine learning techniques have the ability to handle large amounts of data and to process uncertainty. These characteristics make these techniques suitable for automatic generation of user models that simulate human decision making. This paper surveys different data mining techniques that can be used to efficiently and accurately capture user behavior. The paper also presents guidelines that show which techniques may be used more efficiently according to the task implemented by the applicatio

Fuzzy-Granular Based Data Mining for Effective Decision Support in Biomedical Applications

Due to complexity of biomedical problems, adaptive and intelligent knowledge discovery and data mining systems are highly needed to help humans to understand the inherent mechanism of diseases. For biomedical classification problems, typically it is impossible to build a perfect classifier with 100% prediction accuracy. Hence a more realistic target is to build an effective Decision Support System (DSS). In this dissertation, a novel adaptive Fuzzy Association Rules (FARs) mining algorithm, named FARM-DS, is proposed to build such a DSS for binary classification problems in the biomedical domain. Empirical studies show that FARM-DS is competitive to state-of-the-art classifiers in terms of prediction accuracy. More importantly, FARs can provide strong decision support on disease diagnoses due to their easy interpretability. This dissertation also proposes a fuzzy-granular method to select informative and discriminative genes from huge microarray gene expression data. With fuzzy granulation, information loss in the process of gene selection is decreased. As a result, more informative genes for cancer classification are selected and more accurate classifiers can be modeled. Empirical studies show that the proposed method is more accurate than traditional algorithms for cancer classification. And hence we expect that genes being selected can be more helpful for further biological studies

Semantic image retrieval using relevance feedback and transaction logs

Due to the recent improvements in digital photography and storage capacity, storing large amounts of images has been made possible, and efficient means to retrieve images matching a user’s query are needed. Content-based Image Retrieval (CBIR) systems automatically extract image contents based on image features, i.e. color, texture, and shape. Relevance feedback methods are applied to CBIR to integrate users’ perceptions and reduce the gap between high-level image semantics and low-level image features. The precision of a CBIR system in retrieving semantically rich (complex) images is improved in this dissertation work by making advancements in three areas of a CBIR system: input, process, and output. The input of the system includes a mechanism that provides the user with required tools to build and modify her query through feedbacks. Users behavioral in CBIR environments are studied, and a new feedback methodology is presented to efficiently capture users’ image perceptions. The process element includes image learning and retrieval algorithms. A Long-term image retrieval algorithm (LTL), which learns image semantics from prior search results available in the system’s transaction history, is developed using Factor Analysis. Another algorithm, a short-term learner (STL) that captures user’s image perceptions based on image features and user’s feedbacks in the on-going transaction, is developed based on Linear Discriminant Analysis. Then, a mechanism is introduced to integrate these two algorithms to one retrieval procedure. Finally, a retrieval strategy that includes learning and searching phases is defined for arranging images in the output of the system. The developed relevance feedback methodology proved to reduce the effect of human subjectivity in providing feedbacks for complex images. Retrieval algorithms were applied to images with different degrees of complexity. LTL is efficient in extracting the semantics of complex images that have a history in the system. STL is suitable for query and images that can be effectively represented by their image features. Therefore, the performance of the system in retrieving images with visual and conceptual complexities was improved when both algorithms were applied simultaneously. Finally, the strategy of retrieval phases demonstrated promising results when the query complexity increases

Customer Segmentation Using Real Transactional Data in E-Commerce Platform: A Case of Online Fashion Bags Shop

Customer segmentation has been widely used in different businesses and plays important rules in customer service. How to get a suitable segmentation based on the real transactional data to fully mining the hidden customer information in the massive data is still a challenge in current e-commerce platforms. This paper develops a customer segmentation model for online shops and uses the real data from a fashion bag store as a case. This paper firstly conducts a data preprocessing to select the main customer features, then it constructs a segmentation model based on the Fuzzy C-Means algorithm, and finally accomplishes a customer prediction model using a probabilistic neural network to estimate new customer’s customer type. The results show that the customer samples are classified into three types, and the prediction accuracy is more than 90%. After that, this paper demonstrates the typical features of each type of customer and compares the new group features with the prior VIP groups. The ANOVA analysis test results show that the new groups have more significant differences than prior VIP groups, which means more effective segmentation results

A review of clustering techniques and developments

© 2017 Elsevier B.V. This paper presents a comprehensive study on clustering: exiting methods and developments made at various times. Clustering is defined as an unsupervised learning where the objects are grouped on the basis of some similarity inherent among them. There are different methods for clustering the objects such as hierarchical, partitional, grid, density based and model based. The approaches used in these methods are discussed with their respective states of art and applicability. The measures of similarity as well as the evaluation criteria, which are the central components of clustering, are also presented in the paper. The applications of clustering in some fields like image segmentation, object and character recognition and data mining are highlighted

Colour Image Segmentation using Fast Fuzzy C-Means Algorithm

This paper proposes modified FCM (Fuzzy C-Means) approach to colour image segmentation using JND (Just Noticeable Difference) histogram. Histogram of the given colour image is computed using JND colour model. This samples the colour space so that just enough number of histogram bins are obtained without compromising the visual image content. The number of histogram bins are further reduced using agglomeration. This agglomerated histogram yields the estimation of number of clusters, cluster seeds and the initial fuzzy partition for FCM algorithm. This is a novell approach to estimate the input parameters for FCM algorithm. The proposed fast FCM(FFCM) algorithm works on histogram bins as data elements instead of individual pixels. This significantly reduces the time complexity of FCM algorithm. To verify the effectiveness of the proposed image segmentation approach, its performance is evaluated on Berkeley Segmentation Database(BSD). Two significant criteria namely PSNR(Peak Signal to Noise Ratio) and PRI (Probabilistic Rand Index) are used to evaluate the performance. Although results show that the proposed algorithm applied to the JND histogram bins converges much faster and also gives better results than conventional FCM algorithm, in terms of PSNR and PR