• Title/Summary/Keyword: 필터 링

Search Result 3,386, Processing Time 0.034 seconds

Personalized Recommendation Considering Item Confidence in E-Commerce (온라인 쇼핑몰에서 상품 신뢰도를 고려한 개인화 추천)

  • Choi, Do-Jin;Park, Jae-Yeol;Park, Soo-Bin;Lim, Jong-Tae;Song, Je-O;Bok, Kyoung-Soo;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.19 no.3
    • /
    • pp.171-182
    • /
    • 2019
  • As online shopping malls continue to grow in popularity, various chances of consumption are provided to customers. Customers decide the purchase by exploiting information provided by shopping malls such as the reviews of actual purchasing users, the detailed information of items, and so on. It is required to provide objective and reliable information because customers have to decide on their own whether the massive information is credible. In this paper, we propose a personalized recommendation method considering an item confidence to recommend reliable items. The proposed method determines user preferences based on various behaviors for personalized recommendation. We also propose an user preference measurement that considers time weights to apply the latest propensity to consume. Finally, we predict the preference score of items that have not been used or purchased before, and we recommend items that have highest scores in terms of both the predicted preference score and the item confidence score.

An Improvement study in Keyword-centralized academic information service - Based on Recommendation and Classification in NDSL - (키워드 중심 학술정보서비스 개선 연구 - NDSL 추천 및 분류를 중심으로 -)

  • Kim, Sun-Kyum;Kim, Wan-Jong;Lee, Tae-Seok;Bae, Su-Yeong
    • Journal of Korean Library and Information Science Society
    • /
    • v.49 no.4
    • /
    • pp.265-294
    • /
    • 2018
  • Nowadays, due to an explosive increase in information, information filtering is very important to provide proper information for users. Users hardly obtain scholarly information from a huge amount of information in NDSL of KISTI, except for simple search. In this paper, we propose the service, PIN to solve this problem. Pin provides the word cloud including analyzed users' and others' interesting, co-occurence, and searched keywords, rather than the existing word cloud simply consisting of all keywords and so offers user-customized papers, reports, patents, and trends. In addition, PIN gives the paper classification in NDSL according to keyword matching based classification with the overlapping classification enabled-academic classification system for better search and access to solve this problem. In this paper, Keywords are extracted according to the classification from papers published in Korean journals in 2016 to design classification model and we verify this model.

Implementation of an Algorithm that Generates Minimal Spanning Ladders and Exploration on its relevance with Computational Thinking (최소생성사다리를 생성하는 알고리즘 구현 및 컴퓨팅 사고력과의 관련성 탐구)

  • Jun, Youngcook
    • The Journal of Korean Association of Computer Education
    • /
    • v.21 no.6
    • /
    • pp.39-47
    • /
    • 2018
  • This paper dealt with investigating the number of minimal spanning ladders originated from ladder game and their properties as well as the related computational thinking aspects. The author modified the filtering techniques to enhance Mathematica project where a new type of graph was generated based on the algorithm using a generator of firstly found minimal spanning graph by repeatedly applying independent ladder operator to a subsequence of ladder sequence. The newly produced YC graphs had recursive and hierarchical graph structures and showed the properties of edge-symmetric. As the computational complexity increased the author divided the whole search space into the each floor of the newly generated minimal spanning graphs for the (5, 10) YC graph and the higher (6, 15) YC graph. It turned out that the computational thinking capabilities such as data visualization, abstraction, and parallel computing with Mathematica contributed to enumerating the new YC graphs in order to investigate their structures and properties.

Classification of 3D Road Objects Using Machine Learning (머신러닝을 이용한 3차원 도로객체의 분류)

  • Hong, Song Pyo;Kim, Eui Myoung
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.36 no.6
    • /
    • pp.535-544
    • /
    • 2018
  • Autonomous driving can be limited by only using sensors if the sensor is blocked by sudden changes in surrounding environments or large features such as heavy vehicles. In order to overcome the limitations, the precise road-map has been used additionally. This study was conducted to segment and classify road objects using 3D point cloud data acquired by terrestrial mobile mapping system provided by National Geographic Information Institute. For this study, the original 3D point cloud data were pre-processed and a filtering technique was selected to separate the ground and non-ground points. In addition, the road objects corresponding to the lanes, the street lights, the safety fences were initially segmented, and then the objects were classified using the support vector machine which is a kind of machine learning. For the training data for supervised classification, only the geometric elements and the height information using the eigenvalues extracted from the road objects were used. The overall accuracy of the classification results was 87% and the kappa coefficient was 0.795. It is expected that classification accuracy will be increased if various classification items are added not only geometric elements for classifying road objects in the future.

Content Recommendation Techniques for Personalized Software Education (개인화된 소프트웨어 교육을 위한 콘텐츠 추천 기법)

  • Kim, Wan-Seop
    • Journal of Digital Convergence
    • /
    • v.17 no.8
    • /
    • pp.95-104
    • /
    • 2019
  • Recently, software education has been emphasized as a key element of the fourth industrial revolution. Many universities are strengthening the software education for all students according to the needs of the times. The use of online content is an effective way to introduce SW education for all students. However, the provision of uniform online contents has limitations in that it does not consider individual characteristics(major, sw interest, comprehension, interests, etc.) of students. In this study, we propose a recommendation method that utilizes the directional similarity between contents in the boolean view history data environment. We propose a new item-based recommendation formula that uses the confidence value of association rule analysis as the similarity level and apply it to the data of domestic paid contents site. Experimental results show that the recommendation accuracy is improved than when using the traditional collaborative recommendation using cosine or jaccard for similarity measurements.

Research on Countermeasure of SQL Injection Attack (SQL Injection 공격을 효율적으로 방어하는 대응책 연구)

  • Hong, Sunghyuck
    • Journal of the Korea Convergence Society
    • /
    • v.10 no.10
    • /
    • pp.21-26
    • /
    • 2019
  • At present, it is indispensable to utilize data as an information society. Therefore, the database is used to manage large amounts of data. In real life, most of the data in a database is the personal information of a group of members. Because personal information is sensitive data, the role of the database administrator who manages personal information is important. However, there is a growing number of attacks on databases to use this personal information in a malicious way. SQL Injection is one of the most known and old hacking techniques. SQL Injection attacks are known as an easy technique, but countermeasures are easy, but a lot of efforts are made to avoid SQL attacks on web pages that require a lot of logins, but some sites are still vulnerable to SQL attacks. Therefore, this study suggests effective defense measures through analysis of SQL hacking technology cases and contributes to preventing web hacking and providing a secure information communication environment.

A study on the enhanced filtering method of the deduplication for bulk harvest of web records (대규모 웹 기록물의 원격수집을 위한 콘텐츠 중복 필터링 개선 연구)

  • Lee, Yeon-Soo;Nam, Sung-un;Yoon, Dai-hyun
    • The Korean Journal of Archival Studies
    • /
    • no.35
    • /
    • pp.133-160
    • /
    • 2013
  • As the network and electronic devices have been developed rapidly, the influences the web exerts on our daily lives have been increasing. Information created on the web has been playing more and more essential role as the important records which reflect each era. So there is a strong demand to archive information on the web by a standardized method. One of the methods is the snapshot strategy, which is crawling the web contents periodically using automatic software. But there are two problems in this strategy. First, it can harvest the same and duplicate contents and it is also possible that meaningless and useless contents can be crawled due to complex IT skills implemented on the web. In this paper, we will categorize the problems which can emerge when crawling web contents using snapshot strategy and present the possible solutions to settle the problems through the technical aspects by crawling the web contents in the public institutions.

Noise Removal with Spatial Characteristics in Mixed Noise Environment (복합 잡음 환경에서 공간적 특성을 고려한 잡음 제거)

  • Cheon, Bong-Won;Kim, Nam-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.23 no.3
    • /
    • pp.254-260
    • /
    • 2019
  • Recently, the importance of signal processing has become gradually significant, as the frequency of video media increases in various fields. However, numerous kinds of noise generated in the transmission and reception processes can possibly affect the signal information, and the noise removal is for that reason essential as a preprocessing step. In this paper, we propose an algorithm to remove the mixed noise which is composed of impulse noise and AWGN. This algorithm is used for image restoration by noise judgment for efficient noise removal in a complex noise environment, and the noise is removed by considering spatial characteristics and pixel variations. Simulation results show that unlike existing methods, the algorithm has excellent noise cancellation characteristics by minimizing both noise effects and consequently eliminating the mixed noise; for objective judgment, we compared and analyzed the data using PSNR and profile.

A Stock Price Prediction Based on Recurrent Convolution Neural Network with Weighted Loss Function (가중치 손실 함수를 가지는 순환 컨볼루션 신경망 기반 주가 예측)

  • Kim, HyunJin;Jung, Yeon Sung
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.8 no.3
    • /
    • pp.123-128
    • /
    • 2019
  • This paper proposes the stock price prediction based on the artificial intelligence, where the model with recurrent convolution neural network (RCNN) layers is adopted. In the motivation of this prediction, long short-term memory model (LSTM)-based neural network can make the output of the time series prediction. On the other hand, the convolution neural network provides the data filtering, averaging, and augmentation. By combining the advantages mentioned above, the proposed technique predicts the estimated stock price of next day. In addition, in order to emphasize the recent time series, a custom weighted loss function is adopted. Moreover, stock data related to the stock price index are adopted to consider the market trends. In the experiments, the proposed stock price prediction reduces the test error by 3.19%, which is over other techniques by about 19%.

Distributed Processing System Design and Implementation for Feature Extraction from Large-Scale Malicious Code (대용량 악성코드의 특징 추출 가속화를 위한 분산 처리 시스템 설계 및 구현)

  • Lee, Hyunjong;Euh, Seongyul;Hwang, Doosung
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.8 no.2
    • /
    • pp.35-40
    • /
    • 2019
  • Traditional Malware Detection is susceptible for detecting malware which is modified by polymorphism or obfuscation technology. By learning patterns that are embedded in malware code, machine learning algorithms can detect similar behaviors and replace the current detection methods. Data must collected continuously in order to learn malicious code patterns that change over time. However, the process of storing and processing a large amount of malware files is accompanied by high space and time complexity. In this paper, an HDFS-based distributed processing system is designed to reduce space complexity and accelerate feature extraction time. Using a distributed processing system, we extract two API features based on filtering basis, 2-gram feature and APICFG feature and the generalization performance of ensemble learning models is compared. In experiments, the time complexity of the feature extraction was improved about 3.75 times faster than the processing time of a single computer, and the space complexity was about 5 times more efficient. The 2-gram feature was the best when comparing the classification performance by feature, but the learning time was long due to high dimensionality.