blocks|key|2937636|text|FPGrowth是一种递归算法。就像其他一些人在这里说的，你总是可以通过使用堆栈将算法转换为非递归算法。但我看不出有任何好的理由为FPGrowth这么做。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2937637|顺便说一句，如果你想要一个FPGrowth和其他频繁模式挖掘算法的Java实现，比如Apriori，HMine，Eclat等，你可以查看我的网站。我已经实现了40多个用于频繁模式挖掘、关联规则挖掘等的算法：|2937638|http://www.philippe-fournier-viger.com/spmf/|offset|length|2937639|entityMap|0|LINK|mutability|MUTABLE|url^0|0|0|0|18|0|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|P|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|Q|8|@]|9|@$F|R|G|S|1|T]]|A|$]]|$1|H|3|-4|5|6|7|U|8|@]|9|@]|A|$]]]|I|$J|$5|K|L|M|A|$N|E]]]]

FPGrowth is a recursive algorithm. Like some other people said here, you can always transform an algorithm into a non recursive algorithm by using a stack. But I don't see any good reasons to do that for FPGrowth.

By the way, if you want a Java implementation of FPGrowth and other frequent pattern mining algorithms such as Apriori, HMine, Eclat, etc., you can check my website. I have implemented more than 40 algorithms for frequent pattern mining, association rule mining, etc.:

<a href="http://www.philippe-fournier-viger.com/spmf/" rel="noreferrer">http://www.philippe-fournier-viger.com/spmf/</a>

blocks|key|2937474|text|我不知道你说的算法是什么。但是，有了递归，一切都有可能，没有递归也是可能的。你可以使用栈来实现这样的算法。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2937475|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

I don't know what is the algorithm you talking about. But everyting what is possible with recursion it is possible also without it. You can implement such kind of algorithms using stack.

blocks|key|2937646|text|Here非常清楚地解释了代码是如何工作的。看起来你必须构建一个树并验证它。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|2937647|entityMap|0|LINK|mutability|MUTABLE|url|http://hareenlaks.blogspot.com/2011/06/fp-tree-example-how-to-identify.html^0|0|4|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

<a href="http://hareenlaks.blogspot.com/2011/06/fp-tree-example-how-to-identify.html" rel="nofollow">Here</a> is an very clear explanation of how the code works. It looks like you have to build a tree and validate it.

blocks|key|2089958|text|假设"FP+growth+Algorithm“指的是频繁模式增长算法，我会向您指出这篇文档，它对它的工作原理进行了很好的解释。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2089959|http://www.florian.verhein.com/teaching/2008-01-09/fp-growth-presentation_v1%2520%2528handout%2529.pdf|offset|length|2089960|我想知道，这和家庭作业有关吗？|2089961|entityMap|0|LINK|mutability|MUTABLE|url|http://www.florian.verhein.com/teaching/2008-01-09/fp-growth-presentation_v1%2520%2528handout%2529.pdf^0|0|0|2O|0|0|0^^$0|@$1|2|3|4|5|6|7|P|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|Q|8|@]|9|@$D|R|E|S|1|T]]|A|$]]|$1|F|3|G|5|6|7|U|8|@]|9|@]|A|$]]|$1|H|3|-4|5|6|7|V|8|@]|9|@]|A|$]]]|I|$J|$5|K|L|M|A|$N|O]]]]

Assuming by "FP growth Algorithm" you mean frequent Pattern growth algorithm, I would point you over to this document that gives a decent explanation on how it works. 

<a href="http://www.florian.verhein.com/teaching/2008-01-09/fp-growth-presentation_v1%20%28handout%29.pdf" rel="nofollow">http://www.florian.verhein.com/teaching/2008-01-09/fp-growth-presentation_v1%20%28handout%29.pdf</a>

I wonder though, is this homework related?

blocks|key|5051350|text|你也许可以访问http://code.google.com/p/lofia/来获取FP树上的一些东西。这是用于最长频繁项集挖掘的。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|5051351|entityMap|0|LINK|mutability|MUTABLE|url|http://code.google.com/p/lofia/^0|7|V|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

You can probably visit <a href="http://code.google.com/p/lofia/" rel="nofollow">http://code.google.com/p/lofia/</a> to get something over FP Tree.
This is for longest frequent itemset mining.

blocks|key|178489|text|您可以在Mahout中查看概念和实现FP增长算法|type|unstyled|depth|inlineStyleRanges|entityRanges|data|178490|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

You can take look at the concept &amp; implemenntation FP growth algoithm in Mahout

I have to implement <a href="http://en.wikipedia.org/wiki/Association_rule_learning#FP-growth_algorithm" rel="noreferrer">FP-growth algorithm</a> using any language. The code should be a serial code with no recursion. Is it possible to implement such algorithm without recursion? I am not looking for code, I just need an explanation of how to do it.

fp growth algorithm

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

我必须使用任何语言实现。代码应该是没有递归的串行代码。有没有可能在没有递归的情况下实现这样的算法？我不是在寻找代码，我只是需要一个如何做的解释。

问fp增长算法
EN

回答 6

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问fp增长算法EN

回答 6

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问fp增长算法
EN