• Title/Summary/Keyword: index clustering

Search Result 323, Processing Time 0.025 seconds

Correlation Analysis between Injury Index of Multi-cell Headrest through k-means Clustering DB (k-means clustering DB를 통한 Multi-cell headrest의 상해지수 간 상관관계 분석)

  • Sungwook Cho;Seong S. Cheon
    • Composites Research
    • /
    • v.37 no.1
    • /
    • pp.46-52
    • /
    • 2024
  • The development of transportation methods has improved human transportation convenience and made it possible to expand the travel radius of people with disabilities who have difficulty moving. However, in the case of WAV (wheelchair Accessible Vehicle), the safety that may occur in a vehicle accident is still lower than that of regular passenger seats. In particular, in the case of a rear-end collision that may occur in a defenseless situation, it can cause fatal neck injuries to disabled passengers. Therefore, a more detailed design plan must be reflected in the headrest to be applied to WAV. In this study, a multi-cell headrest was proposed to implement local compression characteristic distribution of the headrest during rear-end collision of WAV. Afterwards, a correlation analysis was performed between the passenger's NIC (Neck Injury Criterion) and impact energy absorption using the data set construction through analysis and the clustering results using k-means clustering. As a result of clustering, it was confirmed that data clusters with similar characteristics were formed, and a correlation analysis between NIC and impact energy absorption through the characteristics of each cluster was performed. As a result of the analysis, it was confirmed that the softer the cell compression characteristics in Mid3 and Mid6, the more impact energy absorption increases, and the harder the cell compression characteristics in Front2, Mid3, and Mid6, the more effective it is in reducing NIC.

A Big Data Analysis by Between-Cluster Information using k-Modes Clustering Algorithm (k-Modes 분할 알고리즘에 의한 군집의 상관정보 기반 빅데이터 분석)

  • Park, In-Kyoo
    • Journal of Digital Convergence
    • /
    • v.13 no.11
    • /
    • pp.157-164
    • /
    • 2015
  • This paper describes subspace clustering of categorical data for convergence and integration. Because categorical data are not designed for dealing only with numerical data, The conventional evaluation measures are more likely to have the limitations due to the absence of ordering and high dimensional data and scarcity of frequency. Hence, conditional entropy measure is proposed to evaluate close approximation of cohesion among attributes within each cluster. We propose a new objective function that is used to reflect the optimistic clustering so that the within-cluster dispersion is minimized and the between-cluster separation is enhanced. We performed experiments on five real-world datasets, comparing the performance of our algorithms with four algorithms, using three evaluation metrics: accuracy, f-measure and adjusted Rand index. According to the experiments, the proposed algorithm outperforms the algorithms that were considered int the evaluation, regarding the considered metrics.

Comparison of journal clustering methods based on citation structure (논문 인용에 따른 학술지 군집화 방법의 비교)

  • Kim, Jinkwang;Kim, Sohyung;Oh, Changhyuck
    • Journal of the Korean Data and Information Science Society
    • /
    • v.26 no.4
    • /
    • pp.827-839
    • /
    • 2015
  • Extraction of communities from a journal citation database by the citation structure is a useful tool to see closely related groups of the journals. SCI of Thomson Reuters or SCOPUS of Elsevier have had tried to grasp community structure of the journals in their indices according to citation relationships, but such a trial has not been made yet with the Korean Citation Index, KCI. Therefore, in this study, we extracted communities of the journals of the natural science area in KCI, using various clustering algorithms for a social network based on citations among the journals and compared the groups obtained with the classfication of KCI. The infomap algorithm, one of the clustering methods applied in this article, showed the best grouping result in the sense that groups obtained by it are closer to the KCI classification than by other algorithms considered and reflect well the citation structure of the journals. The classification results obtained in this study might be taken consideration when reclassification of the KCI journals will be made in the future.

A Comparison of Cluster Analyses and Clustering of Sensory Data on Hanwoo Bulls (군집분석 비교 및 한우 관능평가데이터 군집화)

  • Kim, Jae-Hee;Ko, Yoon-Sil
    • The Korean Journal of Applied Statistics
    • /
    • v.22 no.4
    • /
    • pp.745-758
    • /
    • 2009
  • Cluster analysis is the automated search for groups of related observations in a data set. To group the observations into clusters many techniques has been proposed, and a variety measures aimed at validating the results of a cluster analysis have been suggested. In this paper, we compare complete linkage, Ward's method, K-means and model-based clustering and compute validity measures such as connectivity, Dunn Index and silhouette with simulated data from multivariate distributions. We also select a clustering algorithm and determine the number of clusters of Korean consumers based on Korean consumers' palatability scores for Hanwoo bull in BBQ cooking method.

A study on searching image by cluster indexing and sequential I/O (연속적 I/O와 클러스터 인덱싱 구조를 이용한 이미지 데이타 검색 연구)

  • Kim, Jin-Ok;Hwang, Dae-Joon
    • The KIPS Transactions:PartD
    • /
    • v.9D no.5
    • /
    • pp.779-788
    • /
    • 2002
  • There are many technically difficult issues in searching multimedia data such as image, video and audio because they are massive and more complex than simple text-based data. As a method of searching multimedia data, a similarity retrieval has been studied to retrieve automatically basic features of multimedia data and to make a search among data with retrieved features because exact match is not adaptable to a matrix of features of multimedia. In this paper, data clustering and its indexing are proposed as a speedy similarity-retrieval method of multimedia data. This approach clusters similar images on adjacent disk cylinders and then builds Indexes to access the clusters. To minimize the search cost, the hashing is adapted to index cluster. In addition, to reduce I/O time, the proposed searching takes just one I/O to look up the location of the cluster containing similar object and one sequential file I/O to read in this cluster. The proposed schema solves the problem of multi-dimension by using clustering and its indexing and has higher search efficiency than the content-based image retrieval that uses only clustering or indexing structure.

Multi-FNN Identification Based on HCM Clustering and Evolutionary Fuzzy Granulation

  • Park, Ho-Sung;Oh, Sung-Kwun
    • International Journal of Control, Automation, and Systems
    • /
    • v.1 no.2
    • /
    • pp.194-202
    • /
    • 2003
  • In this paper, we introduce a category of Multi-FNN (Fuzzy-Neural Networks) models, analyze the underlying architectures and propose a comprehensive identification framework. The proposed Multi-FNNs dwell on a concept of fuzzy rule-based FNNs based on HCM clustering and evolutionary fuzzy granulation, and exploit linear inference being treated as a generic inference mechanism. By this nature, this FNN model is geared toward capturing relationships between information granules known as fuzzy sets. The form of the information granules themselves (in particular their distribution and a type of membership function) becomes an important design feature of the FNN model contributing to its structural as well as parametric optimization. The identification environment uses clustering techniques (Hard C - Means, HCM) and exploits genetic optimization as a vehicle of global optimization. The global optimization is augmented by more refined gradient-based learning mechanisms such as standard back-propagation. The HCM algorithm, whose role is to carry out preprocessing of the process data for system modeling, is utilized to determine the structure of Multi-FNNs. The detailed parameters of the Multi-FNN (such as apexes of membership functions, learning rates and momentum coefficients) are adjusted using genetic algorithms. An aggregate performance index with a weighting factor is proposed in order to achieve a sound balance between approximation and generalization (predictive) abilities of the model. To evaluate the performance of the proposed model, two numeric data sets are experimented with. One is the numerical data coming from a description of a certain nonlinear function and the other is NOx emission process data from a gas turbine power plant.

Development of Sasang Type Diagnostic Test with Neural Network (신경망을 사용한 사상체질 진단검사 개발 연구)

  • Chae, Han;Hwang, Sang-Moon;Eom, Il-Kyu;Kim, Byoung-Chul;Kim, Young-In;Kim, Byung-Joo;Kwon, Young-Kyu
    • Journal of Physiology & Pathology in Korean Medicine
    • /
    • v.23 no.4
    • /
    • pp.765-771
    • /
    • 2009
  • The medical informatics for clustering Sasang types with collected clinical data is important for the personalized medicine, but it has not been thoroughly studied yet. The purpose of this study was to examine the usefulness of neural network data mining algorithm for traditional Korean medicine. We used Kohonen neural network, the Self-Organizing Map (SOM), for the analysis of biomedical information following data pre-processing and calculated the validity index as percentage correctly predicted and type-specific sensitivity. We can extract 12 data fields from 30 after data pre-processing with correlation analysis and latent functional relationship analysis. The profile of Myers-Briggs Type Inidcator and Bio-Impedance Analysis data which are clustered with SOM was similar to that of original measurements. The percentage correctly predicted was 56%, and sensitivity for So-Yang, Tae-Eum and So-Eum type were 56%, 48%, and 61%, respectively. This study showed that the neural network algorithm for clustering Sasang types based on clinical data is useful for the sasang type diagnostic test itself. We discussed the importance of data pre-processing and clustering algorithm for the validity of medical devices in traditional Korean medicine.

Potentials of Regional Clustering: the Case of Food Industry at Gyeongsangnam-Do (식품 클러스터의 잠재성 분석: 경남지역을 중심으로)

  • Kim, Sung-Yong;Ahn, Byung-Il;Kim, Yun-Shik;Lee, Mi-Sook;Nam, Kyung-Soo;Gil, Su-Min
    • Journal of agriculture & life science
    • /
    • v.43 no.6
    • /
    • pp.117-127
    • /
    • 2009
  • There are worldwidely rising interests in food cluster as it has been perceived as a strategy for improving the competitiveness of food industry. This paper examines the potential of food industry at Gyeongsangnam-do for a regional clustering in terms of five cluster indices. These indices include the absolute size, the relative size of food industry, the level of its concentration, specialization, and market power exertion as an industrial cluster. The result shows that food industry at Gyeongsangnam-do has a potential for a regional clustering.

Extraction and Indexing Representative Melodies Considering Musical Composition Forms for Content-based Music Information Retrievals (내용 기반 음악 정보 검색을 위한 음악 구성 형식을 고려한 대표 선율의 추출 및 색인)

  • Ku, Kyong-I;Lim, Sang-Hyuk;Lee, Jae-Heon;Kim, Yoo-Sung
    • The KIPS Transactions:PartD
    • /
    • v.11D no.3
    • /
    • pp.495-508
    • /
    • 2004
  • Recently, in content-based music information retrieval systems, to enhance the response time of retrieving music data from large music database, some researches have adopted the indexing mechanism that extracts and indexes the representative melodies. The representative melody of music data must stand for the music itself and have strong possibility to use as users' input queries. However, since the previous researches have not considered the musical composition forms, they are not able to correctly catch the contrast, repetition and variation of motif in musical forms. In this paper, we use an index automatically constructed from representative melodies such like first melody, climax melodies and similarly repeated theme melodies. At first, we expand the clustering algorithm in order to extract similarly repeated theme melodies based on the musical composition forms. If the first melody and climax melodies are not included into the representative melodies of music by the clustering algorithm, we add them into representative melodies. We implemented a prototype system and did experiments on comparison the representative melody index with other melody indexes. Since, we are able to construct the representative melody index with the lower storage by 34% than whole melody index, the response time can be decreased. Also, since we include first melody and climax melody which have the strong possibility to use as users' input query into representative melodies, we are able to get the more correct results against the various users' input queries than theme melody index with the cost of storage overhead of 20%.

Multi-FNN Identification by Means of HCM Clustering and ITs Optimization Using Genetic Algorithms (HCM 클러스터링에 의한 다중 퍼지-뉴럴 네트워크 동정과 유전자 알고리즘을 이용한 이의 최적화)

  • 오성권;박호성
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.10 no.5
    • /
    • pp.487-496
    • /
    • 2000
  • In this paper, the Multi-FNN(Fuzzy-Neural Networks) model is identified and optimized using HCM(Hard C-Means) clustering method and genetic algorithms. The proposed Multi-FNN is based on Yamakawa's FNN and uses simplified inference as fuzzy inference method and error back propagation algorithm as learning rules. We use a HCM clustering and Genetic Algorithms(GAs) to identify both the structure and the parameters of a Multi-FNN model. Here, HCM clustering method, which is carried out for the process data preprocessing of system modeling, is utilized to determine the structure of Multi-FNN according to the divisions of input-output space using I/O process data. Also, the parameters of Multi-FNN model such as apexes of membership function, learning rates and momentum coefficients are adjusted using genetic algorithms. A aggregate performance index with a weighting factor is used to achieve a sound balance between approximation and generalization abilities of the model. The aggregate performance index stands for an aggregate objective function with a weighting factor to consider a mutual balance and dependency between approximation and predictive abilities. According to the selection and adjustment of a weighting factor of this aggregate abjective function which depends on the number of data and a certain degree of nonlinearity, we show that it is available and effective to design an optimal Multi-FNN model. To evaluate the performance of the proposed model, we use the time series data for gas furnace and the numerical data of nonlinear function.

  • PDF