Documentation
This section provides examples of how to use the SPMF open-source data mining library to perform various data mining tasks. If you have any question or if you want to report a bug,you can check the FAQ,post in the forum or contact me.You can also have a look at the various articles that I have referenced on the algorithms page of this website to learn more about each algorithm. Moreover, you can have a look at the page about videos and other resources related to SPMF, including a textbook in Thai language.Itemset Mining (Frequent Itemsets, Rare Itemsets, etc.)
- Example : Mining Frequent Itemsets by Using the Apriori Algorithm
- Example 1 : Mining Frequent Itemsets by Using the AprioriTID Algorithm
- Example 2 : Mining Frequent Itemsets by Using the FP-Growth Algorithm
- Example 3 : Mining Frequent Itemsets by Using the Relim Algorithm
- Example 4 : Mining Frequent Itemsets by Using the Eclat / dEclat Algorithm
- Example 5 : Mining Frequent Itemsets by Using the H-Mine Algorithm
- Example 6 : Mining Frequent Itemsets by Using the FIN Algorithm
- Example 7 : Mining Frequent Itemsets by Using the DFIN Algorithm
- Example 8 : Mining Frequent Itemsets by Using the NegFIN Algorithm
- Example 9 : Mining Frequent Itemsets by Using the PrePost / PrePost+ Algorithm
- Example 10 : Mining Frequent Itemsets by Using the LCMFreq Algorithm
- Example 11 : Mining Frequent Closed Itemsets Using the AprioriClose Algorithm
- Example 12 : Mining Frequent Closed Itemsets Using the DCI_Closed Algorithm
- Example 13 : Mining Frequent Closed Itemsets Using the Charm / dCharm Algorithm
- Example 14 : Mining Frequent Closed Itemsets Using the LCM Algorithm
- Example 15 : Mining Frequent Closed Itemsets Using the FPClose Algorithm
- Example 16 : Mining Frequent Closed Itemsets Using the NAFCP Algorithm
- Example 17 : Mining Frequent Closed Itemsets Using the NEclatClosed Algorithm
- Example 18 : Mining Frequent Maximal Itemsets Using the FPMax Algorithm
- Example 19 : Mining Frequent Maximal Itemsets Using the Charm-MFI Algorithm
- Example 20 : Mining Frequent Generator Itemsets Using the DefMe Algorithm
- Example 21 : Mining Frequent Itemsets and Identify the Generators Using the Pascal Algorithm
- Example 22 : Mining Frequent Closed Itemsets and Minimal Generators Using the Zart Algorithm
- Example 23 : Mining Minimal Rare Itemsets Using the AprioriRare Algorithm
- Example 24 : Mining Perfectly Rare Itemsets Using the AprioriInverse Algorithm
- Example 25 : Mining Rare Correlated Itemsets Using the CORI Algorithm
- Example 26 : Mining Rare Itemsets Using the RP-Growth Algorithm
- Example 27 : Mining Closed Itemsets from a Data Stream Using the CloStream Algorithm (source code version only)
- Example 28 : Mining Recent Frequent Itemsets from a Data Stream Using the estDec Algorithm (source code version only)
- Example 29 : Mining Recent Frequent Itemsets from a Data Stream Using the estDec+ Algorithm (source code version only)
- Example 30 : Mining Frequent Itemsets from Uncertain Data with the UApriori Algorithm
- Example 31 : Mining Erasable Itemsets from a Product Database with the VME algorithm
- Example 32 : Building, updating incrementally and using an Itemset-Tree to generate targeted frequent itemsets and association rules (source code version only)
- Example 33 : Building, updating incrementally and using a Memory-Efficient Itemset-Tree to generate targeted frequent itemsets and association rules (source code version only)
- Example 34 : Mining Frequent Itemsets with Multiple Support Thresholds Using the MSApriori Algorithm
- Example 35 : Mining Frequent Itemsets with Multiple Support Thresholds Using the CFPGrowth++ Algorithm
- Example 36 : Mining Fuzzy Frequent Itemsets in a quantitative transaction database using the FFI-Miner algorithm
- Example 37 : Mining Multiple Fuzzy Frequent Itemsets in a quantitatve transaction database using the MFFI-Miner algorithm
- Example 38 : Deriving Frequent Itemsets from Frequent Closed Itemsets using the LevelWise algorithm
- Example 39 : Deriving Frequent Itemsets from Frequent Closed Itemsets using the DFI-Growth algorithm
- Example 40 : Deriving Frequent Itemsets from Frequent Closed Itemsets using the DFI-List algorithm
- Example 41 : Mining Self-Sufficient Itemsets using the Opus-Miner algorithm
High-Utility Pattern Mining
- Example 42 : Mining High-Utility Itemsets from a Transaction Database with Utility Information using the Two-Phase Algorithm
- Example 43 : Mining High-Utility Itemsets from a Transaction Database with Utility Information using the FHM Algorithm
- Example 44 : Mining High-Utility Itemsets from a Transaction Database with Utility Information using the EFIM Algorithm
- Example 45 : Mining High-Utility Itemsets from a Transaction Database with Utility Information using the HUI-Miner Algorithm
- Example 46 : Mining High-Utility Itemsets from a Transaction Database with Utility Information using the HUP-Miner Algorithm
- Example 47 : Mining High-Utility Itemsets from a Transaction Database with Utility Information using the UP-Growth / UP-Growth+ Algorithm
- Example 48 : Mining High-Utility Itemsets from a Transaction Database with Utility Information using the IHUP Algorithm
- Example 49 : Mining High-Utility Itemsets from a Transaction Database with Utility Information using the mHUIMiner Algorithm
- Example 50 : Mining High-Utility Itemsets from a Transaction Database with Utility Information using the HMiner Algorithm
- Example 51 : Mining High-Utility Itemsets from a Transaction Database with Utility Information using the HUIM-SU Algorithm
- Example 52 : Mining High-Utility Itemsets from a Transaction Database with Utility Information using the ULB-Miner Algorithm
- Example 53 : Mining High-Utility Itemsets from a Transaction Database with Utility Information using the UFH Algorithm
- Example 54 : Mining High-Utility Itemsets from a Transaction Database with Utility Information using the d2HUP Algorithm
- Example 55 : Mining High-Utility Itemsets from a Transaction Database with Utility Information using the FHIM Algorithm
- Example 56 : Mining High-Utility Itemsets from a Transaction Database with Utility Information while considering Length Constraints, using the FHM+ algorithm
- Example 57 : Mining Cross-Level High-Utility Itemsets from a Transaction Database with Utility Information using the CLH-Miner algorithm
- Example 58: Mining Cross-Level High-Utility Itemsets from a Transaction Database with Utility Information using the FEACP algorithm
- Example 59 : Mining the Multi-Level High-Utility Itemsets from a Transaction Database with Utility Information using the MLHUI-Miner algorithm
- Example 60 : Mining Correlated High-Utility Itemsets in a Transaction Database with Utility Information using the FCHM_bond algorithm
- Example 61 : Mining Correlated High-Utility Itemsets in a Transaction Database with Utility Information using the FCHM_allconfidence algorithm
- Example 62 : Mining Frequent High-Utility Itemsets from a Transaction Database with Utility Information using the FHMFreq Algorithm
- Example 63 : Mining High-Utility Itemsets from a Transaction Database with Positive or Negative Unit Profit using the FHN Algorithm
- Example 64 : Mining High-Utility Itemsets from a Transaction Database with Positive or Negative Unit Profit using the HUINIV-Mine Algorithm
- Example 65 : Mining On-Shelf High-Utility Itemsets from a Transaction Database using the FOSHU Algorithm
- Example 66 : Mining On-Shelf High-Utility Itemsets from a Transaction Database using the TS-HOUN Algorithm
- Example 67 : Incremental High-Utility Itemset Mining in a Transaction Database with utility information using the EIHI Algorithm (source code version only)
- Example 68 : Incremental High-Utility Itemset Mining in a Transaction Database with utility information using the HUI-LIST-INS Algorithm (source code version only)
- Example 69 : Incremental Closed High-Utility Itemset Mining in a Transaction Database with utility information using the INCCHUI Algorithm (source code version only)
- Example 70 : Mining Closed High-Utility Itemsets from a transaction database with utility information using the EFIM-Closed Algorithm
- Example 71 : Mining Closed High-Utility Itemsets from a transaction database with utility information using the CHUI-Miner Algorithm
- Example 72 : Mining Closed High-Utility Itemsets from a transaction database with utility information using the CHUI-Miner(Max) Algorithm
- Example 73 : Mining Closed High-Utility Itemsets from a transaction database with utility information using the CHUD Algorithm
- Example 74 : Mining Closed High-Utility Itemsets from a transaction database with utility information using the CLS-Miner Algorithm
- Example 75 : Mining Closed High-Utility Itemsets from a transaction database with utility information using the HMiner-Closed Algorithm
- Example 76 : Mining Generators of High-Utility Itemsets from a transaction database with utility information using the GHUI-Miner Algorithm
- Example 77 : Mining High-Utility Generator Itemsets from a transaction database with utility information using the HUG-Miner Algorithm
- Example 78: Mining Closed High Utility Itemsets and High-Utility Generator Itemsets from a transaction database with utility information using the HUCI_Miner Algorithm
- Example 79 : Mining Minimal High-Utility Itemsets from a transaction database with utility information using the MinFHM Algorithm
- Example 80 : Mining Skyline High-Utility Itemsets in a transaction database with utility information using the SkyMine Algorithm
- Example 81 : Mining Skyline Frequent High-Utility Itemsets in a transaction database with utility information using the SFUI_UF Algorithm
- Example 82 : Mining Skyline Frequent High-Utility Itemsets in a transaction database with utility information using the SFU-CE Algorithm
- Example 83 : Mining High-Utility Sequential Rules from a Sequence Database with utility information using the HUSRM Algorithm
- Example 84 : Mining High-Utility Sequential Patterns from a Sequence Database with utility information using the USPAN Algorithm
- Example 85 : Mining High-Utility Probability Sequential Patterns from a Sequence Database with utility and probability information using the PHUSPM Algorithm
- Example 86 : Mining High-Utility Probability Sequential Patterns from a Sequence Database with utility information and probability using the UHUSPM Algorithm
- Example 87 : Mining High-Utility Itemsets based on Particle Swarm Optimization with the HUIM-BPSO algorithm
- Example 88 : Mining High Utility Itemsets Using a Genetic Algorithm with the HUIM-GA algorithm
- Example 89 : Mining High Utility Itemsets Using Ant Colony Optimization Algorithm with the HUIM-ACO algorithm
- Example 90 : Mining High Utility Itemsets Using Hill-Climbing with the HUIM-HC algorithm
- Example 91 : Mining High Utility Itemsets Using Simulated Annealing with the HUIM-SA algorithm
- Example 92 : Mining High-Utility Itemsets based on Particle Swarm Optimization with the HUIM-BPSO-tree algorithm
- Example 93 : Discovery of High Utility Itemsets Using a Genetic Algorithm with the HUIM-GA-tree algorithm
- Example 94 : Mining High-Utility Itemsets based on Particle Swarm Optimization with the HUIF-PSO algorithm
- Example 95 : Mining High-Utility Itemsets based on Particle Swarm Optimization with the HUIM-SPSO algorithm
- Example 96 : Mining High-Utility Itemsets Using a Genetic Algorithm with the HUIF-GA algorithm
- Example 97 : Mining High-Utility Itemsets Using a Bat Algorithm with the HUIF-BA algorithm
- Example 98 : Mining High-Utility Itemsets Using Artificial Fish Swarm Algorithm with the HUIM-AF algorithm
- Example 99 : Mining High-Utility Itemsets Using a Artificial Bee Colony Algorithm with the HUIF-ABC algorithm
- Example 100 : Mining Skyline Frequent-Utility Patterns using the SFUPMinerUemax algorithm
- Example 101 : Mining the Top-k high-utility itemsets using the TKU algorithm
- Example 102 : Mining the Top-k high-utility itemsets using the TKO (basic) algorithm
- Example 103 : Mining the Top-k high-utility itemsets using the THUI algorithm
- Example 104 : Mining the Top-k high-utility itemsets using the TKU-CE algorithm
- Example 105 : Mining the Top-k high-utility itemsets using the TKU-CE+ algorithm
- Example 106 : Mining the Top-k high-utility itemsets in a data stream using the FHMDS algorithm
- Example 107 : Mining High Average-Utility Itemsets in a Transaction Database with Utility Information using the HAUI-Miner Algorithm
- Example 108 : Mining High Average-Utility Itemsets in a Transaction Database with Utility Information using the EHAUPM Algorithm
- Example 109 : Mining High Average-Utility Itemsets in a Transaction Database with Utility Information using the HAUIM-GMU Algorithm
- Example 110 : Mining High Average-Utility Itemsets with Multiple Thresholds in a Transaction Database using the HAUI-MMAU Algorithm
- Example 111 : Mining High Average-Utility Itemsets with Multiple Thresholds in a Transaction Database using the MEMU Algorithm
- Example 112 : Mining Quantitative High Utility Itemsets in a Transaction Database using the VHUQI Algorithm
- Example 113 : Mining Quantitative High Utility Itemsets in a Transaction Database using the FHUQI-Miner Algorithm
- Example 114 : Mining the Top-K Quantitative High Utility Itemsets in a Transaction Database using the TKQ Algorithm
- Example 115 : Mining the Correlated Quantitative High Utility Itemsets in a Transaction Database using the CHUQI-Miner Algorithm
- Example 116 : Mining Irregular High-Utility Itemsets using the PHM_irregular algorithm
- Example 117 : Mining Local High Utility Itemsets in a Transaction Database using the LHUI-Miner Algorithm
- Example 118 : Mining Peak High Utility Itemsets in a Transaction Database using the PHUI-Miner Algorithm
- Example 119 : Mining Locally Trending High Utility Itemsets in a Transaction Database using the LTHUI-Miner Algorithm
- Example 120 : Mining Low-cost High Utility Itemsets using the LCIM algorithm
- Example 121 : Mining High Utility Association Rules using the HGB / HGB-ALL Algorithm
Association Rule Mining
- Example 122 : Mining All Association Rules
- Example 123 : Mining All Association Rules with the lift measure
- Example 124 : Mining All Association Rules using the GCD algorithm
- Example 125 : Mining the IGB basis of Association Rules
- Example 126 : Mining Perfectly Sporadic Association Rules
- Example 127 : Mining Closed Association Rules
- Example 128 : Mining Minimal Non Redundant Association Rules
- Example 129 : Mining Indirect Association Rules with the INDIRECT algorithm
- Example 130 : Hiding Sensitive Association Rules with the FHSAR algorithm.
- Example 131 : Mining the Top-K Association Rules
- Example 132 : Mining the Top-K Class Association Rules (association rules with a fixed consequent)
- Example 133 : Mining the Top-K Non-Redundant Association Rules
Clustering
- Example 134 : Clustering using the K-Means algorithm
- Example 135 : Clustering using the DBScan algorithm
- Example 136 : Using Optics to extract a cluster-ordering of points and DB-Scan style clusters
- Example 137 : Clustering using the Bisecting K-Means algorithm
- Example 138 : Clustering using a Hierarchical Clustering algorithm
- Example 139 : Visualizing clusters using the Cluster Viewer
- Example 140 : Visualizing instances using the Instance Viewer
Sequential Pattern Mining
- Example 141 : Mining Frequent Sequential Patterns Using the PrefixSpan Algorithm
- Example 142 : Mining Frequent Sequential Patterns Using the GSP Algorithm
- Example 143 : Mining Frequent Sequential Patterns Using the SPADE Algorithm
- Example 144 : Mining Frequent Sequential Patterns Using the CM-SPADE Algorithm
- Example 145 : Mining Frequent Sequential Patterns Using the SPAM Algorithm
- Example 146 : Mining Frequent Sequential Patterns Using the CM-SPAM Algorithm
- Example 147 : Mining Frequent Sequential Patterns Using the FAST Algorithm
- Example 148 : Mining Frequent Sequential Patterns Using the LAPIN Algorithm
- Example 149 : Mining Frequent Closed Sequential Patterns Using the ClaSP Algorithm
- Example 150 : Mining Frequent Closed Sequential Patterns Using the CM-ClaSP Algorithm
- Example 151 : Mining Frequent Closed Sequential Patterns Using the CloFAST Algorithm
- Example 152 : Mining Frequent Closed Sequential Patterns Using the CloSpan Algorithm
- Example 153 : Mining Frequent Closed Sequential Patterns Using the BIDE+ Algorithm
- Example 154 : Mining Frequent Closed Sequential Patterns by Post-Processing using SPAM or PrefixSpan
- Example 155 : Mining Frequent Maximal Sequential Patterns Using the MaxSP Algorithm
- Example 156 : Mining Frequent Maximal Sequential Patterns using the VMSP Algorithm
- Example 157 : Mining Frequent Sequential Generator Patterns Using the FEAT Algorithm
- Example 158 : Mining Frequent Sequential Generator Patterns Using the FSGP Algorithm
- Example 159 : Mining Frequent Sequential Generator Patterns Using the VGEN Algorithm
- Example 160: Mining Nonoverlapping Sequential Patterns in One or Many Sequences Using the NOSEP Algorithm
- Example 161 : Mining Compressing Sequential Patterns Using the GoKrimp Algorithm
- Example 162 : Mining Frequent Top-K Sequential Patterns Using the TKS Algorithm
- Example 163 : Mining Frequent Top-K Sequential Patterns Using the TSP Algorithm
- Example 164 : Mining Frequent Multi-dimensional Sequential Patterns Using SeqDIM (with PrefixSpan and Apriori)
- Example 165 : Mining Frequent Closed Multi-dimensional Sequential Patterns Using SeqDIM/Songram (with Bide+ and AprioriClose)
- Example 166 : Mining Sequential Patterns with Time Constraints from a Time-Extended Sequence Database
- Example 167 : Mining Sequential Patterns with flexible constraints from a Time-Extended Sequence Database with the SPM-FC-L algorithm
- Example 168 : Mining Sequential Patterns with flexible constraints from a Time-Extended Sequence Database with the SPM-FC-P algorithm
- Example 169 : Mining Closed Sequential Patterns with Time Constraints from a Time-Extended Sequence Database
- Example 170 : Mining Sequential Patterns with Time Constraints from a Time-Extended Sequence Database containing Valued Items (source code version only)
- Example 171 : Mining Closed Multi-dimensional Sequential Patterns from a Time-Extended Sequence Database
- Example 172 : Mining Progressive Sequential Patterns using the ProSecCo algorithm
- Example 173 : Finding all occurrences of some sequential pattern(s) by post-processing using the Occur algorithm
- Example 174 : the QCSP algorithm for mining the top-k quantive cohesive sequential patterns in a single sequence or in multiple sequences (thanks to Lens Fereman et al.)
- Example 175: Mining Cost-Efficient Sequential Patterns Using CEPB Algorithm
- Example 176: Mining Cost-Efficient Sequential Patterns Using CorCEPB Algorithm
- Example 177: Mining Cost-Efficient Sequential Patterns Using CEPN Algorithm
Sequential Rule Mining
- Example 178 : Mining Sequential Rules Common to Several Sequences with the CMRules algorithm
- Example 179 : Mining Sequential Rules Common to Several Sequences with the CMDeo algorithm
- Example 180 : Mining Sequential Rules Common to Several Sequences with the RuleGrowth algorithm
- Example 181 : Mining Sequential Rules Common to Several Sequences with the ERMiner algorithm
- Example 182 : Mining Sequential Rules between Sequential Patterns with the RuleGen algorithm
- Example 183 : Mining Sequential Rules Common to Several Sequences with the Window Size Constraint using TRuleGrowth
- Example 184 : Mining the Top-K Sequential rules
- Example 185: Mining the Top-K Class Sequential rules (sequential rules with a fixed consequent)
- Example 186 : Mining the Top-K Non-Redundant Sequential rules
Sequence Prediction (source code version only)
- Example 187 : Perform Sequence Prediction using the CPT+ Sequence Prediction Model
- Example 188 : Perform Sequence Prediction using the CPT Sequence Prediction Model
- Example 189 : Perform Sequence Prediction using the PPM Sequence Prediction Model
- Example 190 : Perform Sequence Prediction using the DG Sequence Prediction Model
- Example 191 : Perform Sequence Prediction using the AKOM Sequence Prediction Model
- Example 192 : Perform Sequence Prediction using the TDAG Sequence Prediction Model
- Example 193 : Perform Sequence Prediction using the LZ78 Sequence Prediction Model
- Example 194 : Comparing Several Sequence Prediction Models
Periodic pattern mining
- Example 195 : Mining Periodic Frequent Patterns using the PFPM algorithm
- Example 196 : Mining Local Periodic Frequent Patterns using the LPP-Growth, LPPM_breadth or LPPM_depth algorithm
- Example 197 : Mining Stable Periodic Frequent Patterns using the SPP-Growth algorithm
- Example 198 : Mining the Top-k Stable Periodic Frequent Patterns using the TSPIN algorithm
- Example 199 : Mining Self-Reliant Periodic Frequent Patterns using the SRPFPM algorithm
- Example 200 : Mining Productive Periodic Frequent Patterns using the PPFP algorithm
- Example 201 : Mining Non-Redundant Periodic Frequent Patterns using the NPFPM algorithm
- Example 202 : Mining Periodic High-Utility Itemsets using the PHM algorithm
- Example 203 : Mining Periodic Patterns in Multiple Sequences using the MPFPS-BFS or MPFPS-DFS algorithms
- Example 204 : Mining Rare Correlated Periodic Patterns in Multiple Sequences using the MRCPPS algorithm
Episode Mining
- Example 205 : Mining the Top-K Frequent Episodes in a Complex Sequence using the TKE algorithm
- Example 206 : Mining Frequent Episodes in a Complex Sequence using the EMMA algorithm, which counts the support based on the head frequency
- Example 207 : Mining Frequent Episodes in a Complex Sequence using the AFEM algorithm, which counts the support based on the head frequency
- Example 208 : Mining Frequent Episodes in a Complex Sequence using the MINEPI+ algorithm, which counts the support based on the head frequency
- Example 209 : Mining Frequent Episodes in a Complex Sequence using the MINEPI algorithm, which counts the support based on minimal occurrences
- Example 210 : Mining Maximal Frequent Episodes in a Complex Sequence using the MaxFEM algorithm, which counts the support based on the head frequency
- Example 211 : Mining Partially-Ordered Episode Rules in a Complex Sequence using the POERM, or POERM-ALL algorithms
- Example 212 : Mining Partially-Ordered Episode Rules in a Complex Sequence using the POERMH algorithm
- Example 213: Mining Episode Rules in a Complex Sequence using the TKE, MINEPI+, AFEM, or EMMA algorithm
- Example 214: Mining Episode Rules in a Complex Sequence with the Non-Overlapping Frequency using the NONEPI algorithm
- Example 215 : Mining High Utility Episodes using the HUE-SPAN algorithm
- Example 216 : Mining High Utility Episodes using the UP-SPAN algorithm
- Example 217 : Mining the Top-K High Utility Episodes using the TUP algorithm
Graph Pattern Mining
- Example 218 : Mining the Top-K Frequent Subgraphs in a Graph Database using the TKG algorithm
- Example 219 : Mining Frequent Subgraphs in a Graph Database using the gSpan algorithm
- Example 220 : Mining Frequent Closed Subgraphs in a Graph Database using the cgSpan algorithm
- Example 221 : Mining Significant Trend Sequence in a Dynamic Attributed Graph using the TSeqMiner algorithm
Text Mining
- Example 223 : Clustering Texts with a text clusterer
- Example 224 : Classifying Text documents using a Naive Bayes approach (source code version only)
Time Series Mining
- Example 225 : Vizualize time series using the time series viewer
- Example 226 : Calculate the prior moving average of time series
- Example 227 : Calculate the cumulative moving average of time series
- Example 228 : Calculate the central moving average of time series
- Example 229 : Calculate the min max normalization of a time series
- Example 230 : Calculate the standardization of a time series
- Example 231 : Calculate the median smoothing of a time series
- Example 232 : Calculate the exponential smoothing of a time series
- Example 233 : Calculate the first order differencing of a time series
- Example 234 : Calculate the second order differencing of a time series
- Example 235 : Calculate the piecewise aggregate approximation of time series
- Example 236 : Calculate the autocorelation function of a time series
- Example 237 : Calculate the regression line of a time series using the least square method, and perform time series forecasting
- Example 238 : Split time series by length
- Example 239 : Split time series by number of segments
- Example
240 : Convert time series to sequences using the SAX
algorithm (useful to then apply sequential pattern mining/rule
algorithms)
Besides the above example for time series mining, clustering algorithms such as K-Means can also be applied to time-series.
Classification
- Example 241 : How to train the ID3 classifier to perform classification (source code version only)
- Example 242 : How to train the KNN classifier to perform classification (source code version only)
- Example 243 : How to train the CMAR classifier to perform classification (source code version only)
- Example 244 : How to train the ACAC classifier to perform classification (source code version only)
- Example 245 : How to train the ACCF classifier to perform classification (source code version only)
- Example 246 : How to train the ACN classifier to perform classification (source code version only)
- Example 247 : How to train the ADT classifier to perform classification (source code version only)
- Example 248 : How to train the CBA classifier to perform classification (source code version only)
- Example 249 : How to train the CBA2 classifier to perform classification (source code version only)
- Example 250 : How to train the CMAR classifier to perform classification (source code version only)
- Example 251 : How to train the L3 classifier to perform classification (source code version only)
- Example 252 : How to train the CMAR classifier to perform classification (source code version only)
- Example 253 : How to train the MAC classifier to perform classification (source code version only)
- Example 254 : Run an experiment to compare many classifiers such as ID3, CMAR, ACCF, CBA and CBA2. (source code version only)
Dataset tools
- Example 255 : Converting a sequence database to SPMF format (CSV, KOSARAK, IBM, BMS, Snake...)
- Example 256 : Converting a transaction database to SPMF format (CSV...)
- Example 257 : Converting a sequence database to a transaction database
- Example 258 : Converting a transaction database to a sequence database
- Example 259 : Converting a sequence database with cost values to a transaction database with cost values
- Example 260 : Generating a synthetic sequence database
- Example 261 : Generating a synthetic sequence database with timestamps
- Example 262 : Generating a synthetic transaction database
- Example 263 : Generating synthetic utility values for a transaction database without utility values
- Example 264 : Calculating statistics for a sequence database
- Example 265 : Calculating statistics for a transaction database
- Example 266 : Calculating statistics for a transaction database with utility information
- Example 267 : Add consecutive timestamps to a sequence database without timestamps
- Example 268 : Using the ARFF format in the source code version of SPMF
- Example 269 : Using a TEXT file as input in the source code version of SPMF
- Example 270 : Fix a transaction database
- Example 271 : Fix item ids in a transaction database
- Example 272 : Fix a transaction database with utility and time information
- Example 273 : Remove utility information from a transaction database
- Example 274 : Resize a database in SPMF format (a text file)
Other tools
- Example 275 : Open a text file using the SPMF text editor
- Example 276 : Open a graph file using the SPMF graph viewer
- Example 277 : Open the Algorithm Explorer to view informations about algorithms
Experiments
Copyright © 2008-2023 Philippe Fournier-Viger. All rights reserved.
