I am using Apriori algorithem in Weka for association rule mining. I know that support for each rule is equal to (occurnce / total-rules ). Weka gave me the number of occurnce. But how do I know the number of rules?
How do I know the "support" of each association rules in Weka?
2.8k Views Asked by MFR At
1
There are 1 best solutions below
Related Questions in WEKA
- HTML5 behaving strange while working in jsFiddle
- Responsive Web Page Scrolling Glitch On iOS
- Semantic ui Form
- Semantic UI: How to define selected item of search dropdown ("<select>")?
- Semantic UI Accordion not working properly
- Semantic Background Image
- Hiding an input file inside a button Semantic-UI
- Semantic UI - Vertical centering a div
- ruby code not working under the "ui" class when using semantic-ui
- Meteor with Semantic UI dropdown behavior not working
Related Questions in APRIORI
- HTML5 behaving strange while working in jsFiddle
- Responsive Web Page Scrolling Glitch On iOS
- Semantic ui Form
- Semantic UI: How to define selected item of search dropdown ("<select>")?
- Semantic UI Accordion not working properly
- Semantic Background Image
- Hiding an input file inside a button Semantic-UI
- Semantic UI - Vertical centering a div
- ruby code not working under the "ui" class when using semantic-ui
- Meteor with Semantic UI dropdown behavior not working
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular # Hahtags
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
Seems to be some confusion in the definitions.
Consider an association rule
X --> YandTa set ofntransactions.The support for
X --> Yis defined to be the fraction of transactionTthat satisfy the union of itemsX and Y.(X U Y).count/nAPRIORI algorithm, in Weka, returns the result as a collection of rules of this kind:
antecedent <support> -> Consequence <confidence>, so you already have the value of support.However if you need the number of rules, for something else, there is one parameters of the algorithm and also in the output the rules are numbered.