• Title/Summary/Keyword: Clustering coefficient

Search Result 197, Processing Time 0.027 seconds

Digital Item Purchase Model in SNS Channel Applying Dynamic SNA and PVAR

  • LEE, Hee-Tae;JUNG, Bo-Hee
    • Journal of Distribution Science
    • /
    • v.18 no.3
    • /
    • pp.25-36
    • /
    • 2020
  • Purpose: Based on previous researches on social factors of digital item purchase in digital contents distribution platforms such as SNS, we aim to develop the integrated model that accounts for the dynamic and interactive relationship between social structure indicators and digital item purchase. Research design, data and methodology: A PVAR model was used to capture endogenous and dynamic relationships between digital item purchase and network indicators. Results: We find that there exist considerable endogenous and dynamic relationships between digital item purchase and network structure variables. Not only lagged in-degree and out-degree but also in-closeness and out-closeness centrality have significant and positive impacts on digital item purchase. Lagged clustering has a significant and negative effect on digital item purchase. Lagged purchase has a significant and positive impact just on the present in-closeness and out-closeness centrality; but there is no significant effect of lagged purchase on the other two degree variables and clustering coefficient. We also find that both closeness centralities have much higher carryover effect on digital item purchase and that the elasticity of both closeness centralities on the purchase of digital items is even higher than that of other network structure variables. Conclusions: In-closeness and out-closeness are the most influential factors among social structure variables of this study on digital item purchase.

Regional Extension of the Neural Network Model for Storm Surge Prediction Using Cluster Analysis (군집분석을 이용한 국지해일모델 지역확장)

  • Lee, Da-Un;Seo, Jang-Won;Youn, Yong-Hoon
    • Atmosphere
    • /
    • v.16 no.4
    • /
    • pp.259-267
    • /
    • 2006
  • In the present study, the neural network (NN) model with cluster analysis method was developed to predict storm surge in the whole Korean coastal regions with special focuses on the regional extension. The model used in this study is NN model for each cluster (CL-NN) with the cluster analysis. In order to find the optimal clustering of the stations, agglomerative method among hierarchical clustering methods was used. Various stations were clustered each other according to the centroid-linkage criterion and the cluster analysis should stop when the distances between merged groups exceed any criterion. Finally the CL-NN can be constructed for predicting storm surge in the cluster regions. To validate model results, predicted sea level value from CL-NN model was compared with that of conventional harmonic analysis (HA) and of the NN model in each region. The forecast values from NN and CL-NN models show more accuracy with observed data than that of HA. Especially the statistics analysis such as RMSE and correlation coefficient shows little differences between CL-NN and NN model results. These results show that cluster analysis and CL-NN model can be applied in the regional storm surge prediction and developed forecast system.

Tracking Detection using Information Granulation-based Fuzzy Radial Basis Function Neural Networks (정보입자기반 퍼지 RBF 뉴럴 네트워크를 이용한 트랙킹 검출)

  • Choi, Jeoung-Nae;Kim, Young-Il;Oh, Sung-Kwun;Kim, Jeong-Tae
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.12
    • /
    • pp.2520-2528
    • /
    • 2009
  • In this paper, we proposed tracking detection methodology using information granulation-based fuzzy radial basis function neural networks (IG-FRBFNN). According to IEC 60112, tracking device is manufactured and utilized for experiment. We consider 12 features that can be used to decide whether tracking phenomenon happened or not. These features are considered by signal processing methods such as filtering, Fast Fourier Transform(FFT) and Wavelet. Such some effective features are used as the inputs of the IG-FRBFNN, the tracking phenomenon is confirmed by using the IG-FRBFNN. The learning of the premise and the consequent part of rules in the IG-FRBFNN is carried out by Fuzzy C-Means (FCM) clustering algorithm and weighted least squares method (WLSE), respectively. Also, Hierarchical Fair Competition-based Parallel Genetic Algorithm (HFC-PGA) is exploited to optimize the IG-FRBFNN. Effective features to be selected and the number of fuzzy rules, the order of polynomial of fuzzy rules, the fuzzification coefficient used in FCM are optimized by the HFC-PGA. Tracking inference engine is implemented by using the LabVIEW and loaded into embedded system. We show the superb performance and feasibility of the tracking detection system through some experiments.

Empirical Comparison of Word Similarity Measures Based on Co-Occurrence, Context, and a Vector Space Model

  • Kadowaki, Natsuki;Kishida, Kazuaki
    • Journal of Information Science Theory and Practice
    • /
    • v.8 no.2
    • /
    • pp.6-17
    • /
    • 2020
  • Word similarity is often measured to enhance system performance in the information retrieval field and other related areas. This paper reports on an experimental comparison of values for word similarity measures that were computed based on 50 intentionally selected words from a Reuters corpus. There were three targets, including (1) co-occurrence-based similarity measures (for which a co-occurrence frequency is counted as the number of documents or sentences), (2) context-based distributional similarity measures obtained from a latent Dirichlet allocation (LDA), nonnegative matrix factorization (NMF), and Word2Vec algorithm, and (3) similarity measures computed from the tf-idf weights of each word according to a vector space model (VSM). Here, a Pearson correlation coefficient for a pair of VSM-based similarity measures and co-occurrence-based similarity measures according to the number of documents was highest. Group-average agglomerative hierarchical clustering was also applied to similarity matrices computed by individual measures. An evaluation of the cluster sets according to an answer set revealed that VSM- and LDA-based similarity measures performed best.

Morphometric Analyses on 24 Species (13 Families of Six Orders) of Korean Mammals (한국산 포유동물 24종(13과 6목)의 형태적 형질의 분석)

  • 고홍선
    • The Korean Journal of Zoology
    • /
    • v.32 no.1
    • /
    • pp.14-21
    • /
    • 1989
  • Four external and 22 cranial characters of 279 specimens representing 24 species of six orders of Korean mammals were measured. The data were analyzed by phenetic methods such as ordination as well as clustering techniques. Morphological distances were also calculated. Phenetic studies yield taxonomic placements of Siberian mink, Palearetic squirrel, and big white-toothed shrew which are incorrect. Morphological differences among Korean mammals at ordinal level in the taxonomic hierarchy are larger than those among other mammals: morphological differences below ordinal level are comparable to those among other mammals. Average taxonomic distances and morphological differences among Korean mammals at various levels in the taxonomic hierarchy are jointly monotonic, although the value of Pearson's product-moment correlation coefficient between average taxonomic distance matrix and morphological difference marrix is 0.59.

  • PDF

Seabed Sediment Classification Algorithm using Continuous Wavelet Transform

  • Lee, Kibae;Bae, Jinho;Lee, Chong Hyun;Kim, Juho;Lee, Jaeil;Cho, Jung Hong
    • Journal of Advanced Research in Ocean Engineering
    • /
    • v.2 no.4
    • /
    • pp.202-208
    • /
    • 2016
  • In this paper, we propose novel seabed sediment classification algorithm using feature obtained by continuous wavelet transform (CWT). Contrast to previous researches using direct reflection coefficient of seabed which is function of frequency and is highly influenced by sediment types, we develop an algorithm using both direct reflection signal and backscattering signal. In order to obtain feature vector, we employ CWT of the signal and obtain histograms extracted from local binary patterns of the scalogram. The proposed algorithm also adopts principal component analysis (PCA) to reduce dimension of the feature vector so that it requires low computational cost to classify seabed sediment. For training and classification, we adopts K-means clustering algorithm which can be done with low computational cost and does not require prior information of the sediment. To verify the proposed algorithm, we obtain field data measured at near Jeju island and show that the proposed classification algorithm has reliable discrimination performance by comparing the classification results with actual physical properties of the sediments.

Clustering and classification of residential noise sources in apartment buildings based on machine learning using spectral and temporal characteristics (주파수 및 시간 특성을 활용한 머신러닝 기반 공동주택 주거소음의 군집화 및 분류)

  • Jeong-hun Kim;Song-mi Lee;Su-hong Kim;Eun-sung Song;Jong-kwan Ryu
    • The Journal of the Acoustical Society of Korea
    • /
    • v.42 no.6
    • /
    • pp.603-616
    • /
    • 2023
  • In this study, machine learning-based clustering and classification of residential noise in apartment buildings was conducted using frequency and temporal characteristics. First, a residential noise source dataset was constructed . The residential noise source dataset was consisted of floor impact, airborne, plumbing and equipment noise, environmental, and construction noise. The clustering of residential noise was performed by K-Means clustering method. For frequency characteristics, Leq and Lmax values were derived for 1/1 and 1/3 octave band for each sound source. For temporal characteristics, Leq values were derived at every 6 ms through sound pressure level analysis for 5 s. The number of k in K-Means clustering method was determined through the silhouette coefficient and elbow method. The clustering of residential noise source by frequency characteristic resulted in three clusters for both Leq and Lmax analysis. Temporal characteristic clustered residential noise source into 9 clusters for Leq and 11 clusters for Lmax. Clustering by frequency characteristic clustered according to the proportion of low frequency band. Then, to utilize the clustering results, the residential noise source was classified using three kinds of machine learning. The results of the residential noise classification showed the highest accuracy and f1-score for data labeled with Leq values in 1/3 octave bands, and the highest accuracy and f1-score for classifying residential noise sources with an Artificial Neural Network (ANN) model using both frequency and temporal features, with 93 % accuracy and 92 % f1-score.

Genetic Optimization of Fuzzy C-Means Clustering-Based Fuzzy Neural Networks (FCM 기반 퍼지 뉴럴 네트워크의 진화론적 최적화)

  • Choi, Jeoung-Nae;Kim, Hyun-Ki;Oh, Sung-Kwun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.3
    • /
    • pp.466-472
    • /
    • 2008
  • The paper concerns Fuzzy C-Means clustering based fuzzy neural networks (FCM-FNN) and the optimization of the network is carried out by means of hierarchal fair competition-based parallel genetic algorithm (HFCPGA). FCM-FNN is the extended architecture of Radial Basis Function Neural Network (RBFNN). FCM algorithm is used to determine centers and widths of RBFs. In the proposed network, the membership functions of the premise part of fuzzy rules do not assume any explicit functional forms such as Gaussian, ellipsoidal, triangular, etc., so its resulting fitness values directly rely on the computation of the relevant distance between data points by means of FCM. Also, as the consequent part of fuzzy rules extracted by the FCM-FNN model, the order of four types of polynomials can be considered such as constant, linear, quadratic and modified quadratic. Since the performance of FCM-FNN is affected by some parameters of FCM-FNN such as a specific subset of input variables, fuzzification coefficient of FCM, the number of rules and the order of polynomials of consequent part of fuzzy rule, we need the structural as well as parametric optimization of the network. In this study, the HFCPGA which is a kind of multipopulation-based parallel genetic algorithms(PGA) is exploited to carry out the structural optimization of FCM-FNN. Moreover the HFCPGA is taken into consideration to avoid a premature convergence related to the optimization problems. The proposed model is demonstrated with the use of two representative numerical examples.

Structural Design of FCM-based Fuzzy Inference System : A Comparative Study of WLSE and LSE (FCM기반 퍼지추론 시스템의 구조 설계: WLSE 및 LSE의 비교 연구)

  • Park, Wook-Dong;Oh, Sung-Kwun;Kim, Hyun-Ki
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.59 no.5
    • /
    • pp.981-989
    • /
    • 2010
  • In this study, we introduce a new architecture of fuzzy inference system. In the fuzzy inference system, we use Fuzzy C-Means clustering algorithm to form the premise part of the rules. The membership functions standing in the premise part of fuzzy rules do not assume any explicit functional forms, but for any input the resulting activation levels of such radial basis functions directly depend upon the distance between data points by means of the Fuzzy C-Means clustering. As the consequent part of fuzzy rules of the fuzzy inference system (being the local model representing input output relation in the corresponding sub-space), four types of polynomial are considered, namely constant, linear, quadratic and modified quadratic. This offers a significant level of design flexibility as each rule could come with a different type of the local model in its consequence. Either the Least Square Estimator (LSE) or the weighted Least Square Estimator (WLSE)-based learning is exploited to estimate the coefficients of the consequent polynomial of fuzzy rules. In fuzzy modeling, complexity and interpretability (or simplicity) as well as accuracy of the obtained model are essential design criteria. The performance of the fuzzy inference system is directly affected by some parameters such as e.g., the fuzzification coefficient used in the FCM, the number of rules(clusters) and the order of polynomial in the consequent part of the rules. Accordingly we can obtain preferred model structure through an adjustment of such parameters of the fuzzy inference system. Moreover the comparative experimental study between WLSE and LSE is analyzed according to the change of the number of clusters(rules) as well as polynomial type. The superiority of the proposed model is illustrated and also demonstrated with the use of Automobile Miles per Gallon(MPG), Boston housing called Machine Learning dataset, and Mackey-glass time series dataset.

Nonlinear Inference Using Fuzzy Cluster (퍼지 클러스터를 이용한 비선형 추론)

  • Park, Keon-Jung;Lee, Dong-Yoon
    • Journal of Digital Convergence
    • /
    • v.14 no.1
    • /
    • pp.203-209
    • /
    • 2016
  • In this paper, we introduce a fuzzy inference systems for nonlinear inference using fuzzy cluster. Typically, the generation of fuzzy rules for nonlinear inference causes the problem that the number of fuzzy rules increases exponentially if the input vectors increase. To handle this problem, the fuzzy rules of fuzzy model are designed by dividing the input vector space in the scatter form using fuzzy clustering algorithm which expresses fuzzy cluster. From this method, complex nonlinear process can be modeled. The premise part of the fuzzy rules is determined by means of FCM clustering algorithm with fuzzy clusters. The consequence part of the fuzzy rules have four kinds of polynomial functions and the coefficient parameters of each rule are estimated by using the standard least-squares method. And we use the data widely used in nonlinear process for the performance and the nonlinear characteristics of the nonlinear process. Experimental results show that the non-linear inference is possible.