fmf 中文意思是什麼
fmf
解釋
胎動感-
Southwestern journal of anthropology, 1954, 10 : 1 - 43. 25 ucinet iv datasets. http : vlado. fmf. uni - lj. si pub net - works data ucinet ucidata. htmsampson
但是通過試驗，我們發現mcs演算法對于多數基準數據集都能找到好的解。 -
The second order method of fmf is more efficient than the first one, and the advantage will be more obvious with support limit lower. the ooa mining hopes to mine all association rules based on a given objective, support, confidence and utility
（ 2 ）面向目標的基於效用度的關聯規則挖掘（ ooa挖掘）是在給定目標的情況下，挖掘滿足支持度、置信度和效用度閾值的規則。 -
The main contributions of this paper are as follows : we present an efficient algorithm for mining fuzzy frequent itemsets, called fmf. we use ffp tree structure to store frequent item sets imformation, and store ids of transactions related with fuzzy item in tree nodes. in fmf, we can count a fuzzy itemsets support through finding all trasactions including them. we needn ’ t to scan database all. to generate itemset { a } + x ( i. e
本文的主要工作如下: （ 1 ）針對模糊頻繁集的挖掘問題，提出了一種有效的fmf演算法，在該演算法中採用ffp -樹結構，將與模糊項目相關的事務的序號保存到樹結點中。計算一個模糊項集的支持度，可以通過直接找到所有包含該項集的全部事務進行計算，而不必掃描整個數據庫。 -
Super set of iemset x ) according to constrained subtree of itemset x, if item “ a ” isn ’ t a fuzzy item, we don ’ t scan database in addition. it can be generated by ffp tree. we propose two order methods for constructing ffp tree. one is that sorting database attributes holding frequent item in ascending order of their nodes number in ffp tree. another is that sorting frequent item of not fuzzy attributes in descending order of their support firstly, then sorting database fuzzy attributes with frequent item in ascending order of their nodes number in ffp tree. our experimental results show that although fmf needs more space costly than the algorithms based on apriori, its time costly is obviously lower than the latter
針對ffp -樹的生成，提出了兩種排序方法:按屬性順序將每個屬性下的頻繁項目依次插入到頭表中，屬性按照其在ffp -樹中可能的不同結點的個數從少到多進行排序;先對非模糊屬性下的頻繁項目按支持度從大到小進行排序，再對模糊屬性按其在ffp -樹中包含的不同結點的個數，從少到多進行排序，然後依次將各屬性下的頻繁項目插入到頭表中。
分享友人