채동규 교수
Dong‐Kyu Chae
한양대학교 컴퓨터소프트웨어학부 · 컴퓨터과학
연구실 소개
채동규 교수의 연구실은 인공지능 기반 추천 시스템과 소프트웨어 분석 분야에서 핵심적인 연구를 수행하고 있습니다. 특히 생성적 적대적 네트워크(GAN)를 활용한 추천 알고리즘 개선, 데이터 스Parser 문제 해결을 위한 가짜 데이터 생성 및 가상 이웃 생성 기법, 소프트웨어 플라그리즘 탐지 기술 개발 등 응용 분야에 깊이 있는 연구를 펼치고 있습니다. 또한 의료 영상 분석 분야에서도 패노프틱 세그멘테이션 기반 치아 분할 기술을 통해 정밀 진단을 지원하는 연구도 진행 중입니다. 다양한 분야에 걸쳐 AI 기반의 정밀하고 효율적인 솔루션을 개발하는 데 초점을 맞추고 있습니다.
연구 현황
연구 성과 추이
표시된 성과는 수집된 데이터 기준으로 산출되며, 일부 차이가 있을 수 있습니다.
주요 논문
15Generative Adversarial Networks (GAN) have achieved big success in various domains such as image generation, music generation, and natural language generation. In this paper, we propose a novel GAN-based collaborative filtering (CF) framework to provide higher accuracy in recommendation. We first identify a fundamental problem of existing GAN-based methods in CF and highlight it quantitatively via a series of experiments. Next, we suggest a new direction of vector-wise adversarial training to so
As plagiarism of software increases rapidly, there are growing needs for software plagiarism detection systems. In this paper, we propose a software plagiarism detection system using an API-labeled control flow graph (A-CFG) that abstracts the functionalities of a program. The A-CFG can reflect both the sequence and the frequency of APIs, while previous work rarely considers both of them together. To perform a scalable comparison of a pair of A-CFGs, we use random walk with restart (RWR) that co
Generative Adversarial Networks (GAN) have not only achieved a big success in various generation tasks such as images, but also boosted the accuracy of classification tasks by generating additional labeled data, which is called data augmentation. In this paper, we propose a Rating Augmentation framework with GAN, named RAGAN, aiming to alleviate the data sparsity problem in collaborative filtering (CF), eventually improving recommendation accuracy significantly. We identify a unique challenge th
Cold-start problems are arguably the biggest challenges faced by collaborative filtering (CF) used in recommender systems. When few ratings are available, CF models typically fail to provide satisfactory recommendations for cold-start users or to display cold-start items on users' top-N recommendation lists. Data imputation has been a popular choice to deal with such problems in the context of CF, filling empty ratings with inferred scores. Different from (and complementary to) data imputation,
Recently, deep learning has become a preferred choice for performing tasks in diverse application domains such as computer vision, natural language processing, sensor data analytics for healthcare, and collaborative filtering for personalized item recommendation. In addition, the Generative Adversarial Networks (GAN) has become one of the most popular frameworks for training machine learning models. Motivated by the huge success of GAN and deep learning on a wide range of fields, this paper expl
Teeth segmentation plays a pivotal role in dentistry by facilitating accurate diagnoses and aiding the development of effective treatment plans. While traditional methods have primarily focused on teeth segmentation, they often fail to consider the broader oral tissue context. This paper proposes a panoptic-segmentation-based method that combines the results of instance segmentation with semantic segmentation of the background. Particularly, we introduce a novel architecture for instance teeth s
In this paper, we propose a system for detecting software plagiarism using a birthmark. The birthmark is representative features of a program, which can be used to identify the program. We use a set of frequency of APIs used in a program as its birthmark. The proposed system consists of three components. First, it extracts the frequency of APIs employed in a program. Next, it generates the program birthmark using a set of frequency of APIs and weights to APIs to extract unique features of the pr
Summary Learning and analyzing graph data is one of the most fundamental research areas in machine learning and data mining. Among numerous graph‐based data structures, this paper focuses on a graph bag (simply, bag ), which corresponds to a training object containing one or more graphs, and a label is available only for a bag. This type of a bag can represent various real‐world objects such as drugs, web pages, XML documents, and images, among many others, and there have been many researches on
대표 연구 분야
채동규 교수의 연구를 Nubint에서 더 깊이 살펴보세요
이 연구실의 논문을 앱에서 열어 AI와 함께 읽고, 핵심을 요약하고, 내 글에 인용하세요.