• Title/Summary/Keyword: Network Filtering

Search Result 553, Processing Time 0.027 seconds

Implementation of Neural Network Accelerator for Rendering Noise Reduction on OpenCL (OpenCL을 이용한 랜더링 노이즈 제거를 위한 뉴럴 네트워크 가속기 구현)

  • Nam, Kihun
    • The Journal of the Convergence on Culture Technology
    • /
    • v.4 no.4
    • /
    • pp.373-377
    • /
    • 2018
  • In this paper, we propose an implementation of a neural network accelerator for reducing the rendering noise using OpenCL. Among the rendering algorithms, we selects a ray tracing to assure a high quality graphics. Ray tracing rendering uses ray to render, less use of the ray will result in noise. Ray used more will produce a higher quality image but will take operation time longer. To reduce operation time whiles using fewer rays, Learning Base Filtering algorithm using neural network was applied. it's not always produce optimize result. In this paper, a new approach to Matrix Multiplication that is based on General Matrix Multiplication for improved performance. The development environment, we used specialized in high speed parallel processing of OpenCL. The proposed architecture was verified using Kintex UltraScale XKU6909T-2FDFG1157C FPGA board. The time it takes to calculate the parameters is about 1.12 times fast than that of Verilog-HDL structure.

Conditional Generative Adversarial Network based Collaborative Filtering Recommendation System (Conditional Generative Adversarial Network(CGAN) 기반 협업 필터링 추천 시스템)

  • Kang, Soyi;Shin, Kyung-shik
    • Journal of Intelligence and Information Systems
    • /
    • v.27 no.3
    • /
    • pp.157-173
    • /
    • 2021
  • With the development of information technology, the amount of available information increases daily. However, having access to so much information makes it difficult for users to easily find the information they seek. Users want a visualized system that reduces information retrieval and learning time, saving them from personally reading and judging all available information. As a result, recommendation systems are an increasingly important technologies that are essential to the business. Collaborative filtering is used in various fields with excellent performance because recommendations are made based on similar user interests and preferences. However, limitations do exist. Sparsity occurs when user-item preference information is insufficient, and is the main limitation of collaborative filtering. The evaluation value of the user item matrix may be distorted by the data depending on the popularity of the product, or there may be new users who have not yet evaluated the value. The lack of historical data to identify consumer preferences is referred to as data sparsity, and various methods have been studied to address these problems. However, most attempts to solve the sparsity problem are not optimal because they can only be applied when additional data such as users' personal information, social networks, or characteristics of items are included. Another problem is that real-world score data are mostly biased to high scores, resulting in severe imbalances. One cause of this imbalance distribution is the purchasing bias, in which only users with high product ratings purchase products, so those with low ratings are less likely to purchase products and thus do not leave negative product reviews. Due to these characteristics, unlike most users' actual preferences, reviews by users who purchase products are more likely to be positive. Therefore, the actual rating data is over-learned in many classes with high incidence due to its biased characteristics, distorting the market. Applying collaborative filtering to these imbalanced data leads to poor recommendation performance due to excessive learning of biased classes. Traditional oversampling techniques to address this problem are likely to cause overfitting because they repeat the same data, which acts as noise in learning, reducing recommendation performance. In addition, pre-processing methods for most existing data imbalance problems are designed and used for binary classes. Binary class imbalance techniques are difficult to apply to multi-class problems because they cannot model multi-class problems, such as objects at cross-class boundaries or objects overlapping multiple classes. To solve this problem, research has been conducted to convert and apply multi-class problems to binary class problems. However, simplification of multi-class problems can cause potential classification errors when combined with the results of classifiers learned from other sub-problems, resulting in loss of important information about relationships beyond the selected items. Therefore, it is necessary to develop more effective methods to address multi-class imbalance problems. We propose a collaborative filtering model using CGAN to generate realistic virtual data to populate the empty user-item matrix. Conditional vector y identify distributions for minority classes and generate data reflecting their characteristics. Collaborative filtering then maximizes the performance of the recommendation system via hyperparameter tuning. This process should improve the accuracy of the model by addressing the sparsity problem of collaborative filtering implementations while mitigating data imbalances arising from real data. Our model has superior recommendation performance over existing oversampling techniques and existing real-world data with data sparsity. SMOTE, Borderline SMOTE, SVM-SMOTE, ADASYN, and GAN were used as comparative models and we demonstrate the highest prediction accuracy on the RMSE and MAE evaluation scales. Through this study, oversampling based on deep learning will be able to further refine the performance of recommendation systems using actual data and be used to build business recommendation systems.

Social Network Analysis for the Effective Adoption of Recommender Systems (추천시스템의 효과적 도입을 위한 소셜네트워크 분석)

  • Park, Jong-Hak;Cho, Yoon-Ho
    • Journal of Intelligence and Information Systems
    • /
    • v.17 no.4
    • /
    • pp.305-316
    • /
    • 2011
  • Recommender system is the system which, by using automated information filtering technology, recommends products or services to the customers who are likely to be interested in. Those systems are widely used in many different Web retailers such as Amazon.com, Netfix.com, and CDNow.com. Various recommender systems have been developed. Among them, Collaborative Filtering (CF) has been known as the most successful and commonly used approach. CF identifies customers whose tastes are similar to those of a given customer, and recommends items those customers have liked in the past. Numerous CF algorithms have been developed to increase the performance of recommender systems. However, the relative performances of CF algorithms are known to be domain and data dependent. It is very time-consuming and expensive to implement and launce a CF recommender system, and also the system unsuited for the given domain provides customers with poor quality recommendations that make them easily annoyed. Therefore, predicting in advance whether the performance of CF recommender system is acceptable or not is practically important and needed. In this study, we propose a decision making guideline which helps decide whether CF is adoptable for a given application with certain transaction data characteristics. Several previous studies reported that sparsity, gray sheep, cold-start, coverage, and serendipity could affect the performance of CF, but the theoretical and empirical justification of such factors is lacking. Recently there are many studies paying attention to Social Network Analysis (SNA) as a method to analyze social relationships among people. SNA is a method to measure and visualize the linkage structure and status focusing on interaction among objects within communication group. CF analyzes the similarity among previous ratings or purchases of each customer, finds the relationships among the customers who have similarities, and then uses the relationships for recommendations. Thus CF can be modeled as a social network in which customers are nodes and purchase relationships between customers are links. Under the assumption that SNA could facilitate an exploration of the topological properties of the network structure that are implicit in transaction data for CF recommendations, we focus on density, clustering coefficient, and centralization which are ones of the most commonly used measures to capture topological properties of the social network structure. While network density, expressed as a proportion of the maximum possible number of links, captures the density of the whole network, the clustering coefficient captures the degree to which the overall network contains localized pockets of dense connectivity. Centralization reflects the extent to which connections are concentrated in a small number of nodes rather than distributed equally among all nodes. We explore how these SNA measures affect the performance of CF performance and how they interact to each other. Our experiments used sales transaction data from H department store, one of the well?known department stores in Korea. Total 396 data set were sampled to construct various types of social networks. The dependant variable measuring process consists of three steps; analysis of customer similarities, construction of a social network, and analysis of social network patterns. We used UCINET 6.0 for SNA. The experiments conducted the 3-way ANOVA which employs three SNA measures as dependant variables, and the recommendation accuracy measured by F1-measure as an independent variable. The experiments report that 1) each of three SNA measures affects the recommendation accuracy, 2) the density's effect to the performance overrides those of clustering coefficient and centralization (i.e., CF adoption is not a good decision if the density is low), and 3) however though the density is low, the performance of CF is comparatively good when the clustering coefficient is low. We expect that these experiment results help firms decide whether CF recommender system is adoptable for their business domain with certain transaction data characteristics.

A Study for the Designing and Efficiency Measuring Methods of Integrated Multi-level Network Security Domain Architecture (Multi-level 네트워크의 보안 도메인을 위한 통합 아키텍쳐 설계 및 효율성 측정방법 연구)

  • Na, Sang Yeob;Noh, Si Choon
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.5 no.4
    • /
    • pp.87-97
    • /
    • 2009
  • Internet network routing system is used to prevent spread and distribution of malicious data traffic. This study is based on analysis of diagnostic weakness structure in the network security domain. We propose an improved integrated multi-level protection domain for in the internal route of groupware. This paper's protection domain is designed to handle the malicious data traffic in the groupware and finally leads to lighten the load of data traffic and improve network security in the groupware. Infrastructure of protection domain is transformed into five-stage blocking domain from two or three-stage blocking. Filtering and protections are executed for the entire server at the gateway level and internet traffic route ensures differentiated protection by dividing into five-stage. Five-stage multi-level network security domain's malicious data traffic protection performance is better than former one. In this paper, we use a trust evaluation metric for measuring the security domain's performance and suggested algorithm.

Design of maneuvering target tracking system using neural network as an input estimator (입력 추정기로서의 신경회로망을 이용한 기동 표적 추적 시스템 설계)

  • 김행구;진승희;박진배;주영훈
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.524-527
    • /
    • 1997
  • Conventional target tracking algorithms based on the linear estimation techniques perform quite efficiently when the target motion does not involve maneuvers. Target maneuvers involving short term accelerations, however, cause a bias in the measurement sequence. Accurate compensation for the bias requires processing more samples of which adds to the computational complexity. The primary motivation for employing a neural network for this task comes from the efficiency with which more features can be as inputs for bias compensation. A system architecture that efficiently integrates the fusion capabilities of a trained multilayer neural net with the tracking performance of a Kalman filter is described. The parallel processing capability of a properly trained neural network can permit fast processing of features to yield correct acceleration estimates and hence can take the burden off the primary Kalman filter which still provides the target position and velocity estimates.

  • PDF

Equalization of Time-Varying Channels using a Recurrent Neural Network Trained with Kalman Filters (칼만필터로 훈련되는 순환신경망을 이용한 시변채널 등화)

  • 최종수;권오신
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.9 no.11
    • /
    • pp.917-924
    • /
    • 2003
  • Recurrent neural networks have been successfully applied to communications channel equalization. Major disadvantages of gradient-based learning algorithms commonly employed to train recurrent neural networks are slow convergence rates and long training sequences required for satisfactory performance. In a high-speed communications system, fast convergence speed and short training symbols are essential. We propose decision feedback equalizers using a recurrent neural network trained with Kalman filtering algorithms. The main features of the proposed recurrent neural equalizers, utilizing extended Kalman filter (EKF) and unscented Kalman filter (UKF), are fast convergence rates and good performance using relatively short training symbols. Experimental results for two time-varying channels are presented to evaluate the performance of the proposed approaches over a conventional recurrent neural equalizer.

The Development of Pattern Classification for Inner Defects in Semiconductor Packages by Self-Organizing Map (자기조직화 지도를 이용한 반도체 패키지 내부결함의 패턴분류 알고리즘 개발)

  • 김재열;윤성운;김훈조;김창현;양동조;송경석
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.12 no.2
    • /
    • pp.65-70
    • /
    • 2003
  • In this study, researchers developed the estimative algorithm for artificial defect in semiconductor packages and performed it by pattern recognition technology. For this purpose, the estimative algorithm was included that researchers made software with MATLAB. The software consists of some procedures including ultrasonic image acquisition, equalization filtering, Self-Organizing Map and Backpropagation Neural Network. Self-organizing Map and Backpropagation Neural Network are belong to methods of Neural Networks. And the pattern recognition technology has applied to classify three kinds of detective patterns in semiconductor packages : Crack, Delamination and Normal. According to the results, we were confirmed that estimative algerian was provided the recognition rates of 75.7% (for Crack) and 83.4% (for Delamination) and 87.2 % (for Normal).

A Control Scheme of Forwarding Engines for Supporting Packet Filtering in ATM-based MPLS LER (ATM 기반 MPLS LER에서 패킷 필터링 기능을 지원하기 위한 포워딩 엔진 제어 기법)

  • Park, Jae-Hyung;Yun, Hyun-Jeong;Jeon, Byung-Chun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2001.10b
    • /
    • pp.1279-1282
    • /
    • 2001
  • 최근 인터넷의 급속한 사용 증가로 인해 전송 링크의 광대역 지원과 멀티미디어 트래픽의 QoS 보장 문제, 향상된 IP 서비스의 제공 문제 해결은 필수적이다. MPLS 기술은 IP의 유연성과 확장성을 제공할 수 있는 패러다임의 하나이다. MPLS 망의 경계에 위치하는 LER 은 링크 계층 뿐만 아니라 IP 계층에서도 패킷을 전달해야 한다. 본 논문에서는 하드웨어 포워딩 엔진을 갖는 MPLS LER에서, 패킷 필터링 기능을 지원하기 위해서 포워딩 엔진을 제어하기 위한 기법에 대해서 기술한다. 이러한 패킷 필터링 기능은 MPLS LER에 firewall 기능을 제공하는데 응용될 수 있다.

  • PDF

Predicting Exchange Rates with Modified Elman Network (수정된 엘만신경망을 이용한 외환 예측)

  • Beum-Jo Park
    • Journal of Intelligence and Information Systems
    • /
    • v.3 no.1
    • /
    • pp.47-68
    • /
    • 1997
  • This paper discusses a method of modified Elman network(1990) for nonlinear predictions and its a, pp.ication to forecasting daily exchange rate returns. The method consists of two stages that take advantages of both time domain filter and modified feedback networks. The first stage straightforwardly employs the filtering technique to remove extreme noise. In the second stage neural networks are designed to take the feedback from both hidden-layer units and the deviation of outputs from target values during learning. This combined feedback can be exploited to transfer unconsidered information on errors into the network system and, consequently, would improve predictions. The method a, pp.ars to dominate linear ARMA models and standard dynamic neural networks in one-step-ahead forecasting exchange rate returns.

  • PDF

Learning of Mixtures of Experts Network Based on Kalman Filtering (칼만 필터링을 이용한 Mixtures of Experts network 학습)

  • 김병관;최우경;김성주;김종수;서재용;전홍태
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2004.04a
    • /
    • pp.65-68
    • /
    • 2004
  • 복잡한 문제 학습을 위해 여러 가지 형태의 모듈라 네트워크의 구조가 제시되어 왔다. 그 중 엑스퍼트 네트워크와 게이팅 네트워크로 구성된 Mixtures of Experts network은 복잡한 문제를 단순한 문제들로 분해하고, 각각의 엑스퍼트 네트워크가 분해된 단순한 문제를 학습하여 결과를 도출함으로써, 국소적 지역해의 위험을 방지하고 보다 정확한 학습을 가능하게 한다. 그러나 엑스퍼트 네트워크의 수렴은 게이팅 네트워크의 수렴에 많은 영향을 받게 되고, 모든 복잡한 데이터에 대한 엑스퍼트 네트워크의 기여도를 학습하는 게이팅 네트워크는 역전파 알고리즘에 의한 학습 방법으로는 수렴 속도가 떨어진다. 본 논문에서는 게이팅 네트워크를 칼만필터로 학습하여 복잡한 문제에 대한 강건성은 유지하고 보다 빠른 수렴이 가능한 방법을 제시하고자한다.

  • PDF