scholarly journals An Efficient Agglomerative Clustering Algorithm for Web Navigation Pattern Identification

2016 ◽  
Vol 07 (09) ◽  
pp. 2349-2356 ◽  
Author(s):  
A. Anitha
Keyword(s):  
Clustering Algorithm ◽  
Pattern Identification ◽  
Agglomerative Clustering ◽  
Web Navigation

scholarly journals Coastal Change Patterns from Time Series Clustering of Permanent Laser Scan Data

2020 ◽  
Author(s):  
Mieke Kuschnerus ◽  
Roderik Lindenbergh ◽  
Sander Vos
Keyword(s):  
Time Series ◽  
Laser Scanning ◽  
Clustering Algorithm ◽  
Coastal Areas ◽  
Small Scale ◽  
Temporal Data ◽  
Agglomerative Clustering ◽  
Data Set ◽  
Deformation Processes ◽  
Spatio Temporal

Abstract. Sandy coasts are constantly changing environments governed by complex interacting processes. Permanent laser scanning is a promising technique to monitor such coastal areas and support analysis of geomorphological deformation processes. This novel technique delivers 3D representations of a part of the coast at hourly temporal and centimetre spatial resolution and allows to observe small scale changes in elevation over extended periods of time. These observations have the potential to improve understanding and modelling of coastal deformation processes. However, to be of use to coastal researchers and coastal management, an efficient way to find and extract deformation processes from the large spatio-temporal data set is needed. In order to allow data mining in an automated way, we extract time series in elevation or range and use unsupervised learning algorithms to derive a partitioning of the observed area according to change patterns. We compare three well known clustering algorithms, k-means, agglomerative clustering and DBSCAN, and identify areas that undergo similar evolution during one month. We test if they fulfil our criteria for a suitable clustering algorithm on our exemplary data set. The three clustering methods are applied to time series of 30 epochs (during one month) extracted from a data set of daily scans covering a part of the coast at Kijkduin, the Netherlands. A small section of the beach, where a pile of sand was accumulated by a bulldozer is used to evaluate the performance of the algorithms against a ground truth. The k-means algorithm and agglomerative clustering deliver similar clusters, and both allow to identify a fixed number of dominant deformation processes in sandy coastal areas, such as sand accumulation by a bulldozer or erosion in the intertidal area. The DBSCAN algorithm finds clusters for only about 44 % of the area and turns out to be more suitable for the detection of outliers, caused for example by temporary objects on the beach. Our study provides a methodology to efficiently mine a spatio-temporal data set for predominant deformation patterns with the associated regions, where they occur.

Proactive Routing Mechanism for Removing Far Sensor in Iot using A Design of B * Index

2021 ◽  
Vol 11 ◽  
Author(s):  
S. Geetha ◽  
P. Deepalakshmi
Keyword(s):  
Clustering Algorithm ◽  
Research Work ◽  
Energy Utilization ◽  
Energy Separation ◽  
Agglomerative Clustering ◽  
Sensitive Data ◽  
Dynamic Selection ◽  
Storage And Retrieval ◽  
Proactive Routing ◽  
Iot Devices

Background:: The concern with the IoT node is energy since nodes are depleted as their energy utilization is incrementally reduced with reduction in far off nodes. The nodes will consume energy when it senses the data, followed with the Computation, and further for transmission. Method:: We proposed the phases for Energy-saving at nodes by Enhanced Agglomerative Clustering, Dynamic Selection of Leader, disposal of faraway sensor, and B * tree cloud storage and retrieval. In a typical IoT system, the nodes are deployed in the environment initially. Nodes are clustered using Enhanced Agglomerative Clustering Algorithm. A far node elimination will be implemented for the nodes not in the cluster region. Results:: By eliminating the need for far-off sensors, we can reduce the energy used. This in turn can also improve the lifetime of sensors. When appropriate, sensitive data is moved from IoT devices and stored in the cloud. Conclusion:: This paper also proposes an approach to fetch the data from IoT by using the Query Predicate method. This research work proposes a unique choice of grouping by estimating the parameters as energy, separation, thickness and portability.

scholarly journals Radar Emission Sources Identification Based on Hierarchical Agglomerative Clustering for Large Data Sets

2016 ◽  
Vol 2016 ◽  
pp. 1-9 ◽  
Author(s):  
Janusz Dudczyk
Keyword(s):  
Clustering Algorithm ◽  
Large Data ◽  
Large Data Sets ◽  
Emission Sources ◽  
Data Sets ◽  
Agglomerative Clustering ◽  
Distinctive Features ◽  
Identification Process ◽  
Hierarchical Agglomerative Clustering ◽  
Repetition Interval

More advanced recognition methods, which may recognize particular copies of radars of the same type, are called identification. The identification process of radar devices is a more specialized task which requires methods based on the analysis of distinctive features. These features are distinguished from the signals coming from the identified devices. Such a process is called Specific Emitter Identification (SEI). The identification of radar emission sources with the use of classic techniques based on the statistical analysis of basic measurable parameters of a signal such as Radio Frequency, Amplitude, Pulse Width, or Pulse Repetition Interval is not sufficient for SEI problems. This paper presents the method of hierarchical data clustering which is used in the process of radar identification. The Hierarchical Agglomerative Clustering Algorithm (HACA) based on Generalized Agglomerative Scheme (GAS) implemented and used in the research method is parameterized; therefore, it is possible to compare the results. The results of clustering are presented in dendrograms in this paper. The received results of grouping and identification based on HACA are compared with other SEI methods in order to assess the degree of their usefulness and effectiveness for systems of ESM/ELINT class.

scholarly journals Nonlinear multidimensional scaling and visualization of earthquake clusters over space, time and feature space

2005 ◽  
Vol 12 (1) ◽  
pp. 117-128 ◽  
Author(s):  
W. Dzwinel ◽  
D. A. Yuen ◽  
K. Boryczko ◽  
Y. Ben-Zion ◽  
S. Yoshioka ◽  
...  
Keyword(s):  
Clustering Algorithm ◽  
Synthetic Data ◽  
Feature Space ◽  
Seismic Events ◽  
Agglomerative Clustering ◽  
Local Cluster ◽  
Small Magnitude ◽  
Earthquake Parameters ◽  
Dimensional Scaling ◽  
Multi Dimensional Scaling

Abstract. We present a novel technique based on a multi-resolutional clustering and nonlinear multi-dimensional scaling of earthquake patterns to investigate observed and synthetic seismic catalogs. The observed data represent seismic activities around the Japanese islands during 1997-2003. The synthetic data were generated by numerical simulations for various cases of a heterogeneous fault governed by 3-D elastic dislocation and power-law creep. At the highest resolution, we analyze the local cluster structures in the data space of seismic events for the two types of catalogs by using an agglomerative clustering algorithm. We demonstrate that small magnitude events produce local spatio-temporal patches delineating neighboring large events. Seismic events, quantized in space and time, generate the multi-dimensional feature space characterized by the earthquake parameters. Using a non-hierarchical clustering algorithm and nonlinear multi-dimensional scaling, we explore the multitudinous earthquakes by real-time 3-D visualization and inspection of the multivariate clusters. At the spatial resolutions characteristic of the earthquake parameters, all of the ongoing seismicity both before and after the largest events accumulates to a global structure consisting of a few separate clusters in the feature space. We show that by combining the results of clustering in both low and high resolution spaces, we can recognize precursory events more precisely and unravel vital information that cannot be discerned at a single resolution.

scholarly journals A Similarity-Based Hierarchical Clustering Method for Manufacturing Process Models

2019 ◽  
Vol 11 (9) ◽  
pp. 2560
Author(s):  
Hyun Ahn ◽  
Tai-Woo Chang
Keyword(s):  
Hierarchical Clustering ◽  
Operations Management ◽  
Manufacturing Process ◽  
Manufacturing Industry ◽  
Clustering Algorithm ◽  
Process Models ◽  
Manufacturing Processes ◽  
Manufacturing Companies ◽  
Agglomerative Clustering ◽  
Clustering Method

As the adoption of information technologies increases in the manufacturing industry, manufacturing companies should efficiently manage their data and manufacturing processes in order to enhance their manufacturing competency. Because smart factories acquire processing data from connected machines, the business process management (BPM) approach can enrich the capability of manufacturing operations management. Manufacturing companies could benefit from the well-defined methodologies and process-centric engineering practices of this BPM approach for optimizing their manufacturing processes. Based on the approach, this paper proposes a similarity-based hierarchical clustering method for manufacturing processes. To this end, first we describe process modeling based on the BPM-compliant standard so that the manufacturing processes can be controlled by BPM systems. Second, we present similarity measures for manufacturing process models that serve as a criterion for the hierarchical clustering. Then, we formulate the hierarchical clustering problem and describe an agglomerative clustering algorithm using the measured similarities. Our contribution is considered on the assumption that a manufacturing company adopts the BPM approach and it operates various manufacturing processes. We expect that our method enables manufacturing companies to design and manage a vast amount of manufacturing processes at a coarser level, and it also can be applied to various process (re)engineering problems.

Research on NMF Based Hierarchical Clustering Methods

2010 ◽  
Vol 439-440 ◽  
pp. 1306-1311
Author(s):  
Fang Li ◽  
Qun Xiong Zhu
Keyword(s):  
Hierarchical Clustering ◽  
Clustering Algorithm ◽  
Clustering Methods ◽  
Agglomerative Clustering ◽  
Clustering Method ◽  
Hierarchical Agglomerative Clustering ◽  
Hierarchical Clustering Methods

LSI based hierarchical agglomerative clustering algorithm is studied. Aiming to the problems of LSI based hierarchical agglomerative clustering method, NMF based hierarchical clustering method is proposed and analyzed. Two ways of implementing NMF based method are introduced. Finally the result of two groups of experiment based on the TanCorp document corpora show that the method proposed is effective.

scholarly journals Design of an Unsupervised Machine Learning-Based Movie Recommender System

2020 ◽  
Author(s):  
Debby Cintia Ganesha Putri ◽  
Jenq-Shiou Leu ◽  
Pavel Seda
Keyword(s):  
Recommender System ◽  
Clustering Algorithm ◽  
System Development ◽  
Clustering Algorithms ◽  
Mean Shift ◽  
Computational Time ◽  
Agglomerative Clustering ◽  
Method Performance ◽  
Cluster Validity Indices ◽  
Validity Indices

This research aims to determine the similarities in groups of people to build a film recommender system for users. Users often have difficulty in finding suitable movies due to the increasing amount of movie information. The recommender system is very useful for helping customers choose a preferred movie with the existing features. In this study, the recommender system development is established by using several algorithms to obtain groupings, such as the K-Means algorithm, birch algorithm, mini-batch K-Means algorithm, mean-shift algorithm, affinity propagation algorithm, agglomerative clustering algorithm, and spectral clustering algorithm. We propose methods optimizing K so that each cluster may not significantly increase variance. We are limited to using groupings based on Genre and, Tags for movies. This research can discover better methods for evaluating clustering algorithms. To verify the quality of the recommender system, we adopted the mean square error (MSE), such as the Dunn Matrix and Cluster Validity Indices, and social network analysis (SNA), such as Degree Centrality, Closeness Centrality, and Betweenness Centrality. We also used Average Similarity, Computational Time, Association Rule with Apriori algorithm, and Clustering Performance Evaluation as evaluation measures to compare method performance of recommender systems using Silhouette Coefficient, Calinski-Harabaz Index, and Davies-Bouldin Index.

Sign in / Sign up

Export Citation Format

Share Document