• Title/Summary/Keyword: phase clustering

Search Result 131, Processing Time 0.027 seconds

Functional hierarchical clustering using shape distance

  • Kyungmin Ahn
    • Communications for Statistical Applications and Methods
    • /
    • v.31 no.5
    • /
    • pp.601-612
    • /
    • 2024
  • A functional clustering analysis is a crucial machine learning technique in functional data analysis. Many functional clustering methods have been developed to enhance clustering performance. Moreover, due to the phase variability between functions, elastic functional clustering methods, such as applying the Fisher-Rao metric, which can manage phase variation during clustering, have been developed to improve model performance. However, aligning functions without considering the phase variation can distort functional information because phase variation can be a natural characteristic of functions. Hence, we propose a state-of-the-art functional hierarchical clustering that can manage phase and amplitude variations of functional data. This approach is based on the phase and amplitude separation method using the norm-preserving time warping of functions. Due to its invariance property, this representation provides robust variability for phase and amplitude components of functions and improves clustering performance compared to conventional functional hierarchical clustering models. We demonstrate this framework using simulated and real data.

Two Phase Hierarchical Clustering Algorithm for Group Formation in Data Mining (데이터 마이닝에서 그룹 세분화를 위한 2단계 계층적 글러스터링 알고리듬)

  • 황인수
    • Korean Management Science Review
    • /
    • v.19 no.1
    • /
    • pp.189-196
    • /
    • 2002
  • Data clustering is often one of the first steps in data mining analysis. It Identifies groups of related objects that can be used as a starling point for exploring further relationships. This technique supports the development of population segmentation models, such as demographic-based customer segmentation. This paper Purpose to present the development of two phase hierarchical clustering algorithm for group formation. Applications of the algorithm for product-customer group formation in customer relationahip management are also discussed. As a result of computer simulations, suggested algorithm outperforms single link method and k-means clustering.

Analysis of Mechanical Response of Two-phase Polycrystalline Microstructures with Distinctive Topology of Phase Clustering (2상 다결정 미세구조의 상 분포 위상에 따른 역학적 거동 분석)

  • Chung, Sang-Yeop;Han, Tong-Seok
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.24 no.1
    • /
    • pp.9-16
    • /
    • 2011
  • An approach to understand the phase distribution in a multi-phase polycrystalline material is important since it can affect material properties and mechanical behaviors. A proper method is needed to describe the phase distribution. For this purpose, contiguity and probability functions(two-point correlation and lineal-path functions) are investigated for representing the phase distributions of microstructures. The mechanical behaviors are evaluated using the finite element method. The characteristics of probability functions and mechanical reponses of virtual samples are represented. It is confirmed that the topology of phase clustering affects the mechanical behavior of materials and that the strength is reduced as the clustering size increases.

A Study on Three Phase Partial Discharge Pattern Classification with the Aid of Optimized Polynomial Radial Basis Function Neural Networks (최적화된 pRBF 뉴럴 네트워크에 이용한 삼상 부분방전 패턴분류에 관한 연구)

  • Oh, Sung-Kwun;Kim, Hyun-Ki;Kim, Jung-Tae
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.62 no.4
    • /
    • pp.544-553
    • /
    • 2013
  • In this paper, we propose the pattern classifier of Radial Basis Function Neural Networks(RBFNNs) for diagnosis of 3-phase partial discharge. Conventional methods map the partial discharge/noise data on 3-PARD map, and decide whether the partial discharge occurs or not from 3-phase or neutral point. However, it is decided based on his own subjective knowledge of skilled experter. In order to solve these problems, the mapping of data as well as the classification of phases are considered by using the general 3-PARD map and PA method, and the identification of phases occurring partial discharge/noise discharge is done. In the sequel, the type of partial discharge occurring on arbitrary random phase is classified and identified by fuzzy clustering-based polynomial Radial Basis Function Neural Networks(RBFNN) classifier. And by identifying the learning rate, momentum coefficient, and fuzzification coefficient of FCM fuzzy clustering with the aid of PSO algorithm, the RBFNN classifier is optimized. The virtual simulated data and the experimental data acquired from practical field are used for performance estimation of 3-phase partial discharge pattern classifier.

A Study on Web-User Clustering Algorithm for Web Personalization (웹 개인화를 위한 웹사용자 클러스터링 알고리즘에 관한 연구)

  • Lee, Hae-Kag
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.5
    • /
    • pp.2375-2382
    • /
    • 2011
  • The user clustering for web navigation pattern discovery is very useful to get preference and behavior pattern of users for web pages. In addition, the information by the user clustering is very essential for web personalization or customer grouping. In this paper, an algorithm for clustering the web navigation path of users is proposed and then some special navigation patterns can be recognized by the algorithm. The proposed algorithm has two clustering phases. In the first phase, all paths are classified into k-groups on the bases of the their similarities. The initial solution obtained in the first phase is not global optimum but it gives a good and feasible initial solution for the second phase. In the second phase, the first phase solution is improved by revising the k-means algorithm. In the revised K-means algorithm, grouping the paths is performed by the hyperplane instead of the distance between a path and a group center. Experimental results show that the proposed method is more efficient.

Areal Image Clustering using SOM with 2 Phase Learning (SOM의 2단계학습을 이용한 항공영상 클러스터링)

  • Lee, Kyunghee
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.995-998
    • /
    • 2013
  • Aerial imaging is one of the most common and versatile ways of obtaining information from the Earth surface. In this paper, we present an approach by SOM(Self Organization Map) algorithm with 2 phase learning to be applied successfully to aerial images clustering due to its signal-to-noise independency. A comparison with other classical method, such as K-means and traditional SOM, of real-world areal image clustering demonstrates the efficacy of our approach.

  • PDF

EETCA: Energy Efficient Trustworthy Clustering Algorithm for WSN

  • Senthil, T.;Kannapiran, Dr.B.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.11
    • /
    • pp.5437-5454
    • /
    • 2016
  • A Wireless Sensor Network (WSN) is composed of several sensor nodes which are severely restricted to energy and memory. Energy is the lifeblood of sensors and thus energy conservation is a critical necessity of WSN. This paper proposes a clustering algorithm namely Energy Efficient Trustworthy Clustering algorithm (EETCA), which focuses on three phases such as chief node election, chief node recycling process and bi-level trust computation. The chief node election is achieved by Dempster-Shafer theory based on trust. In the second phase, the selected chief node is recycled with respect to the current available energy. The final phase is concerned with the computation of bi-level trust, which is triggered for every time interval. This is to check the trustworthiness of the participating nodes. The nodes below the fixed trust threshold are blocked, so as to ensure trustworthiness. The system consumes lesser energy, as all the nodes behave normally and unwanted energy consumption is completely weeded out. The experimental results of EETCA are satisfactory in terms of reduced energy consumption and prolonged lifetime of the network.

Heterogeneity-aware Energy-efficient Clustering (HEC) Technique for WSNs

  • Sharma, Sukhwinder;Bansal, Rakesh Kumar;Bansal, Savina
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.4
    • /
    • pp.1866-1888
    • /
    • 2017
  • Efficient energy consumption in WSN is one of the key design issues for improving network stability period. In this paper, we propose a new Heterogeneity-aware Energy-efficient Clustering (HEC) technique which considers two types of heterogeneity - network lifetime and of sensor nodes. Selection of cluster head nodes is done based on the three network lifetime phases: only advanced nodes are allowed to become cluster heads in the initial phase; in the second active phase all nodes are allowed to participate in cluster head selection process with equal probability, and in the last dying out phase, clustering is relaxed by allowing direct transmission. Simulation-based performance analysis of the proposed technique as compared to other relevant techniques shows that HEC achieves longer stable region, improved throughput, and better energy dissipation owing to judicious consumption of additional energy of advanced nodes. On an average, the improvement observed for stability period over LEACH, SEP, FAIR and HEC- with SEP protocols is around 65%, 30%, 15% and 17% respectively. Further, the scalability of proposed technique is tested by varying the field size and number of sensing nodes. The results obtained are found to be quite optimistic. The impact of energy heterogeneity has also been assessed and it is found to improve the stability period though only upto a certain extent.

Approximate Fuzzy Clustering Based on Density Functions (밀도함수를 이용한 근사적 퍼지 클러스처링)

  • 권석호;손세호
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.10 no.4
    • /
    • pp.285-292
    • /
    • 2000
  • In general, exploratory data analysis consists of three processes: i) assessment of clustering tendency, ii) cluster analysis, and iii) cluster validation. This analysis method requiring a number of iterations of step ii) and iii) to converge is computationally inefficient. In this paper, we propose a density function-based approximate fuzzy clustering method with a hierachical structure which consosts of two phases: Phase I is a features(i.e., number of clusters and cluster centers) extraction process based on the tendency assessment of a given data and Phase II is a standard FCM with the cluster centers intialized by the results of the Phase I. Numerical examples are presented to show the validity of the proposed clustering method.

  • PDF

Fast Super-Resolution Algorithm Based on Dictionary Size Reduction Using k-Means Clustering

  • Jeong, Shin-Cheol;Song, Byung-Cheol
    • ETRI Journal
    • /
    • v.32 no.4
    • /
    • pp.596-602
    • /
    • 2010
  • This paper proposes a computationally efficient learning-based super-resolution algorithm using k-means clustering. Conventional learning-based super-resolution requires a huge dictionary for reliable performance, which brings about a tremendous memory cost as well as a burdensome matching computation. In order to overcome this problem, the proposed algorithm significantly reduces the size of the trained dictionary by properly clustering similar patches at the learning phase. Experimental results show that the proposed algorithm provides superior visual quality to the conventional algorithms, while needing much less computational complexity.