메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색
질문

논문 기본 정보

자료유형
학술대회자료
저자정보
저널정보
한국정보통신학회 INTERNATIONAL CONFERENCE ON FUTURE INFORMATION & COMMUNICATION ENGINEERING 2017 INTERNATIONAL CONFERENCE ON FUTURE INFORMATION & COMMUNICATION ENGINEERING Vo.9 No.1
발행연도
2017.6
수록면
51 - 56 (6page)

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색
질문

초록· 키워드

오류제보하기
The Korea Institute of Science and Technology Information (KISTI) has established latent Dirichlet allocation (LDA)-based science & technology knowledge base for efficient information search by grouping the science and technology data by topic and measuring similarity among them. However, the construction of knowledge base by measuring LDAbased similarity among the huge amount of science and technology data (approximately 100 million data) requires tremendous time and efforts. Therefore, efficiency is essential. In case of LDA, in particular, there is considerable difference in execution time depending on what kinds of LDA and matrix libraries are chosen. Therefore, they should be considered at LDA modeling. This study comparatively tested the two libraries to shorten the time needed to construct LDA-based science and technology knowledge information base and selected high-performance Mallet LDA and jblas matrix libraries. They were used in constructing LDA-based science and technology knowledge base, and processing time was significantly reduced.

목차

Abstract
I. INTRODUCTION
Ⅱ. LDA-BASED SCIENCE AND TCEHNOLOGY KNOWLEDGE BASE CONSTRUCTION MODEL
Ⅲ. COMPARISON BETWEEN LDA AND MATRIX LIBRARIES
Ⅳ. DISCUSSION AND CONCLUSIONS
REFERENCES

참고문헌 (0)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

이 논문의 저자 정보

이 논문과 함께 이용한 논문

최근 본 자료

전체보기

댓글(0)

0