• Title/Summary/Keyword: 링크 클러스터링

Search Result 47, Processing Time 0.025 seconds

A Study on Clustering of SNS SPAM using Heuristic Method (경험기법을 사용한 SNS 스팸의 클러스터링에 관한 연구)

  • Kwon, Young-Man;Lee, In-Rak;Kim, Myung-Gwan
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.6
    • /
    • pp.7-12
    • /
    • 2014
  • It has good features for social networking with friends SNS is maintained. However, various enterprises, individuals invading the inconvenience spammers have exposure to a number of users to tweet spam. The study was conducted in the existing research on these spam tweets. However, the results showed a more accurate classification and detection is difficult because of the lack of precision and different causes. In this paper, we describe how to classify the characteristics of spammers, classification criteria. Also has a link rate and difference between followers and following, these features were present classification criteria for spammers account. This experiment was performed according to the criteria. Randomized trial of spam and non-spam accounts were selected and account type was conducted according to the criteria 68% of the link ratio of spam accounts. Followers / Following ratio was 27581.5. Non-spam accounts was 6.12%. Followers / Following ratio was 1.26.

Modified LEACH Protocol improving the Stabilization of Topology in Metal Obstacle Environment (금속 장애물 환경에서 토폴로지 안정성을 개선한 변형 LEACH 프로토콜)

  • Yi, Ki-One;Lee, Jae-Kee;Kwark, Gwang-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.12B
    • /
    • pp.1349-1358
    • /
    • 2009
  • Because of the limitation of supporting power, the current WSN(Wireless Sensor Network) Technologies whose one of the core attributes is low power consumption are the best solution for shipping container networking in stack environment such as on vessel. So it is effective to use the Wireless Sensor Network Technology. In this case, many nodes join in the network through a sink node because there are difficulties to get big money and efforts to set up a lot of sink node. It needs clustering-based proactive protocol to manage many nodes. But it shows low reliability because they have effect on radio frequency in metal obstacle environments(interference, distortion, reflection, and etc) like the intelligent container. In this paper, we proposed an improved Modified LEACH Protocol for stableness radio frequency environment. In the proposed protocol, we tried to join the network and derived stable topology composition after the measuring of link quality. Finally, we verified that the proposed protocol is composing more stable topology than previously protocol in metal obstacle environment.

Clustering based Routing Algorithm for Efficient Emergency Messages Transmission in VANET (차량 통신 네트워크에서 효율적인 긴급 메시지 전파를 위한 클러스터링 기반의 라우팅 알고리즘)

  • Kim, Jun-Su;Ryu, Min-Woo;Cha, Si-Ho;Lee, Jong-Eon;Cho, Kuk-Hyun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.13 no.8
    • /
    • pp.3672-3679
    • /
    • 2012
  • Vehicle Ad hoc Network (VANET) is next-generation network technology to provide various services using V2V (Vehicle-to-Vehicle) and V2I (Vehicle-to-Infrastructure). In VANET, many researchers proposed various studies for the safety of drivers. In particular, using the emergency message to increase the efficiency of traffic safety have been actively studied. In order to efficiently transmit to moving vehicle, to send a quick message to as many nodes is very important via broadcasting belong to communication range of vehicle nodes. However, existing studies have suggested a message for transmission to the communication node through indiscriminate broadcasting and broadcast storm problems, thereby decreasing the overall performance has caused the problem. In addition, theses problems has decreasing performance of overall network in various form of road and high density of vehicle node as urban area. Therefore, this paper proposed Clustering based Routing Algorithm (CBRA) to efficiently transmit emergency message in high density of vehicle as urban area. The CBRA managed moving vehicle via clustering when vehicle transmit emergency messages. In addition, we resolve linkage problem between vehicles according to various form of road. The CBRA resolve link brokage problem according to various form of road as urban using clustering. In addition, we resolve broadcasting storm problem and improving efficacy using selection flooding method. simulation results using ns-2 revealed that the proposed CBRA performs much better than the existing routing protocols.

Design and Implementation of a Hypermedia System for Effective Multimedia Information Retrieval (멀티미디어 정보의 효율적인 검색을 위한 하이퍼미디어 시스템의 설계와 구현)

  • 고영곤;최윤철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.8
    • /
    • pp.1213-1225
    • /
    • 1993
  • Hypermedia systems have the browsing mechanism using links and provide navigation tools to retrieve and represent multimedia information. In this study we designed and implemented a hypermedia system which has the hierarchical group and local map for effective navigation. We also propose the clustering mechanism which constructs a cluster tree and uses this knowledge for navigation. The system has been designed to integrate the browsing and searching function of the hypermedia system for efficient multimedia information retrieval and user-interface. This system can be used to develop hypermedia application systems in the area of encyclopedia, reference document information, electronic dictionary and electronic book.

  • PDF

A Mobile Landmarks Guide : Outdoor Augmented Reality based on LOD and Contextual Device (모바일 랜드마크 가이드 : LOD와 문맥적 장치 기반의 실외 증강현실)

  • Zhao, Bi-Cheng;Rosli, Ahmad Nurzid;Jang, Chol-Hee;Lee, Kee-Sung;Jo, Geun-Sik
    • Journal of Intelligence and Information Systems
    • /
    • v.18 no.1
    • /
    • pp.1-21
    • /
    • 2012
  • In recent years, mobile phone has experienced an extremely fast evolution. It is equipped with high-quality color displays, high resolution cameras, and real-time accelerated 3D graphics. In addition, some other features are includes GPS sensor and Digital Compass, etc. This evolution advent significantly helps the application developers to use the power of smart-phones, to create a rich environment that offers a wide range of services and exciting possibilities. To date mobile AR in outdoor research there are many popular location-based AR services, such Layar and Wikitude. These systems have big limitation the AR contents hardly overlaid on the real target. Another research is context-based AR services using image recognition and tracking. The AR contents are precisely overlaid on the real target. But the real-time performance is restricted by the retrieval time and hardly implement in large scale area. In our work, we exploit to combine advantages of location-based AR with context-based AR. The system can easily find out surrounding landmarks first and then do the recognition and tracking with them. The proposed system mainly consists of two major parts-landmark browsing module and annotation module. In landmark browsing module, user can view an augmented virtual information (information media), such as text, picture and video on their smart-phone viewfinder, when they pointing out their smart-phone to a certain building or landmark. For this, landmark recognition technique is applied in this work. SURF point-based features are used in the matching process due to their robustness. To ensure the image retrieval and matching processes is fast enough for real time tracking, we exploit the contextual device (GPS and digital compass) information. This is necessary to select the nearest and pointed orientation landmarks from the database. The queried image is only matched with this selected data. Therefore, the speed for matching will be significantly increased. Secondly is the annotation module. Instead of viewing only the augmented information media, user can create virtual annotation based on linked data. Having to know a full knowledge about the landmark, are not necessary required. They can simply look for the appropriate topic by searching it with a keyword in linked data. With this, it helps the system to find out target URI in order to generate correct AR contents. On the other hand, in order to recognize target landmarks, images of selected building or landmark are captured from different angle and distance. This procedure looks like a similar processing of building a connection between the real building and the virtual information existed in the Linked Open Data. In our experiments, search range in the database is reduced by clustering images into groups according to their coordinates. A Grid-base clustering method and user location information are used to restrict the retrieval range. Comparing the existed research using cluster and GPS information the retrieval time is around 70~80ms. Experiment results show our approach the retrieval time reduces to around 18~20ms in average. Therefore the totally processing time is reduced from 490~540ms to 438~480ms. The performance improvement will be more obvious when the database growing. It demonstrates the proposed system is efficient and robust in many cases.

Design of User Clustering and Robust Beam in 5G MIMO-NOMA System Multicell (5G MIMO-NOMA 시스템 멀티 셀에서의 사용자 클러스터링 및 강력한 빔 설계)

  • Kim, Jeong-Su;Lee, Moon-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.1
    • /
    • pp.59-69
    • /
    • 2018
  • In this paper, we present a robust beamforming design to tackle the weighted sum-rate maximization (WSRM) problem in a multicell multiple-input multiple-output (MIMO) - non-orthogonal multipleaccess (NOMA) downlink system for 5G wireless communications. This work consider the imperfectchannel state information (CSI) at the base station (BS) by adding uncertainties to channel estimation matrices as the worst-case model i.e., singular value uncertainty model (SVUM). With this observation, the WSRM problem is formulated subject to the transmit power constraints at the BS. The objective problem is known as on-deterministic polynomial (NP) problem which is difficult to solve. We propose an robust beam forming design which establishes on majorization minimization (MM) technique to find the optimal transmit beam forming matrix, as well as efficiently solve the objective problem. In addition, we also propose a joint user clustering and power allocation (JUCPA) algorithm in which the best user pair is selected as a cluster to attain a higher sum-rate. Extensive numerical results are provided to show that the proposed robust beamforming design together with the proposed JUCPA algorithm significantly increases the performance in term of sum-rate as compared with the existing NOMA schemes and the conventional orthogonal multiple access (OMA) scheme.

PCA 알고리즘과 개선된 퍼지 신경망을 이용한 여권 인식 및 얼굴 인증

  • Jung Byung-Hee;Park Choong-Shik;Kim Kwang-Baek
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2006.06a
    • /
    • pp.336-343
    • /
    • 2006
  • 본 논문에서는 여권 영 상에서 PCA 알고리즘을 이용한 얼굴 인증과 개선된 퍼지 신경망을 이용한 여권 코드 인식 방법을 제안한다. 본 논문에서는 여권영상에 대해 소벨 연산자를 이용하여 에지를 추출하고 에지가 추출된 영상을 수평 스미어링하여 여권코드 영역을 추출한다. 추출된 여권 코드 영역의 기울기를 검사하여 기울기 보정을 하고, 여권 코드 영역을 이진화 한다. 이진화된 여권 코드 영역에 대하여 8방향윤곽선 추적 알고리즘을 적용하여 여권 코드를 추출한다. 추출된 여권 코드는 퍼지 신경망을 개선하여 여권 코드 인식에 적용한다. 개선된 퍼지 신경 망은 입력층과 중간층 사이의 학습 구조로는 FCM 클러스터링 알고리즘을 적용하고 중간층과 출력층 사이의 학습은 일반화된 델타학습 방법을 적용한다. 그리고 학습 성능을 개선하기 위하여 중간층과 출력층의 가중치 조정에 적용되는 학습률을 동적으로 조정하기 위해 퍼지 제어 시스템을 적용한다. 제안된 퍼지 신경망은 목표값과 출력값의 차이에 대한 절대값이 ${\epsilon}$ 보다 적거나 같으면 정확으로 분류하고 크면 부정확으로 분류하여 정확의 총 개수를 퍼지 제어 시스템에 적용하여 학습률과 모멘텀을 동적으로 조정한다. 여권의 주어진 규격에 근거하여 사진 영역을 추출하고 추출된 사진 영역에 대하여 YCbCr와 RGB 정보를 이용하여 얼굴영역을 추출한다. 추출된 얼굴 영역을 PCA 알고리즘과 스냅샷(Snap-Shot) 방법을 적용하여 얼굴 영역의 위조를 판별한다. 제안된 방법의 여권 코드 인식과 얼굴 인증의 성능을 평가하기 위하여 실제 여권 영상에 적용한 결과, 기존의 방법보다 여권 코드 인식과 얼굴 인증에 있어서 효율적인 것을 확인하였다.s, whereas AVs provide much better security.크는 기준년도부터 2031년까지 5년 단위로 계획된 장래도로를 반영하여 구축된다. 교통주제도 및 교통분석용 네트워크는 국가교통DB구축사업을 통해 구축된 자료로서 교통체계효율화법 제9조의4에 따라 공공기관이 교통정책 및 계획수립 등에 활용할 수 있도록 제공하고 있다. 건설교통부의 승인절차를 거쳐 제공하며 활용 후에는 갱신자료 및 활용결과를 통보하는 과정을 거치도록 되어있다. 교통주제도는 국가의 교통정책결정과 관련분야의 기초자료로서 다양하게 활용되고 있으며, 특히 ITS 노드/링크 기본지도로 활용되는 등 교통 분야의 중요한 지리정보로서 구축되고 있다..20{\pm}0.37L$, 72시간에 $1.33{\pm}0.33L$로 유의한 차이를 보였으므로(F=6.153, P=0.004), 술 후 폐환기능 회복에 효과가 있다. 4) 실험군과 대조군의 수술 후 노력성 폐활량은 수술 후 72시간에서 실험군이 $1.90{\pm}0.61L$, 대조군이 $1.51{\pm}0.38L$로 유의한 차이를 보였다(t=2.620, P=0.013). 5) 실험군과 대조군의 수술 후 일초 노력성 호기량은 수술 후 24시간에서 $1.33{\pm}0.56L,\;1.00{\ge}0.28L$로 유의한 차이를 보였고(t=2.530, P=0.017), 술 후 72시간에서 $1.72{\pm}0.65L,\;1.33{\pm}0.3L$로 유의한 차이를 보였다(t=2.540, P=0.016). 6) 대상자의 술 후 폐환기능에 영향을 미치는 요인은 성별로 나타났다. 이에 따

  • PDF

A Study of Key Pre-distribution Scheme in Hierarchical Sensor Networks (계층적 클러스터 센서 네트워크의 키 사전 분배 기법에 대한 연구)

  • Choi, Dong-Min;Shin, Jian;Chung, Il-Yong
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.22 no.1
    • /
    • pp.43-56
    • /
    • 2012
  • Wireless sensor networks consist of numerous small-sized nodes equipped with limited computing power and storage as well as energy-limited disposable batteries. In this networks, nodes are deployed in a large given area and communicate with each other in short distances via wireless links. For energy efficient networks, dynamic clustering protocol is an effective technique to achieve prolonged network lifetime, scalability, and load balancing which are known as important requirements. this technique has a characteristic that sensing data which gathered by many nodes are aggregated by cluster head node. In the case of cluster head node is exposed by attacker, there is no guarantee of safe and stable network. Therefore, for secure communications in such a sensor network, it is important to be able to encrypt the messages transmitted by sensor nodes. Especially, cluster based sensor networks that are designed for energy efficient, strongly recommended suitable key management and authentication methods to guarantee optimal stability. To achieve secured network, we propose a key management scheme which is appropriate for hierarchical sensor networks. Proposed scheme is based on polynomial key pool pre-distribution scheme, and sustain a stable network through key authentication process.

Analysis of a Compound-Target Network of Oryeong-san (오령산 구성성분-타겟 네트워크 분석)

  • Kim, Sang-Kyun
    • Journal of the Korea Knowledge Information Technology Society
    • /
    • v.13 no.5
    • /
    • pp.607-614
    • /
    • 2018
  • Oryeong-san is a prescription widely used for diseases where water is stagnant because it has the effect of circulating the water in the body and releasing it into the urine. In order to investigate the mechanisms of oryeong-san, we in this paper construct and analysis the compound-target network of medicinal materials constituting oryeong-san based on a systems pharmacology approach. First, the targets related to the 475 chemical compounds of oryeong-san were searched in the STITCH database, and the search results for the interactions between compounds and targets were downloaded as XML files. The compound-target network of oryeong-san is visualized and explored using Gephi 0.8.2, which is an open-source software for graphs and networks. In the network, nodes are compounds and targets, and edges are interactions between the nodes. The edge is weighted according to the reliability of the interaction. In order to analysis the compound-target network, it is clustered using MCL algorithm, which is able to cluster the weighted network. A total of 130 clusters were created, and the number of nodes in the cluster with the largest number of nodes was 32. In the clustered network, it was revealed that the active compounds of medicinal materials were associated with the targets for regulating the blood pressure in the kidney. In the future, we will clarify the mechanisms of oryeong-san by linking the information on disease databases and the network of this research.

Efficient Flooding in Ad hoc Networks using Cluster Formation based on Link Density (애드 혹 네트워크에서 링크밀도기반 클러스터 구축을 이용한 효율적인 플러딩)

  • Lee, Jae-Hyun;Kwon, Kyung-Hee
    • The KIPS Transactions:PartC
    • /
    • v.14C no.7
    • /
    • pp.589-596
    • /
    • 2007
  • Although flooding has the disadvantages like a transmission of duplicated packets and a packet collision, it has been used frequently to find a path between a source and a sink node in a wireless ad hoc network. Clustering is one of the techniques that have been proposed to overcome those disadvantages. In this paper, we propose a new flooding mechanism in ad hoc networks using cluster formation based on the link density which means the number of neighbors within a node's radio reach. To reduce traffic overhead in the cluster is to make the number of non-flooding nodes as large as possible. Therefore, a node with the most links in a cluster will be elected as cluster header. This method will reduce the network traffic overhead with a reliable network performance. Simulation results using NS2 show that cluster formation based on the link density can reduce redundant flooding without loss of network performance.