• Title/Summary/Keyword: degree of clustering

Search Result 211, Processing Time 0.028 seconds

Mechanical behavior of prefabricated steel-concrete composite beams considering the clustering degree of studs

  • Gao, Yanmei;Fan, Liang;Yang, Weipeng;Shi, Lu;Zhou, Dan;Wang, Ming
    • Steel and Composite Structures
    • /
    • v.45 no.3
    • /
    • pp.425-436
    • /
    • 2022
  • The mechanical behaviors of the prefabricated steel-concrete composite beams are usually affected by the strength and the number of shear studs. Furthermore, the discrete degree of the arrangement for shear stud clusters, being defined as the clustering degree of shear stud λ in this paper, is an important factor for the mechanical properties of composite beams, even if the shear connection degree is unchanged. This paper uses an experimental and calculation method to investigate the influence of λ on the mechanical behavior of the composite beam. Five specimens (with different λ but having the same shear connection degree) of prefabricated composite beams are designed to study the ultimate supporting capacity, deformation, slip and shearing stiffness of composite beams. Experimental results are compared with the conventional slip calculation method (based on the influence of λ) of prefabricated composite beams. The results showed that the stiffness in the elastoplastic stage is reduced when λ is greater than 0.333, while the supporting capacity of beams has little affected by the change in λ. The slip distribution along the beam length tends to be zig-zagged due to the clustering of studs, and the slip difference increases with the increase of λ.

Improved Classification Algorithm using Extended Fuzzy Clustering and Maximum Likelihood Method

  • Jeon Young-Joon;Kim Jin-Il
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.447-450
    • /
    • 2004
  • This paper proposes remotely sensed image classification method by fuzzy c-means clustering algorithm using average intra-cluster distance. The average intra-cluster distance acquires an average of the vector set belong to each cluster and proportionates to its size and density. We perform classification according to pixel's membership grade by cluster center of fuzzy c-means clustering using the mean-values of training data about each class. Fuzzy c-means algorithm considered membership degree for inter-cluster of each class. And then, we validate degree of overlap between clusters. A pixel which has a high degree of overlap applies to the maximum likelihood classification method. Finally, we decide category by comparing with fuzzy membership degree and likelihood rate. The proposed method is applied to IKONOS remote sensing satellite image for the verifying test.

  • PDF

Privacy-Preserving Clustering on Time-Series Data Using Fourier Magnitudes (시계열 데이타 클러스터링에서 푸리에 진폭 기반의 프라이버시 보호)

  • Kim, Hea-Suk;Moon, Yang-Sae
    • Journal of KIISE:Databases
    • /
    • v.35 no.6
    • /
    • pp.481-494
    • /
    • 2008
  • In this paper we propose Fourier magnitudes based privacy preserving clustering on time-series data. The previous privacy-preserving method, called DFT coefficient method, has a critical problem in privacy-preservation itself since the original time-series data may be reconstructed from privacy-preserved data. In contrast, the proposed DFT magnitude method has an excellent characteristic that reconstructing the original data is almost impossible since it uses only DFT magnitudes except DFT phases. In this paper, we first explain why the reconstruction is easy in the DFT coefficient method, and why it is difficult in the DFT magnitude method. We then propose a notion of distance-order preservation which can be used both in estimating clustering accuracy and in selecting DFT magnitudes. Degree of distance-order preservation means how many time-series preserve their relative distance orders before and after privacy-preserving. Using this degree of distance-order preservation we present greedy strategies for selecting magnitudes in the DFT magnitude method. That is, those greedy strategies select DFT magnitudes to maximize the degree of distance-order preservation, and eventually we can achieve the relatively high clustering accuracy in the DFT magnitude method. Finally, we empirically show that the degree of distance-order preservation is an excellent measure that well reflects the clustering accuracy. In addition, experimental results show that our greedy strategies of the DFT magnitude method are comparable with the DFT coefficient method in the clustering accuracy. These results indicate that, compared with the DFT coefficient method, our DFT magnitude method provides the excellent degree of privacy-preservation as well as the comparable clustering accuracy.

Fuzzy Relevance-Based Clustering for Routing Performance Enhancement in Wireless Ad-Hoc Networks (무선 애드 혹 네트워크상에서 라우팅 성능 향상을 위한 퍼지 적합도 기반 클러스터링)

  • Lee, Chong-Deuk
    • Journal of Advanced Navigation Technology
    • /
    • v.14 no.4
    • /
    • pp.495-503
    • /
    • 2010
  • The clustering is an important mechanism thai provides information for mobile nodes efficiently and improves the processing capacity for routing and the allocation of bandwidth. This paper proposes a clustering scheme based on the fuzzy relevance degree to solve problems such as node distribution found in the dynamic property due to mobility and flat structure and to enhance the routing performance. The proposed scheme uses the fuzzy relevance degree, ${\alpha}$, to select the cluster head for clustering in FSV (Fuzzy State Viewing) structure. The fuzzy relevance ${\alpha}$ plays the role in CH selection that processes the clustering in FSV. The proposed clustering scheme is used to solve problems found in existing 1-hop and 2-hop clustering schemes. NS-2 simulator is used to verify the performance of the proposed scheme by simulation. In the simulation the proposed scheme is compared with schemes such as Lowest-ID, MOBIC, and SCA. The simulation result showed that the proposed scheme has better performance than the other existing compared schemes.

Fuzzy Technique-based Identification of Close and Distant Clusters in Clustering

  • Lee, Kyung-Mi;Lee, Keon-Myung
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.11 no.3
    • /
    • pp.165-170
    • /
    • 2011
  • Due to advances in hardware performance, user-friendly interfaces are becoming one of the major concerns in information systems. Linguistic conversation is a very natural way of human communications. Fuzzy techniques have been employed to liaison the discrepancy between the qualitative linguistic terms and quantitative computerized data. This paper deals with linguistic queries using clustering results on data sets, which are intended to retrieve the close clusters or distant clusters from the clustering results. In order to support such queries, a fuzzy technique-based method is proposed. The method introduces distance membership functions, namely, close and distant membership functions which transform the metric distance between two objects into the degree of closeness or farness, respectively. In order to measure the degree of closeness or farness between two clusters, both cluster closeness measure and cluster farness measure which incorporate distance membership function and cluster memberships are considered. For the flexibility of clustering, fuzzy clusters are assumed to be formed. This allows us to linguistically query close or distant clusters by constructing fuzzy relation based on the measures.

A Hybrid Recommendation System based on Fuzzy C-Means Clustering and Supervised Learning

  • Duan, Li;Wang, Weiping;Han, Baijing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.7
    • /
    • pp.2399-2413
    • /
    • 2021
  • A recommendation system is an information filter tool, which uses the ratings and reviews of users to generate a personalized recommendation service for users. However, the cold-start problem of users and items is still a major research hotspot on service recommendations. To address this challenge, this paper proposes a high-efficient hybrid recommendation system based on Fuzzy C-Means (FCM) clustering and supervised learning models. The proposed recommendation method includes two aspects: on the one hand, FCM clustering technique has been applied to the item-based collaborative filtering framework to solve the cold start problem; on the other hand, the content information is integrated into the collaborative filtering. The algorithm constructs the user and item membership degree feature vector, and adopts the data representation form of the scoring matrix to the supervised learning algorithm, as well as by combining the subjective membership degree feature vector and the objective membership degree feature vector in a linear combination, the prediction accuracy is significantly improved on the public datasets with different sparsity. The efficiency of the proposed system is illustrated by conducting several experiments on MovieLens dataset.

A Simulation Study on The Behavior Analysis of The Degree of Membership in Fuzzy c-means Method

  • Okazaki, Takeo;Aibara, Ukyo;Setiyani, Lina
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.4 no.4
    • /
    • pp.209-215
    • /
    • 2015
  • Fuzzy c-means method is typical soft clustering, and requires a degree of membership that indicates the degree of belonging to each cluster at the time of clustering. Parameter values greater than 1 and less than 2 have been used by convention. According to the proposed data-generation scheme and the simulation results, some behaviors in the degree of "fuzziness" was derived.

Identification of Fuzzy-Radial Basis Function Neural Network Based on Mountain Clustering (Mountain Clustering 기반 퍼지 RBF 뉴럴네트워크의 동정)

  • Choi, Jeoung-Nae;Oh, Sung-Kwun;Kim, Hyun-Ki
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.1 no.3
    • /
    • pp.69-76
    • /
    • 2008
  • This paper concerns Fuzzy Radial Basis Function Neural Network (FRBFNN) and automatic rule generation of extraction of the FRBFNN by means of mountain clustering. 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 (degree of membership) directly rely on the computation of the relevant distance between data points. Also, we consider high-order polynomial as the consequent part of fuzzy rules which represent input-output characteristic of sup-space. The number of clusters and the centers of clusters are automatically generated by using mountain clustering method based on the density of data. The centers of cluster which are obtained by using mountain clustering are used to determine a degree of membership and weighted least square estimator (WLSE) is adopted to estimate the coefficients of the consequent polynomial of fuzzy rules. The effectiveness of the proposed model have been investigated and analyzed in detail for the representative nonlinear function.

  • PDF

Improvement on Fuzzy C-Means Using Principal Component Analysis

  • Choi, Hang-Suk;Cha, Kyung-Joon
    • Journal of the Korean Data and Information Science Society
    • /
    • v.17 no.2
    • /
    • pp.301-309
    • /
    • 2006
  • In this paper, we show the improved fuzzy c-means clustering method. To improve, we use the double clustering as principal component analysis from objects which is located on common region of more than two clusters. In addition we use the degree of membership (probability) of fuzzy c-means which is the advantage. From simulation result, we find some improvement of accuracy in data of the probability 0.7 exterior and interior of overlapped area.

  • PDF

Clustering Analysis on Heart Rate Variation in Daytime Work

  • Hayashida, Yukuo;Kidou, Keiko;Mishima, Nobuo;Kitagawa, Keiko;Yoo, Jaesoo;Park, SunGyu;Oh, Yong-sun
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2017.05a
    • /
    • pp.257-258
    • /
    • 2017
  • Modern society tends to bring excessive labor to people and, therefore, further health management is required. In this paper, by using the clustering technique, one of machine learning methods, we try to bring out the measure of fatigue from heart rate (HR) variation during daytime work, helping people to get high-quality of healthy and calm life.

  • PDF