一种新的改进的先验算法_OpenScirbe Publishing

Online Submission Pre-typesetting Academic Support

Home > Wen Yuan (Middle School Edition) > 2019 No.06 > 一种新的改进的先验算法

一种新的改进的先验算法

Author(s)：
夏磊

Publication Title：

Wen Yuan (Middle School Edition) 2019 No.06

Affiliations：
南昌工学院信息中心江西南昌 330108

Abstract：
先验算法是数据挖掘关联规则中的经典算法.因为先验算法需要多次扫描数据库,所以运行速度太慢.为了提高运行效率,本文在先验分析的基础上对先验算法进行了改进.改进的思想是将事务数据库转换成相应的0-1矩阵,将它的每个向量和随后的向量进行内积运算以获得支持,与给定的MinSupport相比,如果向量小于MinSupport,则会删除行和列,从而减小分级矩阵的大小,提高运行速度.由于改进后的算法在运行时只需扫描一次数据库,因此运行速度更快.实验表明,该改进算法是有效可行的.

Keywords：
先验关联规则;改进的先验算法;数据挖掘

Views
5

Citations
0

Downloads
0

Favorites
0

Full Text

Download PDF

Cite

Favorited

Favorite

Share via WeChat

Scan to share on WeChat

Mobile Reading

Scan to read on mobile

Cite

Copy

[1] 夏磊.一种新的改进的先验算法[J].Wen Yuan (Middle School Edition),2019(06),.

文渊(中学版)

Wen Yuan (Middle School Edition)

Language: 中文

CN：11-9275/G

ISSN：2096-627X

Publication Frequency: 月刊

Recommended Articles

Friendship Link

An academic processing and support platform focusing on journal databases, submission and review, and pre-typesetting.

OpenScirbe Publishing: Pre-typesetting; Article Retrieval

News: Latest news; Industry news

Academic Support: Language editing; Translation; International dissemination

Journal: Wen Yuan (Primary School Edition); Wen Yuan (Middle School Edition); Wen Yuan (High School Edition); Urban and Rural Studies

Contact Us

027-59496650

Office

Room 510, Office Tower, Optics Valley Financial Center, 668 Gaoxin Avenue, Donghu New Technology Development Zone, Wuhan, Hubei Province

User Agreement Privacy Policy

鄂ICP备2026003587号-1 copyright 2026 All rights reserved. Tel:027-59496650 鄂公网安备42018502009073号