Fuzzy c-Means Clustering untuk Pengenalan Pola Studi kasus Data Saham

Fuzzy Clustering is one of the five roles used by data mining experts to transform large amounts of data into useful information, and one method that is often and widely used is Fuzzy c-Means (FCM) Clustering. FCM is a data clustering technique where the existence of each data point in the cluster is based on the degree of membership. This study aims to see the pattern of data samples or data categories using FCM clustering. The analyzed data is stock data on Jakarta Stock Exchange (BEJ) in the Property and Real Estate sector (issuer group). The data mining processes comply Cross Industry Standard Process Model for Data mining Process (Crisp-DM), with several stages, starting with the stage of getting to know the business process (Business Understanding) then studying the data (Data Understanding), continuing with the Data Preparation stage, Modeling stage, Evaluation stage and finally the Deployment stage. In the modeling stage, the FCM model is used. FCM clustering model data mining can analyze data in large databases with many variables and complicated, especially to get patterns from the data. Then a Fuzzy Inference System (FIS) was built based on a known pattern for simulating input data into output data based on fuzzy logic. Keywords: Fuzzy c-Means Clustering, Pattern Recognitio

Computing the Component-Labeling and the Adjacency Tree of a Binary Digital Image in Near Logarithmic-Time

Connected component labeling (CCL) of binary images is one of the fundamental operations in real time applications. The adjacency tree (AdjT) of the connected components offers a region-based representation where each node represents a region which is surrounded by another region of the opposite color. In this paper, a fully parallel algorithm for computing the CCL and AdjT of a binary digital image is described and implemented, without the need of using any geometric information. The time complexity order for an image of m × n pixels under the assumption that a processing element exists for each pixel is near O(log(m+ n)). Results for a multicore processor show a very good scalability until the so-called memory bandwidth bottleneck is reached. The inherent parallelism of our approach points to the direction that even better results will be obtained in other less classical computing architectures.Ministerio de Economía y Competitividad MTM2016-81030-PMinisterio de Economía y Competitividad TEC2012-37868-C04-0

Data Clustering: Algorithms and Its Applications

Data is useless if information or knowledge that can be used for further reasoning cannot be inferred from it. Cluster analysis, based on some criteria, shares data into important, practical or both categories (clusters) based on shared common characteristics. In research, clustering and classification have been used to analyze data, in the field of machine learning, bioinformatics, statistics, pattern recognition to mention a few. Different methods of clustering include Partitioning (K-means), Hierarchical (AGNES), Density-based (DBSCAN), Grid-based (STING), Soft clustering (FANNY), Model-based (SOM) and Ensemble clustering. Challenges and problems in clustering arise from large datasets, misinterpretation of results and efficiency/performance of clustering algorithms, which is necessary for choosing clustering algorithms. In this paper, application of data clustering was systematically discussed in view of the characteristics of the different clustering techniques that make them better suited or biased when applied to several types of data, such as uncertain data, multimedia data, graph data, biological data, stream data, text data, time series data, categorical data and big data. The suitability of the available clustering algorithms to different application areas was presented. Also investigated were some existing cluster validity methods used to evaluate the goodness of the clusters produced by the clustering algorithms

Evidential Evolving Gustafson-Kessel Algorithm (E2GK) and its application to PRONOSTIA's Data Streams Partitioning.

International audienceCondition-based maintenance (CBM) appears to be a key element in modern maintenance practice. Research in diagnosis and prognosis, two important aspects of a CBM program, is growing rapidly and many studies are conducted in research laboratories to develop models, algorithms and technologies for data processing. In this context, we present a new evolving clustering algorithm developed for prognostics perspectives. E2GK (Evidential Evolving Gustafson-Kessel) is an online clustering method in the theoretical framework of belief functions. The algorithm enables an online partitioning of data streams based on two existing and efficient algorithms: Evidantial c-Means (ECM) and Evolving Gustafson-Kessel (EGK). To validate and illustrate the results of E2GK, we use a dataset provided by an original platform called PRONOSTIA dedicated to prognostics applications

Evidential Evolving Gustafson-Kessel Algortithm (E2GK) and its application to PRONOSTIA's Data Streams Partitioning.

International audienceCondition-based maintenance (CBM) appears to be a key element in modern maintenance practice. Research in diagnosis and prognosis, two important aspects of a CBM program, is growing rapidly and many studies are conducted in research laboratories to develop models, algorithms and technologies for data processing. In this context, we present a new evolving clustering algorithm developed for prognostics perspectives. E2GK (Evidential Evolving Gustafson-Kessel) is an online clustering method in the theoretical framework of belief functions. The algorithm enables an online partitioning of data streams based on two existing and efficient algorithms: Evidantial c-Means (ECM) and Evolving Gustafson-Kessel (EGK). To validate and illustrate the results of E2GK, we use a dataset provided by an original platform called PRONOSTIA dedicated to prognostics applications

Automated Detection of Electric Energy Consumption Load Profile Patterns

[EN] Load profiles of energy consumption from smart meters are becoming more and more available, and the amount of data to analyse is huge. In order to automate this analysis, the application of state-of-the-art data mining techniques for time series analysis is reviewed. In particular, the use of dynamic clustering techniques to obtain and visualise temporal patterns characterising the users of electrical energy is deeply studied. The performed review can be used as a guide for those interested in the automatic analysis and groups of behaviour detection within load profile databases. Additionally, a selection of dynamic clustering algorithms have been implemented and the performances compared using an available electric energy consumption load profile database. The results allow experts to easily evaluate how users consume energy, to assess trends and to predict future scenarios.The data analysed has been facilitated by the Spanish Distributor Iberdrola Electrical Distribution S.A. as part of the research project GAD (Active Management of the Demand), national project by DEVISE 2010 funded by the INGENIIO 2010 program and the CDTI (Centre for Industrial Technology Development), Business Public Entity dependent of the Ministry of Economy and Competitiveness of the Government of Spain.Benítez, I.; Diez, J. (2022). Automated Detection of Electric Energy Consumption Load Profile Patterns. Energies. 15(6):1-26. https://doi.org/10.3390/en1506217612615

Potential Impact of Rwanda Energy Plan on Carbon Emissions from Electricity Generation

Energy is indispensable to economic & social development and it improves lives. However, much of world’s energy is being produced and consumed in ways that could not be sustained if technology were to remain constant and if general quantities were to rise significantly. This research weighs the potential results of Rwanda energy power plan 2023/2024 that encourage the use of more advanced and sustainable energy sources, Specific attention is paid to renewable energy. This research focused on examining the carbon emission emitted through electricity generation from different energy sources and investigate carbon emission avoidance when a national energy plan is implemented. The government of Rwanda, through its power sector, has very ambitious targets to achieve 512 MW installed power generation capacity, from its current 264 MW power generation, and have universal access (100%) by 2023/24. Business as usual (BAU) scenario is used to analyze future electricity generation and CO2 emissions reduction in 2020-2024. The scenarios show the sustainable potential of renewable technologies and advanced technologies such as hydropower that can generate a significant portion of electricity and minimize the carbon emissions from the power sector. This research found that when Rwanda energy plan is implemented, there will be a carbon emission reduction of 18.3%. Hence, recommends policymakers and private sectors to invest in power energy production in Rwanda as there is a demand for electricity and business opportunities available in hydroelectricity production. Keywords: Carbon emission, Renewable energy, Electricity generation, Rwanda DOI: 10.7176/JESD/12-6-01 Publication date:March 31st 202

A Survey on Particle Swarm Optimization for Association Rule Mining

Association rule mining (ARM) is one of the core techniques of data mining to discover potentially valuable association relationships from mixed datasets. In the current research, various heuristic algorithms have been introduced into ARM to address the high computation time of traditional ARM. Although a more detailed review of the heuristic algorithms based on ARM is available, this paper differs from the existing reviews in that we expected it to provide a more comprehensive and multi-faceted survey of emerging research, which could provide a reference for researchers in the field to help them understand the state-of-the-art PSO-based ARM algorithms. In this paper, we review the existing research results. Heuristic algorithms for ARM were divided into three main groups, including biologically inspired, physically inspired, and other algorithms. Additionally, different types of ARM and their evaluation metrics are described in this paper, and the current status of the improvement in PSO algorithms is discussed in stages, including swarm initialization, algorithm parameter optimization, optimal particle update, and velocity and position updates. Furthermore, we discuss the applications of PSO-based ARM algorithms and propose further research directions by exploring the existing problems.publishedVersio