Mining Frequent Patterns of Crime Using FP-Growth With Multiple Minimum Supports Based on Shannon Entropy

International Journal of Computer Applications
doi 10.5120/ijca2018916577
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Foundation of Computer Science

Related search

Improved Algorithm for Mining Maximum Frequent Patterns Based on FP-Tree

2012English

Analyzing Working of FP-Growth Algorithm for Frequent Pattern Mining

International Journal of Research Studies in Computer Science and Engineering
2017English

Pattern Mining on Stars With FP-Growth

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Query Expansion in Information Retrieval Using Frequent Pattern (FP) Growth Algorithm for Frequent Itemset Search and Association Rules Mining

International Journal of Advanced Computer Science and Applications
Computer Science
2019English

Discovering High Utility Itemsets With Multiple Minimum Supports

Intelligent Data Analysis
Computer VisionPattern RecognitionArtificial IntelligenceTheoretical Computer Science
2014English

Finite Polylogarithms, Their Multiple Analogues and the Shannon Entropy

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Velocity Analysis Based on Minimum Entropy

Geophysics
PetrologyEnergyGeochemistryGeophysics
1984English

Identification of Multiple Faults in Gearbox Based on Multipoint Optional Minimum Entropy Deconvolution Adjusted and Permutation Entropy

Entropy
Electronic EngineeringInformation SystemsMathematical PhysicsElectricalAstronomyPhysics
2018English

Mining Frequent Spatio-Temporal Sequential Patterns

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy