http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : 조일래(Cho Il Rae) (검색결과 5 건)
- 무료
- 기관 내 무료
- 유료
-
조일래(Il Rae Cho),이도헌(Do Heon Lee),노봉남(Bong Nam Noh) 한국정보과학회 1996 한국정보과학회 학술발표논문집 Vol.23 No.2A
대용량 데이터베이스에서 연관 규칙(association rule) 탐사(mining)는 데이터 마이닝의 주요 연구 분야로서, 구매 유형 분석이나 의사 결정(decision making) 지원에 유용한 정보를 제공한다. 본 논문에서는 시간 정보를 포함한 이력 데이터 모델에서 특정 항목 집합들 간에 연관 규칙이 성립되는 시간 구간(time interval)을 발견하는 알고리즘을 제안한다. 제안된 방식은 기존의 연관 규칙 탐사에 시간 차원을 추가한 새로운 방식으로서, 전체 트랜잭션을 최소 시간 구간에 의해 분할(partition)한 후 인접된 다량(frequent) 구간을 병합(merge)하여 연관 규칙 탐사와 의미 있는 시간 구간을 발견할 수 있도록 지원한다.
-
이도헌(Lee Do Heon),조일래(Cho Il Rae),김종덕(Kim Jong Deok) 한국정보처리학회 1997 정보처리학회논문지 Vol.4 No.4
The mining of association rules discovers the tendency of events occurring simultaneously in large databases. Previously announced research on association rules deals with associations with respect to the whole transaction. However, some association rules could have very high confidence in a sub-range of the time domain, even though they do not have quite high confidence in the whole time domain. Such kind of association rules are expected to be very useful in various decision making problems. In this paper, we define transient association rule, as an association with high confidence worthy of special attention in a partial time interval, and propose an efficient algorithm which finds out the time intervals appropriate to transient association rules from large databases. We propose the data-driven retrieval method excluding unnecessary interval search, and design an effective data structure manageable in amin memory obtained by one scanning of database, which offers the necessary information to next retrieval phase. In addition, our simulation shows that the suggested algorithm has reliable performance at the time cost acceptable in application areas.
-
김원중,조일래,허영남 순천대학교 기초과학연구소 1994 基礎科學硏究誌 Vol.5 No.-
In this paper, we discuss variation of state exploration where the state generation task is divided into two independent subtask. In which subtask, only states reachable by allowing one of the two machines to makes maximal progress are states can be used to detect nonprogress states. Thus, generated states for state exploration in this method are reduced, and required executing time and storage is reduced.
-
완성형 한글과 영문 혼용 텍스트 화일의 압축 알고리즘에 관한 연구
김원중,조일래,정성민 順天大學校 1995 論文集 Vol.14 No.1
This paper represents a improved data compression algorithm of mixed text file by 2 byte completion Hangeul and 1 byte alphabet form. Original LZW algorithm efficiently compress a alphabet text file but inefficiently compress a 2 byte completion Hangeul text file. To solve this problem, data compression algorithm using 2 byte prefix field and 2 byte suffix field for compression table have developed. But it have a another problem that is compression ratio of alphabet text file decreased. In this paper, we proposes improved LZW algorithm, that is, compression table in the Extended LZW(ELZW) algorithm uses 2 byte prefix field for pointer of a table and 1 byte suffix field for repeat counter. where, a prefix field uses a pointer(index) of compression table and a suffix field uses a counter of overlapping or recursion text data in compression table. To increase compression ratio, after construction of compression table, table data are properly packed as different bit string in accordance with a alphabet, Hangeul, and pointer respectively. Therefore, proposed ELZW algorithm is superior to 1 byte LZW algorithm as 7.0125 percent and superior to 2 byte LZW algorithm as 11.725 percent.
-
김원중,조일래,정성민 順天大學校 1995 論文集 Vol.14 No.1
The data abstraction is a frequently used methodology in conceptual modeling phase of database. It can representing a more expressive knowledge of data. There are classification, generalization, aggregation, and association in data abstraction. In order to ensure the semantic integrity between static data definition and the implementation of operations on the data, the transaction relevant to the considered data also should be added to the conceptual modeling phase, That is, to guarantee consistency of the data in database, all constraints that correspond to class are modeled into transaction in conceptual design phase. In this paper, we propose constraint modeling and transaction algorithm in data abstraction, specially generalization.
ScienceON연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
