Machine Learning Techniques for Pattern Recognition in High-Dimensional Data Mining
Pochun Li

TL;DR
This paper introduces an SVM-based frequent pattern data mining algorithm that outperforms traditional methods in high-dimensional, sparse data environments, enhancing accuracy and robustness in pattern recognition.
Contribution
The paper presents a novel SVM-based approach for frequent pattern mining, effectively addressing high-dimensional and sparse data challenges with improved performance.
Findings
SVM-based algorithm outperforms traditional models in key metrics
Effective in high-dimensional, sparse data environments
Demonstrates strong pattern recognition and rule extraction capabilities
Abstract
This paper proposes a frequent pattern data mining algorithm based on support vector machine (SVM), aiming to solve the performance bottleneck of traditional frequent pattern mining algorithms in high-dimensional and sparse data environments. By converting the frequent pattern mining task into a classification problem, the SVM model is introduced to improve the accuracy and robustness of pattern extraction. In terms of method design, the kernel function is used to map the data to a high-dimensional feature space, so as to construct the optimal classification hyperplane, realize the nonlinear separation of patterns and the accurate mining of frequent items. In the experiment, two public datasets, Retail and Mushroom, were selected to compare and analyze the proposed algorithm with traditional FP-Growth, FP-Tree, decision tree and random forest models. The experimental results show that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Mining Algorithms and Applications
MethodsSupport Vector Machine
