• Title/Summary/Keyword: index clustering

Search Result 323, Processing Time 0.032 seconds

DATA MINING-BASED MULTIDIMENSIONAL EXTRACTION METHOD FOR INDICATORS OF SOCIAL SECURITY SYSTEM FOR PEOPLE WITH DISABILITIES

  • BATYHA, RADWAN M.
    • Journal of applied mathematics & informatics
    • /
    • v.40 no.1_2
    • /
    • pp.289-303
    • /
    • 2022
  • This article examines the multidimensional index extraction method of the disability social security system based on data mining. While creating the data warehouse of the social security system for the disabled, we need to know the elements of the social security indicators for the disabled. In this context, a clustering algorithm was used to extract the indicators of the social security system for the disabled by investigating the historical dimension of social security for the disabled. The simulation results show that the index extraction method has high coverage, sensitivity and reliability. In this paper, a multidimensional extraction method is introduced to extract the indicators of the social security system for the disabled based on data mining. The simulation experiments show that the method presented in this paper is more reliable, and the indicators of social security system for the disabled extracted are more effective in practical application.

An Image Contrast Enhancement Technique Using Integrated Adaptive Fuzzy Clustering Model (IAFC 모델을 이용한 영상 대비 향상 기법)

  • 이금분;김용수
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2001.12a
    • /
    • pp.279-282
    • /
    • 2001
  • This paper presents an image contrast enhancement technique for improving the low contrast images using the improved IAFC(Integrated Adaptive Fuzzy Clustering) Model. The low pictorial information of a low contrast image is due to the vagueness or fuzziness of the multivalued levels of brightness rather than randomness. Fuzzy image processing has three main stages, namely, image fuzzification, modification of membership values, and image defuzzification. Using a new model of automatic crossover point selection, optimal crossover point is selected automatically. The problem of crossover point selection can be considered as the two-category classification problem. The improved MEC can classify the image into two classes with unsupervised teaming rule. The proposed method is applied to some experimental images with 256 gray levels and the results are compared with those of the histogram equalization technique. We utilized the index of fuzziness as a measure of image quality. The results show that the proposed method is better than the histogram equalization technique.

  • PDF

Design of Extended Multi-FNNs model based on HCM and Genetic Algorithm (HCM과 유전자 알고리즘에 기반한 확장된 다중 FNN 모델 설계)

  • Park, Ho-Sung;Oh, Sung-Kwun
    • Proceedings of the KIEE Conference
    • /
    • 2001.11c
    • /
    • pp.420-423
    • /
    • 2001
  • In this paper, the Multi-FNNs(Fuzzy-Neural Networks) architecture is identified and optimized using HCM(Hard C-Means) clustering method and genetic algorithms. The proposed Multi-FNNs architecture uses simplified inference and linear inference as fuzzy inference method and error back propagation algorithm as learning rules. Here, HCM clustering method, which is carried out for the process data preprocessing of system modeling, is utilized to determine the structure of Multi-FNNs according to the divisions of input-output space using I/O process data. Also, the parameters of Multi-FNNs model such as apexes of membership function, learning rates and momentum coefficients are adjusted using genetic algorithms. An aggregate performance index with a weighting factor is used to achieve a sound balance between approximation and generalization abilities of the model. To evaluate the performance of the proposed model we use the time series data for gas furnace and the NOx emission process data of gas turbine power plant.

  • PDF

Comparison of the Cluster Validation Techniques using Gene Expression Data (유전자 발현 자료를 이용한 군집 타당성분석 기법 비교)

  • Jeong, Yun-Kyoung;Baek, Jang-Sun
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2006.04a
    • /
    • pp.63-76
    • /
    • 2006
  • Several clustering algorithms to analyze gene expression data and cluster validation techniques that assess the quality of their outcomes, have been suggested, but evaluations of these cluster validation techniques have seldom been implemented. In this paper we compared various cluster validity indices for simulation data and real genomic data, and found that Dunn's index is more effective and robust through small simulations and with real gene expression data.

  • PDF

A New Algorithm for Unstable Mode Decision in the On-line Transient Stability Assessment (온라인 과도안정도 평가를 위한 새로운 불안정모드 선정 알고리즘)

  • Chang, Dong-Hwan;Kim, Jung-Woo;Chun, Yeong-Han
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.7
    • /
    • pp.1123-1128
    • /
    • 2008
  • The necessity of online dynamic security assessment is getting apparent under Electricity Market environments, as operation of power system is exposed to more various operating conditions. For on-line dynamic security assessment, fast transient stability analysis tool is required for contingency selection. The TEF(Transient Energy Function) method is a good candidate for this purpose. The clustering of critical generators is crucial for the precise and fast calculation of energy margin. In this paper, we propose a new method for fast decision of mode of instability by using stability indices and energy margin. The method is a new version of our previous paper.[1] Case studies are showing very promising results.

An Adaption of Pattern Sequence-based Electricity Load Forecasting with Match Filtering

  • Chu, Fazheng;Jung, Sung-Hwan
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.5
    • /
    • pp.800-807
    • /
    • 2017
  • The Pattern Sequence-based Forecasting (PSF) is an approach to forecast the behavior of time series based on similar pattern sequences. The innovation of PSF method is to convert the load time series into a label sequence by clustering technique in order to lighten computational burden. However, it brings about a new problem in determining the number of clusters and it is subject to insufficient similar days occasionally. In this paper we proposed an adaption of the PSF method, which introduces a new clustering index to determine the number of clusters and imposes a threshold to solve the problem caused by insufficient similar days. Our experiments showed that the proposed method reduced the mean absolute percentage error (MAPE) about 15%, compared to the PSF method.

Load Balancing of Heterogeneous Workstation Cluster based on Relative Load Index (상대적 부하 색인을 기반으로 한 이기종 워크스테이션 클러스터의 부하 균형)

  • Ji, Byoung-Jun;Lee, Kwang-Mo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.8 no.2
    • /
    • pp.183-194
    • /
    • 2002
  • The clustering environment with heterogeneous workstations provides the cost effectiveness and usability for executing applications in parallel. Load balancing is considered a necessary feature for a cluster of heterogeneous workstations to minimize the turnaround time. Previously, static load balancing that assigns a predetermined weight for the processing capability of each workstation, or dynamic approaches which execute a benchmark program to get relative processing capability of each workstation were proposed. The execution of the benchmark program, which has nothing to do with the application being executed, consumes the computation time and the overall turnaround time is delayed. In this paper, we present efficient methods for task distribution and task migration, based on the relative load index. We designed and implemented a load balancing system for the clustering environment with heterogeneous workstations. Turnaround times of our methods and the round-robin approach, as well as the load balancing method using a benchmark program, were compared. The experimental results show that our methods outperform all the other methods that we compared.

Policies of Trajectory Clustering in Index based on R-trees for Moving Objects (이동체를 위한 R-트리 기반 색인에서의 궤적 클러스터링 정책)

  • Ban ChaeHoon;Kim JinGon;Jun BongGi;Hong BongHee
    • The KIPS Transactions:PartD
    • /
    • v.12D no.4 s.100
    • /
    • pp.507-520
    • /
    • 2005
  • The R-trees are usually used for an index of trajectories in moving-objects databases. However, they need to access a number of nodes to trace same trajectories because of considering only a spatial proximity. Overlaps and dead spaces should be minimized to enhance the performance of range queries in moving-objects indexes. Trajectories of moving-objects should be preserved to enhance the performance of the trajectory queries. In this paper, we propose the TP3DR-tree(Trajectory Preserved 3DR-tree) using clusters of trajectories for range and trajectory queries. The TP3DR-tree uses two split policies: one is a spatial splitting that splits the same trajectory by clustering and the other is a time splitting that increases space utilization. In addition, we use connecting information in non-leaf nodes to enhance the performance of combined-queries. Our experiments show that the new index outperforms the others in processing queries on various datasets.

Anomaly Detection Analysis using Repository based on Inverted Index (역방향 인덱스 기반의 저장소를 이용한 이상 탐지 분석)

  • Park, Jumi;Cho, Weduke;Kim, Kangseok
    • Journal of KIISE
    • /
    • v.45 no.3
    • /
    • pp.294-302
    • /
    • 2018
  • With the emergence of the new service industry due to the development of information and communication technology, cyber space risks such as personal information infringement and industrial confidentiality leakage have diversified, and the security problem has emerged as a critical issue. In this paper, we propose a behavior-based anomaly detection method that is suitable for real-time and large-volume data analysis technology. We show that the proposed detection method is superior to existing signature security countermeasures that are based on large-capacity user log data according to in-company personal information abuse and internal information leakage. As the proposed behavior-based anomaly detection method requires a technique for processing large amounts of data, a real-time search engine is used, called Elasticsearch, which is based on an inverted index. In addition, statistical based frequency analysis and preprocessing were performed for data analysis, and the DBSCAN algorithm, which is a density based clustering method, was applied to classify abnormal data with an example for easy analysis through visualization. Unlike the existing anomaly detection system, the proposed behavior-based anomaly detection technique is promising as it enables anomaly detection analysis without the need to set the threshold value separately, and was proposed from a statistical perspective.

Evaluation of Smart Manufacturing Innovation Readiness of Domestic SMEs According to Maturity Model (성숙도 모델에 따른 국내 중소기업의 스마트제조혁신 준비도 평가)

  • Kyung-Ihl Kim
    • Journal of Industrial Convergence
    • /
    • v.21 no.1
    • /
    • pp.103-110
    • /
    • 2023
  • In this study, clustering analysis was performed to find out the influence of the maturity level of Industry 4.0 of SMEs in Korea, index factors of clustering, and major factors on the self-evaluation of companies. When 80 domestic SMEs were classified into 4 categories, it was found that there was a significant positive correlation between process, technology and organization. In addition, the majority of the 80 companies tested according to the maturity model appear to be immature or partially mature, and many improvements and re-evaluation of innovation strategies related to Industry 4.0 are needed. Finally, it was concluded that the Singapore Smart Industry Readiness Index is suitable for conducting self-assessment in domestic SMEs. These conclusions can serve as useful maturity and grouping guidelines for practitioners and researchers.