Results 121 to 130 of about 2,690 (229)

[[alternative]]Approximately Mining Recent Frequent Itemsets on Data Streams

open access: yes, 2010
[[abstract]]Recently, the data of many real applications are generated in the form of data streams. In this thesis, two approximately mining methods, named ATS (Average TimeStamp mining method) and FCP (Frequency Changing Point mining method), are ...
[[author]]石舒寧, 石舒寧
core  

Mining Generalized Closed Frequent Itemsets of Generalized Association Rules

open access: yes, 2020
. In the area of knowledge discovery in databases, the generalized association rule mining is an extension from the traditional association rule mining by given a database and taxonomy over the items in database. More initiative and informative knowledge

core  

Mining frequent itemsets from uncertain data: extensions to constrained mining and stream mining

open access: yes, 2010
Most studies on frequent itemset mining focus on mining precise data. However, there are situations in which the data are uncertain. This leads to the mining of uncertain data.
Hao, Boyu
core  

Periodic subgraph mining in dynamic networks [PDF]

open access: yes, 2010
La tesi si prefigge di scoprire interazioni periodiche frequenti tra i membri di una popolazione il cui comportamento viene studiato in un certo arco di tempo.
Barbares, Manuel
core  

ITL-Mine: Mining Frequent Itemsets More Efficiently

open access: yes, 2002
The discovery of association rules is an important problem in data mining. It is a two-step process consisting of finding the frequent itemsets and generating association rules from them.
Raj P. Gopalan, Yudho Giri Sucahyo
core  

maintaining only frequent itemsets to mine approximate frequent itemsets over online data streams

open access: yes, 2009
IEEEMining frequent itemsets over online data streams, where the new data arrive and the old data will be removed with high speed, is a challenge for the computational complexity.
Li Kun, Wang Hongan, Wang Yongyan
core  

An Efficient Algorithm for Mining Closed Frequent Inter-transaction Itemsets

open access: yes, 2007
跨交易關聯規則可代表不同交易中項目間的關係,而近年來有愈來愈多相關的探勘演算法被提出,然而這些演算法會產生相當多的跨交易頻繁項目集合。找尋封閉性跨交易頻繁項目集合可使探勘的過程更有效率。 因此,在本篇論文中我們提出了一個探勘演算法叫「ICMiner」,以找尋封閉性跨交易頻繁項目集合。我們的方法可分為兩個階段。第一階段,將原始的資料庫轉換成領域屬性集合,使得每一個頻繁項目的領域屬性形成一個集合。第二階段,利用ID-tree去列舉出所有的封閉性跨交易頻繁項目集合。藉由ID-tree進行資料探勘 ...
翁婉玉, Weng, Wan-Yu
core  

Home - About - Disclaimer - Privacy