http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
An Efficient Algorithm for Approximate Frequent Intemset Mining
Veepu Uppal 보안공학연구지원센터 2015 International Journal of Database Theory and Appli Vol.8 No.3
Frequent itemset mining is a focused theme in data mining research and an important step in the analysis of data arising in a broad range of applications. The traditional exact model for frequent itemset requires that every item occur in each supporting transaction. However, real application data is usually subject to random noise. The reasons for noise are human error and measurement error. These reasons pose new challenges for the efficient discovery of frequent Itemset from the noisy data. Approximate frequent itemset mining is the discovery of itemset that are present not exactly but approximately in transactions.Most known approximate frequent Itemset mining algorithms work by explicitly stating the insertion penalty value and weight threshold. This paper presents a new method for generating insertion penalty value and weight threshold using support count of an item.
Implementation of Star Schemas from ER Model
Gunjan Chandwani,Veepu Uppal 보안공학연구지원센터 2015 International Journal of Database Theory and Appli Vol.8 No.3
A Star Schema is representation of a data warehouse which is used in strategic decision making and analysis. In this paper we present a method ER Diagram is converted into a star schema.