• Title/Summary/Keyword: clustering problem

Search Result 709, Processing Time 0.027 seconds

Subscriber Assignment Method in SDN based MQTT Cluster for IoT platform (IoT 플랫폼을 위한 SDN 기반 MQTT 클러스터에서 서브스크라이버 배정 방안)

  • Kang, Gwi-Yeong;Seok, Seung-Joon
    • KNOM Review
    • /
    • v.22 no.1
    • /
    • pp.30-41
    • /
    • 2019
  • MQTT protocol is one of open Publish / Subscribe systems for IoT information transmission. In this paper, we are proposing an algorithm to assign a subscriber, which dynamically participate in MQTT clustering system, to an appropriate broker. In MQTT systems with a centralized broker, there are losses of connectivity and messages between subscribers and brokers. In this paper, we addressed this issue for developing scalable open IoT systems and consider clustering MQTT brokers on the SDN infrastructure. In particular, this paper focuses on the problem of allocating subscribers to brokers in accordance with sharing brokers' topics to reduce brokers' load and communication cost in SDN based MQTT cluster. The Experimental results show that the proposed algorithm will reduce the load and the cost as compared to existing methods.

Object Detection and Localization on Map using Multiple Camera and Lidar Point Cloud

  • Pansipansi, Leonardo John;Jang, Minseok;Lee, Yonsik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.10a
    • /
    • pp.422-424
    • /
    • 2021
  • In this paper, it leads the approach of fusing multiple RGB cameras for visual objects recognition based on deep learning with convolution neural network and 3D Light Detection and Ranging (LiDAR) to observe the environment and match into a 3D world in estimating the distance and position in a form of point cloud map. The goal of perception in multiple cameras are to extract the crucial static and dynamic objects around the autonomous vehicle, especially the blind spot which assists the AV to navigate according to the goal. Numerous cameras with object detection might tend slow-going the computer process in real-time. The computer vision convolution neural network algorithm to use for eradicating this problem use must suitable also to the capacity of the hardware. The localization of classified detected objects comes from the bases of a 3D point cloud environment. But first, the LiDAR point cloud data undergo parsing, and the used algorithm is based on the 3D Euclidean clustering method which gives an accurate on localizing the objects. We evaluated the method using our dataset that comes from VLP-16 and multiple cameras and the results show the completion of the method and multi-sensor fusion strategy.

  • PDF

Audio-Visual Content Analysis Based Clustering for Unsupervised Debate Indexing (비교사 토론 인덱싱을 위한 시청각 콘텐츠 분석 기반 클러스터링)

  • Keum, Ji-Soo;Lee, Hyon-Soo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.27 no.5
    • /
    • pp.244-251
    • /
    • 2008
  • In this research, we propose an unsupervised debate indexing method using audio and visual information. The proposed method combines clustering results of speech by BIC and visual by distance function. The combination of audio-visual information reduces the problem of individual use of speech and visual information. Also, an effective content based analysis is possible. We have performed various experiments to evaluate the proposed method according to use of audio-visual information for five types of debate data. From experimental results, we found that the effect of audio-visual integration outperforms individual use of speech and visual information for debate indexing.

Recommender Systems using Structural Hole and Collaborative Filtering (구조적 공백과 협업필터링을 이용한 추천시스템)

  • Kim, Mingun;Kim, Kyoung-Jae
    • Journal of Intelligence and Information Systems
    • /
    • v.20 no.4
    • /
    • pp.107-120
    • /
    • 2014
  • This study proposes a novel recommender system using the structural hole analysis to reflect qualitative and emotional information in recommendation process. Although collaborative filtering (CF) is known as the most popular recommendation algorithm, it has some limitations including scalability and sparsity problems. The scalability problem arises when the volume of users and items become quite large. It means that CF cannot scale up due to large computation time for finding neighbors from the user-item matrix as the number of users and items increases in real-world e-commerce sites. Sparsity is a common problem of most recommender systems due to the fact that users generally evaluate only a small portion of the whole items. In addition, the cold-start problem is the special case of the sparsity problem when users or items newly added to the system with no ratings at all. When the user's preference evaluation data is sparse, two users or items are unlikely to have common ratings, and finally, CF will predict ratings using a very limited number of similar users. Moreover, it may produces biased recommendations because similarity weights may be estimated using only a small portion of rating data. In this study, we suggest a novel limitation of the conventional CF. The limitation is that CF does not consider qualitative and emotional information about users in the recommendation process because it only utilizes user's preference scores of the user-item matrix. To address this novel limitation, this study proposes cluster-indexing CF model with the structural hole analysis for recommendations. In general, the structural hole means a location which connects two separate actors without any redundant connections in the network. The actor who occupies the structural hole can easily access to non-redundant, various and fresh information. Therefore, the actor who occupies the structural hole may be a important person in the focal network and he or she may be the representative person in the focal subgroup in the network. Thus, his or her characteristics may represent the general characteristics of the users in the focal subgroup. In this sense, we can distinguish friends and strangers of the focal user utilizing the structural hole analysis. This study uses the structural hole analysis to select structural holes in subgroups as an initial seeds for a cluster analysis. First, we gather data about users' preference ratings for items and their social network information. For gathering research data, we develop a data collection system. Then, we perform structural hole analysis and find structural holes of social network. Next, we use these structural holes as cluster centroids for the clustering algorithm. Finally, this study makes recommendations using CF within user's cluster, and compare the recommendation performances of comparative models. For implementing experiments of the proposed model, we composite the experimental results from two experiments. The first experiment is the structural hole analysis. For the first one, this study employs a software package for the analysis of social network data - UCINET version 6. The second one is for performing modified clustering, and CF using the result of the cluster analysis. We develop an experimental system using VBA (Visual Basic for Application) of Microsoft Excel 2007 for the second one. This study designs to analyzing clustering based on a novel similarity measure - Pearson correlation between user preference rating vectors for the modified clustering experiment. In addition, this study uses 'all-but-one' approach for the CF experiment. In order to validate the effectiveness of our proposed model, we apply three comparative types of CF models to the same dataset. The experimental results show that the proposed model outperforms the other comparative models. In especial, the proposed model significantly performs better than two comparative modes with the cluster analysis from the statistical significance test. However, the difference between the proposed model and the naive model does not have statistical significance.

A Study on Simplification of Machine Learning Model (기계학습 모델의 간략화 방법에 대한 연구)

  • Lee, Gye-Sung;Kim, In-Kook
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.4
    • /
    • pp.147-152
    • /
    • 2016
  • One of major issues in machine learning that extracts and acquires knowledge implicit in data is to find an appropriate way of representing it. Knowledge can be represented by a number of structures such as networks, trees, lists, and rules. The differences among these exist not only in their structures but also in effectiveness of the models for their problem solving capability. In this paper, we propose partition utility as a criterion function for clustering that can lead to simplification of the model and thus avoid overfitting problem. In addition, a heuristic is proposed as a way to construct balanced hierarchical models.

Adaptive Clustering Algorithm for Recycling Cell Formation: An Application of the Modified Fuzzy ART Neural Network

  • Park, Ji-Hyung;Seo, Kwang-Kyu
    • Proceedings of the Korea Database Society Conference
    • /
    • 1999.06a
    • /
    • pp.253-260
    • /
    • 1999
  • The recycling cell formation problem means that disposal products me 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 during product use phase and recycling cells are formed design, process and usage attributes. In order to treat the uncertainties, fuzzy set theory and fuzzy logic-based neural network model are applied to recycling cell formation problem far disposal products. In this paper, a heuristic approach fuzzy ART neural network is suggested. The modified fuzzy ART neural network is shown that it has a great efficiency and give an extension for systematically generating alternative solutions in the recycling cell formation problem. We present the results of this approach applied to disposal refrigerators and the comparison of performances between other algorithms. This paper introduced a procedure which integrates economic and environmental factors into the disassembly of disposal products for recycling in recycling cells. A qualitative method of disassembly analysis is developed and its ai is to improve the efficiency of the disassembly and to generated an optimal disassembly which maximize profits and minimize environmental impact. Three criteria established to reduce the search space and facilitate recycling opportunities.

  • PDF

Adaptive Clustering Algorithm for Recycling Cell Formation An Application of the Modified Fuzzy ART Neural Network

  • Park, Ji-Hyung;Seo, Kwang-Kyu
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 1999.03a
    • /
    • pp.253-260
    • /
    • 1999
  • 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 during product use phase and recycling cells are formed design, process and usage attributes. In order to treat the uncertainties, fuzzy set theory and fuzzy logic-based neural network model are applied to recycling cell formation problem for disposal products. In this paper, a heuristic approach for fuzzy ART neural network is suggested. The modified Fuzzy ART neural network is shown that it has a great efficiency and give an extension for systematically generating alternative solutions in the recycling cell formation problem. We present the results of this approach applied to disposal refrigerators and the comparison of performances between other algorithms. This paper introduced a procedure which integrates economic and environmental factors into the disassembly of disposal products for recycling in recycling cells. A qualitative method of disassembly analysis is developed and its aim is to improve the efficiency of the disassembly and to generated an optimal disassembly which maximize profits and minimize environmental impact. Three criteria established to reduce the search space and facilitate recycling opportunities.

  • PDF

Design of video surveillance system using k-means clustering (k-means 클러스터링을 이용한 CCTV의 효율적인 운영 설계)

  • Hong, Ji-Hoon;kim, Seung ho;Lee, Keun-Ho
    • Journal of Internet of Things and Convergence
    • /
    • v.3 no.2
    • /
    • pp.1-5
    • /
    • 2017
  • As CCTV technology develops, it is used in various fields. Currently, we want to know about CCTV operation in detail. In addition, CCTV in many fields is causing problems in operation. We plan to design a new system to solve the problem. In this paper, we analyze data using K-means so that CCTV can be operated efficiently, add new technology and function to existing system to increase image technology and operate efficiently, Technology. In addition, we will design a new system for CCTV technology using k-means so that the CCTV can be efficiently operated in the center, and propose the problem to solve the problem.

Multi-mode Radar Signal Sorting by Means of Spatial Data Mining

  • Wan, Jian;Nan, Pulong;Guo, Qiang;Wang, Qiangbo
    • Journal of Communications and Networks
    • /
    • v.18 no.5
    • /
    • pp.725-734
    • /
    • 2016
  • For multi-mode radar signals in complex electromagnetic environment, different modes of one emitter tend to be deinterleaved into several emitters, called as "extension", when processing received signals by use of existing sorting methods. The "extension" problem inevitably deteriorates the sorting performance of multi-mode radar signals. In this paper, a novel method based on spatial data mining is presented to address above challenge. Based on theories of data field, we describe the distribution information of feature parameters using potential field, and makes partition clustering of parameter samples according to revealed distribution features. Additionally, an evaluation criterion based on cloud model membership is established to measure the relevance between different cluster-classes, which provides important spatial knowledge for the solution of the "extension" problem. It is shown through numerical simulations that the proposed method is effective on solving the "extension" problem in multi-mode radar signal sorting, and can achieve higher correct sorting rate.

A Ring-Mesh Topology Optimization in Designing the Optical Internet (생존성을 보장하는 링-그물 구조를 가진 광 인터넷 WDM 망 최적 설계)

  • 이영호;박보영;박노익;이순석;김영부;조기성
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.4B
    • /
    • pp.455-463
    • /
    • 2004
  • In this paper, we deal with a ring-mesh network design problem arising from the deployment of WDM for the optical internet. The ring-mesh network consists of ring topology and full mesh topology for satisfying traffic demand while minimizing the cost of OAOMs and OXCs. The problem seeks to find an optimal clustering of traffic demands in the network such that the total number of node assignments is minimized, while satisfying ring capacity and node cardinality constraints. We formulate the problem as a mixed-integer programming model and prescribe a tabu search heuristic procedure Promising computational results within 3% optimality gap are obtained using the proposed method.