• Title/Summary/Keyword: clustering problem

Search Result 709, Processing Time 0.03 seconds

Balanced Cluster-based Multi-hop Routing in Sensor Networks (센서 네트워크의 균등분포 클러스터 기반 멀티홉 라우팅)

  • Wu, Mary
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.5
    • /
    • pp.910-917
    • /
    • 2016
  • Sensors have limited resources in sensor networks, so efficient use of energy is important. Representative clustering methods, LEACH, LEACHC, TEEN generally use direct transmission methods from cluster headers to the sink node to pass collected data. However, the communication distance of the sensor nodes at low cost and at low power is not long, it requires a data transfer through the multi-hop to transmit data to the sink node. In the existing cluster-based sensor network studies, cluster process and route selection process are performed separately in order to configure the routing path to the sink node. In this paper, in order to use the energy of the sensor nodes that have limited resources efficiently, a cluster-based multi-hop routing protocol which merges the clustering process and routing process is proposed. And the proposed method complements the problem of uneven cluster creation that may occur in probabilistic cluster methods and increases the energy efficiency of whole sensor nodes.

The Clustering of Parts with Qualitative and Quantitative Quality Properties using λ-Fuzzy Measure (λ-퍼지측도를 사용한 질적, 양적혼합품질특성을 가진 부품의 군집화)

  • Kim, Jeong-Man;Lee, Sang-Do
    • Journal of Korean Society for Quality Management
    • /
    • v.24 no.1
    • /
    • pp.126-136
    • /
    • 1996
  • In multi-item production system, GT(Group Technology) is used effectively in order to cluster various parts into groups. GT is based on clustering parts which have similar features, and these features are classified into two properties, namely crisp(quantitative) feature and fuzzy(qualitative) feature. Especially, many difficult problems are often faced that have to evaluate the properties of parts with the crisp and fuzzy feature together. As the basis of determining the similarity of inter-parts, in this method, one aggregate value is calculated on each part. However, because the above aggregate value is only gained from simple additive weighted sum, there is one problem in this method that has been handled the combination effect of inter-parts. For these reasons, in this paper, a proposed method is suggested for representing combination effect in order to cluster parts that have crisp and fuzzy properties into groups using ${\lambda}$-fuzzy measure and fuzzy integral.

  • PDF

Improved Connectivity-Based Reliable Multicast MAC Protocol for IEEE 802.11 Wireless LANs (IEEE 802.11 무선랜에서 신뢰성 있는 멀티캐스트 전송을 위한 연결정보 기반의 효율적인 MAC 프로토콜)

  • Choi, Woo-Yong
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.36 no.2
    • /
    • pp.94-100
    • /
    • 2010
  • The reliable multicast MAC (Medium Access Control) protocol is needed to guarantee the recipients' nonerroneous reception of the multicast data frames, which can be transmitted by the AP (Access Point) in infrastructure mode IEEE 802.11 wireless LANs. Enhancing the BMMM (Batch Mode Multicast MAC) protocol, in the literature, the connectivity-based reliable multicast MAC protocol was proposed to reduce the RAK (Request for ACKnowledgement) frame transmissions and enhance the multicast MAC performance. However, the number of necessary RAK frame transmissions increases as the number of multicast recipients increases. To alleviate the problem of the larger number of RAK frame transmissions with the larger number of multicast recipients, we propose the clustering algorithm for partitioning the recipients into a small number of clusters, so that the recipients are connected each other within the same clusters. Numerical examples are presented to show the reliable multicast MAC performance improvement by the clustering algorithm.

A Novel Similarity Measure for Sequence Data

  • Pandi, Mohammad. H.;Kashefi, Omid;Minaei, Behrouz
    • Journal of Information Processing Systems
    • /
    • v.7 no.3
    • /
    • pp.413-424
    • /
    • 2011
  • A variety of different metrics has been introduced to measure the similarity of two given sequences. These widely used metrics are ranging from spell correctors and categorizers to new sequence mining applications. Different metrics consider different aspects of sequences, but the essence of any sequence is extracted from the ordering of its elements. In this paper, we propose a novel sequence similarity measure that is based on all ordered pairs of one sequence and where a Hasse diagram is built in the other sequence. In contrast with existing approaches, the idea behind the proposed sequence similarity metric is to extract all ordering features to capture sequence properties. We designed a clustering problem to evaluate our sequence similarity metric. Experimental results showed the superiority of our proposed sequence similarity metric in maximizing the purity of clustering compared to metrics such as d2, Smith-Waterman, Levenshtein, and Needleman-Wunsch. The limitation of those methods originates from some neglected sequence features, which are considered in our proposed sequence similarity metric.

Unsupervised Image Classification for Large Remotely-sensed Imagery using Regiongrowing Segmentation

  • Lee, Sang-Hoon
    • Proceedings of the KSRS Conference
    • /
    • v.1
    • /
    • pp.188-190
    • /
    • 2006
  • A multistage hierarchical clustering technique, which is an unsupervised technique, was suggested in this paper for classifying large remotely-sensed imagery. The multistage algorithm consists of two stages. The local segmentor of the first stage performs regiongrowing segmentation by employing the hierarchical clustering procedure of CN-chain with the restriction that pixels in a cluster must be spatially contiguous. This stage uses a sliding window strategy with boundary blocking to alleviate a computational problem in computer memory for an enormous data. The global segmentor of the second stage has not spatial constraints for merging to classify the segments resulting from the previous stage. The experimental results show that the new approach proposed in this study efficiently performs the segmentation for the images of very large size and an extensive number of bands

  • PDF

Recycling Cell Formation using Group Technology for Disposal Products (그룹 데크놀로지 기법을 이용한 폐제품의 리싸이클링 셀 형성)

  • 서광규;김형준
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2000.05a
    • /
    • pp.111-123
    • /
    • 2000
  • The recycling cell formation problem means that disposal products are classified into recycling part families using group technology in their end of life phase. Disposal products have the uncertainties of product status by usage influences. Recycling cells are formed considering design, process and usage attributes. In this paper, a novel approach to the design of cellular recycling system is proposed, which deals with the recycling cell formation and assignment of identical products concurrently. Fuzzy clustering algorithm and Fuzzy-ART neural network are applied to describe the states of disposal product with the membership functions and to make recycling cell formation. This approach leads to recycling and reuse of the materials, components, and subassemblies and can evaluate the value at each cell of disposal products. Application examples are illustrated by disposal refrigerators, compared fuzzy clustering with Fuzzy-ART neural network performance in cell formation.

  • PDF

Classification of C. elegans Behavioral Phenotypes Using Clustering (클러스터링을 이용한 C. elegans 행동표현형 분류)

  • Nah, Won;Baek, Joong-Hwan
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.1743-1746
    • /
    • 2003
  • C. elegans often used to study of function of gene, but it is difficult for human observation to distinguish the mutants of C. elegans. To solve this problem, the system, which can be classified automatically using the computer vision, is studying now. In the previous works , they described the auto-tracking system and the egg-laying timing modeling, which are used to automated-classily system. In this paper, we use three kinds of features, which are related to movement , size and posture of the worm, and each feature is described mathematically and normalized. In experimental result, we validated the features for the hierarchical clustering, And we used the Calinski and Harabasz's method to find the appropriate cluster number.

  • PDF

A Vehicle Routing Model for Multi-Supply Centers Based on Lp-Distance (일반거리산정방법을 이용한 다-물류센터의 최적 수송경로 계획 모델)

  • Hwang, Heung-Suk
    • IE interfaces
    • /
    • v.11 no.1
    • /
    • pp.85-95
    • /
    • 1998
  • This study is focussed on an optimal vehicle routing model for multi-supply centers in two-echelon logistic system. The aim of this study is to deliver goods for demand sites with optimal decision. This study investigated an integrated model using step-by-step approach based on relationship that exists between the inventory allocation and vehicle routing with restricted amount of inventory and transportations such as the capability of supply centers, vehicle capacity and transportation parameters. Three sub-models are developed: 1) sector-clustering model, 2) a vehicle-routing model based on clustering and a heuristic algorithm, and 3) a vehicle route scheduling model using TSP-solver based on genetic and branch-and-bound algorithm. Also, we have developed computer programs for each sub-models and user interface with visualization for major inputs and outputs. The application and superior performance of the proposed model are demonstrated by several sample runs for the inventory-allocation and vehicle routing problems.

  • PDF

A Data Mining Procedure for Unbalanced Binary Classification (불균형 이분 데이터 분류분석을 위한 데이터마이닝 절차)

  • Jung, Han-Na;Lee, Jeong-Hwa;Jun, Chi-Hyuck
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.36 no.1
    • /
    • pp.13-21
    • /
    • 2010
  • The prediction of contract cancellation of customers is essential in insurance companies but it is a difficult problem because the customer database is large and the target or cancelled customers are a small proportion of the database. This paper proposes a new data mining approach to the binary classification by handling a large-scale unbalanced data. Over-sampling, clustering, regularized logistic regression and boosting are also incorporated in the proposed approach. The proposed approach was applied to a real data set in the area of insurance and the results were compared with some other classification techniques.

Fast Center Lane Detection Method for Vehicle Applications (차량 탑재를 위한 고속 중앙차선 인식 방법)

  • Jang, Kwang-Hee;Kwak, Seong-Woo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.9 no.6
    • /
    • pp.649-656
    • /
    • 2014
  • In this paper, we address the problem of center lane detection algorithm for autonomous driving. Color information for center lane is gathered by analyzing a row line color distribution of road in front of a vehicle. The candidate pixels for center lane are extracted from the histogram of road colors. Morphological filtering and clustering process are applied to the candidate pixels to extract the exact center lane. We predict a expected area of center lane and search only the regions in subsequent frames, that reduces the time required for center lane detection.