• Title/Summary/Keyword: 이웃으로부터의 지지 값

Search Result 7, Processing Time 0.026 seconds

Performance Comparison of Machine Learning Algorithms for Malware Detection (악성코드 탐지를 위한 기계학습 알고리즘의 성능 비교)

  • Lee, Hyun-Jong;Heo, Jae Hyeok;Hwang, Doosung
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2018.01a
    • /
    • pp.143-146
    • /
    • 2018
  • 서명기반 악성코드 탐지는 악성 파일의 고유 해싱 값을 사용하거나 패턴화된 공격 규칙을 이용하므로, 변형된 악성코드 탐지에 취약한 단점이 있다. 기계 학습을 적용한 악성코드 탐지는 이러한 취약점을 극복할 수 있는 방안으로 인식되고 있다. 본 논문은 정적 분석으로 n-gram과 API 특징점을 추출해 특징 벡터로 구성하여 XGBoost, k-최근접 이웃 알고리즘, 지지 벡터 기기, 신경망 알고리즘, 심층 학습 알고리즘의 일반화 성능을 비교한다. 실험 결과로 XGBoost가 일반화 성능이 99%로 가장 우수했으며 k-최근접 이웃 알고리즘이 학습 시간이 가장 적게 소요됐다. 일반화 성능과 시간 복잡도 측면에서 XGBoost가 비교 대상 알고리즘에 비해 우수한 성능을 보였다.

  • PDF

Visual Object Tracking Using Superpixel-Based Graph Cuts (슈퍼픽셀 기반의 그래프 컷을 이용한 객체 추적)

  • Lee, Dae-Youn;Kim, Chang-Su
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2013.06a
    • /
    • pp.64-65
    • /
    • 2013
  • 본 논문에서는 슈퍼픽셀(superpixel) 단위의 그래프 컷 알고리즘을 적용하여 객체 추적의 정확도를 향상시키기 위한 방법을 제안한다. 먼저 영상 분할 기법을 사용하여 입력 영상을 슈퍼픽셀로 분할하고 각 슈퍼픽셀에서 색상 히스토그램을 이용한 특성 벡터를 생성한다. 그리고 특성 벡터에 지지벡터기계(support vector machines)를 사용하여 각 슈퍼픽셀의 객체 확률 값을 추정한다. 객체 확률 값을 데이터 항(data term)으로, 이웃한 슈퍼픽셀 간의 특성 벡터 차 값을 스무드 항(smooth term)으로 하여, 그래프 컷(graph cuts) 알고리즘으로 슈퍼픽셀들을 객체와 배경으로 분류하고 객체 슈퍼픽셀을 최대한으로 포함하는 객체 윈도우를 찾는다. 실험 결과는 제안하는 기법이 기존 기법들보다 객체 추적 성능이 우수함을 보여준다.

  • PDF

Recognition of Partially Occluded Binary Objects using Elastic Deformation Energy Measure (탄성변형에너지 측도를 이용한 부분적으로 가려진 이진 객체의 인식)

  • Moon, Young-In;Koo, Ja-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.10
    • /
    • pp.63-70
    • /
    • 2014
  • Process of recognizing objects in binary images consists of image segmentation and pattern matching. If binary objects in the image are assumed to be separated, global features such as area, length of perimeter, or the ratio of the two can be used to recognize the objects in the image. However, if such an assumption is not valid, the global features can not be used but local features such as points or line segments should be used to recognize the objects. In this paper points with large curvature along the perimeter are chosen to be the feature points, and pairs of points selected from them are used as local features. Similarity of two local features are defined using elastic deformation energy for making the lengths and angles between gradient vectors at the end points same. Neighbour support value is defined and used for robust recognition of partially occluded binary objects. An experiment on Kimia-25 data showed that the proposed algorithm runs 4.5 times faster than the maximum clique algorithm with same recognition rate.

Design and Implementation of a Web Server Using a Learning-based Dynamic Thread Pool Scheme (학습 기반의 동적 쓰레드 풀 기법을 적용한 웹 서버의 설계 및 구현)

  • Yoo, Seo-Hee;Kang, Dong-Hyun;Lee, Kwon-Yong;Park, Sung-Yong
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.1
    • /
    • pp.23-34
    • /
    • 2010
  • As the number of user increases according to the improvement of the network, the multi-thread schemes are used to process the service requests of several users who are connected simultaneously. The static thread pool scheme has the problem of occupying a static amount of system resources. On the other hand, the dynamic thread pool scheme can control the number of threads according to the users' requests. However, it has disadvantage that this scheme cannot react to the requests which are larger than the maximum value assigned. In this paper, a web server using a learning-based dynamic thread pool scheme is suggested, which will be running on a server programming of a multi-thread environment. The suggested scheme adds the creation of the threads through the prediction of the next number of periodic requests using Auto Regressive scheme with the web server apache worker MPM (Multi-processing Module). Unlike previous schemes, in order to set the exact number of the necessary threads during the unchanged number of work requests in a certain period, K-Nearest Neighbor algorithm is used to learn the number of threads in advance according to the number of requests. The required number of threads is set by comparing with the previously learned objects. Then, the similar objects are selected to decide the number of the threads according to the request, and they create the threads. In this paper, the response time has decreased by modifying the number of threads dynamically, and the system resources can be used more efficiently by managing the number of threads according to the requests.

Clustering Method based on Genre Interest for Cold-Start Problem in Movie Recommendation (영화 추천 시스템의 초기 사용자 문제를 위한 장르 선호 기반의 클러스터링 기법)

  • You, Tithrottanak;Rosli, Ahmad Nurzid;Ha, Inay;Jo, Geun-Sik
    • Journal of Intelligence and Information Systems
    • /
    • v.19 no.1
    • /
    • pp.57-77
    • /
    • 2013
  • Social media has become one of the most popular media in web and mobile application. In 2011, social networks and blogs are still the top destination of online users, according to a study from Nielsen Company. In their studies, nearly 4 in 5active users visit social network and blog. Social Networks and Blogs sites rule Americans' Internet time, accounting to 23 percent of time spent online. Facebook is the main social network that the U.S internet users spend time more than the other social network services such as Yahoo, Google, AOL Media Network, Twitter, Linked In and so on. In recent trend, most of the companies promote their products in the Facebook by creating the "Facebook Page" that refers to specific product. The "Like" option allows user to subscribed and received updates their interested on from the page. The film makers which produce a lot of films around the world also take part to market and promote their films by exploiting the advantages of using the "Facebook Page". In addition, a great number of streaming service providers allows users to subscribe their service to watch and enjoy movies and TV program. They can instantly watch movies and TV program over the internet to PCs, Macs and TVs. Netflix alone as the world's leading subscription service have more than 30 million streaming members in the United States, Latin America, the United Kingdom and the Nordics. As the matter of facts, a million of movies and TV program with different of genres are offered to the subscriber. In contrast, users need spend a lot time to find the right movies which are related to their interest genre. Recent years there are many researchers who have been propose a method to improve prediction the rating or preference that would give the most related items such as books, music or movies to the garget user or the group of users that have the same interest in the particular items. One of the most popular methods to build recommendation system is traditional Collaborative Filtering (CF). The method compute the similarity of the target user and other users, which then are cluster in the same interest on items according which items that users have been rated. The method then predicts other items from the same group of users to recommend to a group of users. Moreover, There are many items that need to study for suggesting to users such as books, music, movies, news, videos and so on. However, in this paper we only focus on movie as item to recommend to users. In addition, there are many challenges for CF task. Firstly, the "sparsity problem"; it occurs when user information preference is not enough. The recommendation accuracies result is lower compared to the neighbor who composed with a large amount of ratings. The second problem is "cold-start problem"; it occurs whenever new users or items are added into the system, which each has norating or a few rating. For instance, no personalized predictions can be made for a new user without any ratings on the record. In this research we propose a clustering method according to the users' genre interest extracted from social network service (SNS) and user's movies rating information system to solve the "cold-start problem." Our proposed method will clusters the target user together with the other users by combining the user genre interest and the rating information. It is important to realize a huge amount of interesting and useful user's information from Facebook Graph, we can extract information from the "Facebook Page" which "Like" by them. Moreover, we use the Internet Movie Database(IMDb) as the main dataset. The IMDbis online databases that consist of a large amount of information related to movies, TV programs and including actors. This dataset not only used to provide movie information in our Movie Rating Systems, but also as resources to provide movie genre information which extracted from the "Facebook Page". Formerly, the user must login with their Facebook account to login to the Movie Rating System, at the same time our system will collect the genre interest from the "Facebook Page". We conduct many experiments with other methods to see how our method performs and we also compare to the other methods. First, we compared our proposed method in the case of the normal recommendation to see how our system improves the recommendation result. Then we experiment method in case of cold-start problem. Our experiment show that our method is outperform than the other methods. In these two cases of our experimentation, we see that our proposed method produces better result in case both cases.

The Incidence and Distribution of Viral Diseases in Barley Fields in Korea (국내 맥류재배지의 바이러스병 발생과 분포)

  • Park, Jong-Chul;Seo, Jae-Hwan;Choi, Min-Kyung;Lee, Kui-Jae;Kim, Hyung-Moo
    • Research in Plant Disease
    • /
    • v.10 no.3
    • /
    • pp.188-193
    • /
    • 2004
  • The symptom expressions such as yellowish and mosaic spots in overwintering barley have been considered to be a damage by cold or water. However, it had revealed that the symptom expressions were caused by viruses throughout three year nationwide surveys. Barley yellow mosaic virus (BaYMV), Barley mild mosaic virus (BaMMV), and Soil-borne wheat mosaic virus (SBWMV) was detected in 2001-2003 and Barley yellow dwarf virus-MA V (BYDV -MA V) from field samples collected on March in 2003. The results of investigation showed that the incidence of BaYMV was more than 70% and that of BaMMV and SBWMV was 15.7-37.4% and 0.7-10.1 % in three year surveys, respectively. The incidence of BYDV-MAV was approximately 1 % in 2003 only. The distribution of BaYMV was relatively uniform throughout barley fields in Korea, but the incidence of the virus in Gyunggi Province was as low as 19% compared to 65-85% in the rest of regions. On the other hand, 70% of BaMMV was found to be in the west south regions of Korea, Jeonbuk and Jeonnam Provinces. Taken together, both BaYMV and BaMMV were thought to be dominant casual agents in overwintering barley by either single or mixed infections. Previous survey data for BaYMV from 1994 to 1996 indicated that the incidence of the virus was approximately 40% in Jeonbuk, Jeonnam, and Gyungnam Provinces. Thus, comparing with the results from the recent nationwide survey, the incidence of BaYMV had been rapidly increasing in overwintering barley fields in the southern part of Korea.

Effect of Residential Environment on the Health Status in Apartment Inhabitants (아파트 주민의 건강상태에 거주 환경이 미치는 영향)

  • Kang, Ki-Won;Kim, Hwa-Joon;Kwon, Geun-Yong;Jung, Min-Soo
    • Journal of agricultural medicine and community health
    • /
    • v.34 no.3
    • /
    • pp.279-290
    • /
    • 2009
  • Objectives: WHO insisted on that we should study about association between residential environment and health status and make 'health city' concept as practical motto. This study analyzed about that how community environment affected their health. Methods: We surveyed residential environment satisfaction and health status of a apartment complex residents. We transformed Chun's index about housing environment study and social capital index of WHO and used as community health survey. We analyzed the association between health status and related factor by using principal compound analysis and logistic regression analysis. Results: We found out that the perceived health status 1 years ago was highly related to the residential environment and also extracted five residential environment component (APT maintenance, House, APT complex, Neighbor, APT building) by principal component analysis. After residential environment component, demographic and socioeconomic variable were controlled, the high satisfaction group of APT complex and neighbor relationship was in lower risk of perceived health status 1 years ago than the low satisfaction group. Conclusions: Recently, the importance of residential environment and neighborhood is shaped as community capacity. Therefore, social relationship and residential environment should be the core variable for health promotion of community. After all, we should know the relationship of residential environment and perceived health status 1 years ago. This helps the concept of health city clearly.