• Title/Summary/Keyword: Inter-clustering

Search Result 91, Processing Time 0.023 seconds

Table Clustering Using Inter-schema Association (스키마간 연관성을 이용한 테이블 군집화 기법)

  • 조순이;이도헌
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.04b
    • /
    • pp.85-87
    • /
    • 2001
  • 업무 데이터 분석을 통한 종합적인 의사결정을 지원할 수 있도록 데이터웨어하우스, OLAP, 데이터마이닝을 적용하려는 기업의 요구가 많아졌다. 그래서 기초 데이터의 이해, 선별, 수집, 가공, 정제가 매우 중요한 과정이나 테이블명 및 속성명이 표준화되어있지 않고 코드나 시스템 카탈로그와 같은 기본 데이터는 부정확하고 부족하다. 본 논문에서는 거의 스키마 정보에만 의존하여 테이블의 의미적 연관성에 근거한 유사한 특성을 가진 집단끼리 분류하는 대략적인 군집분석 방법을 제안한다. 질의 수행시 사용자가 설정한 임계 거리에 ㄸ라 관련된 군집만 검색함으로써 신속한 응답시간을 보장하고, 분석시점에서 다양한 질의에 유연하게 대처할 수 있다는 장점이 있다. 또한 실제 데이터에 본 연구를 적용하여 산출한 군집결과와 사람이 매뉴얼하게 그룹핑한 군집결과와 비교한다.

  • PDF

CHS : Cluster Head Self-election algorithm in WSNs (센서 네트워크에서 클러스터 헤드 자가 선출 알고리즘)

  • Choi, Koung-Jin;Jung, Suk-Moon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.534-537
    • /
    • 2009
  • Clustering protocol of Wireless sensor networks(WSNs) can not only reduce the volume of inter-node communication by the nodes's data aggregation but also extend the nodes's sleep times by cluster head's TDMA-schedule coordination. In order to extend the network lifetime of WSNs, we propose CHS algorithm to select cluster-head using three variables. It consists of initial and current energy of nodes, round information, and total numbers which have been selected as cluster head until current round.

  • PDF

Clustering Technique of Intelligent Distance Estimation for Mobile Ad-hoc Network (이동 Ad-hoc 통신을 위한 지능형 거리추정 클러스터방식)

  • Park, Ki-Hong;Shin, Seong-Yoon;Rhee, Yang-Won;Lee, Jong-Chan;Lee, Jin-Kwan;Jang, Hye-Sook
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.11
    • /
    • pp.105-111
    • /
    • 2009
  • The study aims to propose the intelligent clustering technique that calculates the distance by improving the problems of multi-hop clustering technique for inter-vehicular secure communications. After calculating the distance between vehicles with no connection for rapid transit and clustering it, the connection between nodes is created through a set distance vale. Header is selected by the distance value between nodes that become the identical members, and the information within a group is transmitted to the member nodes. After selecting the header, when the header is separated due to its mobility, the urgent situation may occur. At this time, the information transfer is prepared to select the new cluster header and transmit it through using the intelligent cluster provided from node by the execution of programs included in packet. The study proposes the cluster technique of the intelligent distance estimation for the mobile Ad-hoc network that calculates the cluster with the Store-Compute-Forward method that adds computing ability to the existing Store-and-Forward routing scheme. The cluster technique of intelligent distance estimation for the mobile Ad-hoc network suggested in the study is the active and intelligent multi-hop cluster routing protocol to make secure communications.

A STUDY OF MANDIBULAR DENIAL ARCH OF KOREAN ADULTS (한국 성인 유치악자의 하악 치열궁에 관한 조사)

  • Kim, Il-Han;Choi, Dae-Gyun
    • The Journal of Korean Academy of Prosthodontics
    • /
    • v.36 no.1
    • /
    • pp.166-182
    • /
    • 1998
  • The purposes of this study are to evaluate the Korean mandibular dental arch and classify the mandibular dental arch shape and size based on the incisal angle, canine angle, inter second molar width and height. In this study the mandibular study models were fabricated using irreversible hydrocolloid impression material from 225 volunteers with a mean age 23.62 (range 19-29). And the study models were measured with 3-dimensional measuring device and the mandibular dental arch was classified by means of K-means clustering method and visual inspection, then obtained data were analyzed with t-test for the statistical analysis. The results were as follows ; 1. The average canine height was 5.19mm(s.d. 1.17) in both sex, 5.34mm in male, and 4.95mnm in female. And the sexual difference was significant($0). 2. The average second molar height was 39.81mm(s.d. 2.44) in both sex, 40.19mm in male, and 39.21mm in female. And the sexual difference was significant($0). 3. The average inter-canine width was 27.16mm(s.d. 1.78) in both sex, 27.41mm in male, and 26.77mm in female. And the sexual difference was significant($0). 4. The average inter-first molar width was 46.93mm(s.d. 2.67) in both sex, 47.72mm in male, and 45.7mm in female. And the sexual difference was significant($0). 5. The inter-second molar width was average 56.09mm(s.d. 3.01) in both sex, 57.24mm in male, and 54.32mn in woma. And the sexual difference was significant($0). 6. The arch form was classified into three shapes based on the incisal and canine angle. V-shape showed $124.88^{\circ}$ of incisal angle and $141.64^{\circ}$ of canine angle, U-shape showed $152.76^{\circ}\;and\;125.35^{\circ}$, and O-shape showed $138.03^{\circ}\;and \;33.66^{\circ}$ respectively. Each shape distribution was that the V-shape was 14.2%, the U-Shape was 14.7%, and the O-shape was 71.1% of the 225 study models. 7. It was thought that the use of second molar width is more reasonable than height for classifying the dental arch size. The arch size was classified into four sizes based on the second molar width. Size 1 showed range of 42.24-48.23mm, size 2 showed 48.24-54.23mm, size 3 showed 54.24-60.23mm, and size 4 showed 60.24-66.23mm respectively. Each arch size distribution was that the size 1 was 1.3%, the size 2 was 27.1%, the size 3 was 63.6%, and the size 4 was 8.0% of the 225 study models.

  • PDF

Genetic characterization of microsporidians infecting Indian non-mulberry silkworms (Antheraea assamensis and Samia cynthia ricini) by using PCR based ISSR and RAPD markers assay

  • Hassan, Wazid;Nath, B. Surendra
    • International Journal of Industrial Entomology and Biomaterials
    • /
    • v.30 no.1
    • /
    • pp.6-16
    • /
    • 2015
  • This study established the genetic characterisation of 10 microsporidian isolates infecting non-mulberry silkworms (Antheraea assamensis and Samia cynthia ricini) collected from biogeographical forest locations in the State of Assam, India, using PCR-based markers assays: inter simple sequence repeat (ISSR) and random amplified polymorphic DNA (RAPD). A Nosema type species (NIK-1s_mys) was used as control for comparison. The shape of mature microsporidian spores were observed oval to elongated, measuring 3.80 to $4.90{\mu}m$ in length and 2.60 to $3.05{\mu}m$ in width. Fourteen ISSR primers generated reproducible profiles and yielded 178 fragments, of which 175 were polymorphic (98%), while 16 RAPD primers generated reproducible profiles with 198 amplified fragments displaying 95% of polymorphism. Estimation of genetic distance coefficients based on dice coefficients method and clustering with un-weighted pair group method using arithmetic average (UPGMA) analysis was done to unravel the genetic diversity of microsporidians infecting Indian muga and eri silkworm. The similarity coefficients varied from 0.385 to 0.941 in ISSR and 0.083 to 0.938 in RAPD data. UPGMA analysis generated dendrograms with two microsporidian groups, which appear to be different from each other. Based on Euclidean distance matrix method, 2-dimensional distribution also revealed considerable variability among different identified microsporidians. Clustering of these microsporidian isolates was in accordance with their host and biogeographic origin. Both techniques represent a useful and efficient tool for taxonomical grouping as well as for phylogenetic classification of different microsporidians in general and genotyping of these pathogens in particular.

Multiple Classifier Fusion Method based on k-Nearest Templates (k-최근접 템플릿기반 다중 분류기 결합방법)

  • Min, Jun-Ki;Cho, Sung-Bae
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.4
    • /
    • pp.451-455
    • /
    • 2008
  • In this paper, the k-nearest templates method is proposed to combine multiple classifiers effectively. First, the method decomposes training samples of each class into several subclasses based on the outputs of classifiers to represent a class as multiple models, and estimates a localized template by averaging the outputs for each subclass. The distances between a test sample and templates are then calculated. Lastly, the test sample is assigned to the class that is most frequently represented among the k most similar templates. In this paper, C-means clustering algorithm is used as the decomposition method, and k is automatically chosen according to the intra-class compactness and inter-class separation of a given data set. Since the proposed method uses multiple models per class and refers to k models rather than matches with the most similar one, it could obtain stable and high accuracy. In this paper, experiments on UCI and ELENA database showed that the proposed method performed better than conventional fusion methods.

Detection Algorithm of Social Community Structure based on Bluetooth Contact Data (블루투스 접촉 데이터를 이용한 사회관계구조 검출 알고리즘)

  • Binh, Nguyen Cong;Yoon, Seokhoon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.2
    • /
    • pp.75-82
    • /
    • 2017
  • In this paper, we consider social network analysis that focuses on community detection. Social networks embed community structure characteristics, i.e., a society can be partitioned into many social groups of individuals, with dense intra-group connections and much sparser inter-group connections. Exploring the community structure allows predicting as well as understanding individual's behaviors and interactions between people. In this paper, based on the interaction information extracted from a real-life Bluetooth contacts, we aim to reveal the social groups in a society of mobile carriers. Focusing on estimating the closeness of relationships between network entities through different similarity measurement methods, we introduce the clustering scheme to determine the underlying social structure. To evaluate our community detection method, we present the evaluation mechanism based on the basic properties of friendship.

Genetic diversity and population genetic structure of Cambodian indigenous chickens

  • Ren, Theary;Nunome, Mitsuo;Suzuki, Takayuki;Matsuda, Yoichi
    • Animal Bioscience
    • /
    • v.35 no.6
    • /
    • pp.826-837
    • /
    • 2022
  • Objective: Cambodia is located within the distribution range of the red junglefowl, the common ancestor of domestic chickens. Although a variety of indigenous chickens have been reared in Cambodia since ancient times, their genetic characteristics have yet to be sufficiently defined. Here, we conducted a large-scale population genetic study to investigate the genetic diversity and population genetic structure of Cambodian indigenous chickens and their phylogenetic relationships with other chicken breeds and native chickens worldwide. Methods: A Bayesian phylogenetic tree was constructed based on 625 mitochondrial DNA D-loop sequences, and Bayesian clustering analysis was performed for 666 individuals with 23 microsatellite markers, using samples collected from 28 indigenous chicken populations in 24 provinces and three commercial chicken breeds. Results: A total of 92 haplotypes of mitochondrial D-loop sequences belonging to haplogroups A to F and J were detected in Cambodian chickens; in the indigenous chickens, haplogroup D (44.4%) was the most common, and haplogroups A (21.0%) and B (13.2%) were also dominant. However, haplogroup J, which is rare in domestic chickens but abundant in Thai red junglefowl, was found at a high frequency (14.5%), whereas the frequency of haplogroup E was considerably lower (4.6%). Population genetic structure analysis based on microsatellite markers revealed the presence of three major genetic clusters in Cambodian indigenous chickens. Their genetic diversity was relatively high, which was similar to findings reported for indigenous chickens from other Southeast Asian countries. Conclusion: Cambodian indigenous chickens are characterized by mitochondrial D-loop haplotypes that are common to indigenous chickens throughout Southeast Asia, and may retain many of the haplotypes that originated from wild ancestral populations. These chickens exhibit high population genetic diversity, and the geographical distribution of three major clusters may be attributed to inter-regional trade and poultry transportation routes within Cambodia or international movement between Cambodia and other countries.

Assessment of Genetic Relationship among Watermelon Varieties Revealed by ISSR Marker (Inter-simple sequence repeat (ISSR) marker를 이용한 수박의 품종간 유연관계 분석)

  • Kwon Yong-Sham;Lee Won-Sik;Cho Il-Ho
    • Journal of Life Science
    • /
    • v.16 no.2 s.75
    • /
    • pp.219-224
    • /
    • 2006
  • Inter-simple sequence repeat (ISSR) analysis were used to assess genetic diversity among 18 genotypes of watermelon (Citrullus lanatus Thunb.) including breeding lines and commercial varieties. The 21 ISSR primers selected from 100 primers were showed the amplification of 105 reproducible fragments ranging from about 200 bp to 5000 bp. A total of 58 DNA fragments were polymorphic with an average 2.7 polymorphic bands per primer. The polymorphic primers were divided into 18 anchored primers and 3 non anchored primers. All of the anchored primers were di-nucleotide repeat motif, and was more polymorphic than non anchored primers. Eighteen watermelon genotypes were classified into two large groups. Clustering was in some accordance with the division of fruit shape into 18 watermelon. Therefore, ISSR markers may be suitable for variety discrimination and for constructing a linkage map of watermelon.

Scalable Collaborative Filtering Technique based on Adaptive Clustering (적응형 군집화 기반 확장 용이한 협업 필터링 기법)

  • Lee, O-Joun;Hong, Min-Sung;Lee, Won-Jin;Lee, Jae-Dong
    • Journal of Intelligence and Information Systems
    • /
    • v.20 no.2
    • /
    • pp.73-92
    • /
    • 2014
  • An Adaptive Clustering-based Collaborative Filtering Technique was proposed to solve the fundamental problems of collaborative filtering, such as cold-start problems, scalability problems and data sparsity problems. Previous collaborative filtering techniques were carried out according to the recommendations based on the predicted preference of the user to a particular item using a similar item subset and a similar user subset composed based on the preference of users to items. For this reason, if the density of the user preference matrix is low, the reliability of the recommendation system will decrease rapidly. Therefore, the difficulty of creating a similar item subset and similar user subset will be increased. In addition, as the scale of service increases, the time needed to create a similar item subset and similar user subset increases geometrically, and the response time of the recommendation system is then increased. To solve these problems, this paper suggests a collaborative filtering technique that adapts a condition actively to the model and adopts the concepts of a context-based filtering technique. This technique consists of four major methodologies. First, items are made, the users are clustered according their feature vectors, and an inter-cluster preference between each item cluster and user cluster is then assumed. According to this method, the run-time for creating a similar item subset or user subset can be economized, the reliability of a recommendation system can be made higher than that using only the user preference information for creating a similar item subset or similar user subset, and the cold start problem can be partially solved. Second, recommendations are made using the prior composed item and user clusters and inter-cluster preference between each item cluster and user cluster. In this phase, a list of items is made for users by examining the item clusters in the order of the size of the inter-cluster preference of the user cluster, in which the user belongs, and selecting and ranking the items according to the predicted or recorded user preference information. Using this method, the creation of a recommendation model phase bears the highest load of the recommendation system, and it minimizes the load of the recommendation system in run-time. Therefore, the scalability problem and large scale recommendation system can be performed with collaborative filtering, which is highly reliable. Third, the missing user preference information is predicted using the item and user clusters. Using this method, the problem caused by the low density of the user preference matrix can be mitigated. Existing studies on this used an item-based prediction or user-based prediction. In this paper, Hao Ji's idea, which uses both an item-based prediction and user-based prediction, was improved. The reliability of the recommendation service can be improved by combining the predictive values of both techniques by applying the condition of the recommendation model. By predicting the user preference based on the item or user clusters, the time required to predict the user preference can be reduced, and missing user preference in run-time can be predicted. Fourth, the item and user feature vector can be made to learn the following input of the user feedback. This phase applied normalized user feedback to the item and user feature vector. This method can mitigate the problems caused by the use of the concepts of context-based filtering, such as the item and user feature vector based on the user profile and item properties. The problems with using the item and user feature vector are due to the limitation of quantifying the qualitative features of the items and users. Therefore, the elements of the user and item feature vectors are made to match one to one, and if user feedback to a particular item is obtained, it will be applied to the feature vector using the opposite one. Verification of this method was accomplished by comparing the performance with existing hybrid filtering techniques. Two methods were used for verification: MAE(Mean Absolute Error) and response time. Using MAE, this technique was confirmed to improve the reliability of the recommendation system. Using the response time, this technique was found to be suitable for a large scaled recommendation system. This paper suggested an Adaptive Clustering-based Collaborative Filtering Technique with high reliability and low time complexity, but it had some limitations. This technique focused on reducing the time complexity. Hence, an improvement in reliability was not expected. The next topic will be to improve this technique by rule-based filtering.