共查询到20条相似文献,搜索用时 9 毫秒
1.
《Expert systems with applications》2007,32(2):527-533
Texture can be defined as a local statistical pattern of texture primitives in observer’s domain of interest. Texture classification aims to assign texture labels to unknown textures, according to training samples and classification rules. This paper describes the usage of wavelet packet neural networks (WPNN) for texture classification problem. The proposed schema composed of a wavelet packet feature extractor and a multi-layer perceptron classifier. Entropy and energy features are integrated wavelet feature extractor. The performed experimental studies show the effectiveness of the WPNN structure. The overall success rate is about 95%. 相似文献
2.
Nguyen Vu-Lam Vu Ngoc-Son Phan Hai-Hong Gosselin Philippe-Henri 《Multimedia Tools and Applications》2017,76(21):22425-22444
Multimedia Tools and Applications - In this paper, we propose a micro-macro feature combination approach for texture classification. The two disparate yet complementary categories of features are... 相似文献
3.
Using association rules as texture features 总被引:1,自引:0,他引:1
Rushing J.A. Ranganath H.S. Hinke T.H. Graves S.J. 《IEEE transactions on pattern analysis and machine intelligence》2001,23(8):845-858
A new type of texture feature based on association rules is proposed in this paper. Association rules have been used in applications such as market basket analysis to capture relationships present among items in large data sets. It is shown that association rules can be adapted to capture frequently occurring local structures in images. Association rules capture both structural and statistical information, and automatically identifies the structures that occur most frequently and relationships that have significant discriminative power. Methods for classification and segmentation of textured images using association rules as texture features are described. Simulation results using images consisting of man made and natural textures show that association rule features perform well compared to other widely used texture features. It is shown that association rule features can distinguish texture pairs with identical first, second, and third order statistics, and texture pairs that are not easily discriminable visually 相似文献
4.
Mining fuzzy association rules for classification problems 总被引:3,自引:0,他引:3
The effective development of data mining techniques for the discovery of knowledge from training samples for classification problems in industrial engineering is necessary in applications, such as group technology. This paper proposes a learning algorithm, which can be viewed as a knowledge acquisition tool, to effectively discover fuzzy association rules for classification problems. The consequence part of each rule is one class label. The proposed learning algorithm consists of two phases: one to generate large fuzzy grids from training samples by fuzzy partitioning in each attribute, and the other to generate fuzzy association rules for classification problems by large fuzzy grids. The proposed learning algorithm is implemented by scanning training samples stored in a database only once and applying a sequence of Boolean operations to generate fuzzy grids and fuzzy rules; therefore, it can be easily extended to discover other types of fuzzy association rules. The simulation results from the iris data demonstrate that the proposed learning algorithm can effectively derive fuzzy association rules for classification problems. 相似文献
5.
6.
7.
提出以纹理联合关联规则来表达图像纹理特征以及挖掘纹理联合关联规则的算法。在纹理关联规则定义基础上,通过图像降噪预处理和数据挖掘预处理,采用模板统计挖掘方法挖掘低维和高维图像纹理联合关联规则。实验表明联合关联规则能够较好表达图像纹理特征,可以据此进行纹理分割。 相似文献
8.
目前已经提出了许多用于高效地发现大规模数据库中的关联规则的算法,但都是对关联规则中满足最小支持度的频繁项集的研究,没有对频繁项集中如何高效地计算得到满足最小置信度的关联规则进行研究.针对这种情况,提出了一种高效关联规则的挖掘算法EA,解决了在挖掘关联规则过程中如何高效挖掘满足最小置信度的关联规则问题. 相似文献
9.
《Knowledge》2005,18(2-3):99-105
The discovery of association rules is an important data-mining task for which many algorithms have been proposed. However, the efficiency of these algorithms needs to be improved to handle real-world large datasets. In this paper, we present an efficient algorithm named cluster-based association rule (CBAR). The CBAR method is to create cluster tables by scanning the database once, and then clustering the transaction records to the k-th cluster table, where the length of a record is k. Moreover, the large itemsets are generated by contrasts with the partial cluster tables. This not only prunes considerable amounts of data reducing the time needed to perform data scans and requiring less contrast, but also ensures the correctness of the mined results. Experiments with the FoodMart transaction database provided by Microsoft SQL Server show that CBAR outperforms Apriori, a well-known and widely used association rule. 相似文献
10.
一种高效的关联规则增量更新算法 总被引:3,自引:0,他引:3
对挖掘关联规则中FUP算法的关键思想以及性能进行了研究,提出了改进的FUP算法SFUP。该算法充分利用原有挖掘结果中候选频繁项集的支持数,能有效减少对数据库的重复扫描次数,并通过实验对这两种算法进行比较,结果充分说明了SFUP算法的效率要明显优于FUP算法。 相似文献
11.
12.
13.
Conventional algorithms for mining association rules operate in a combination of smaller large itemsets. This paper presents a new efficient which combines both the cluster concept and decomposition of larger candidate itemsets, while proceeds from mining the maximal large itemsets down to large 1-itemsets, named cluster-decomposition association rule (CDAR). First, the CDAR method creates some clusters by reading the database only once, and then clustering the transaction records to the kth cluster, where the length of a record is k. Then, the large k-itemsets are generated by contrasts with the kth cluster only, unlike the combination concept that contrasts with the entire database. Experiments with real-life databases show that CDAR outperforms Apriori, a well-known and widely used association rule. 相似文献
14.
StatApriori: an efficient algorithm for searching statistically significant association rules 总被引:2,自引:1,他引:1
Wilhelmiina Hämäläinen 《Knowledge and Information Systems》2010,23(3):373-399
Searching statistically significant association rules is an important but neglected problem. Traditional association rules
do not capture the idea of statistical dependence and the resulting rules can be spurious, while the most significant rules
may be missing. This leads to erroneous models and predictions which often become expensive. The problem is computationally
very difficult, because the significance is not a monotonic property. However, in this paper, we prove several other properties,
which can be used for pruning the search space. The properties are implemented in the StatApriori algorithm, which searches
statistically significant, non-redundant association rules. Empirical experiments have shown that StatApriori is very efficient,
but in the same time it finds good quality rules. 相似文献
15.
16.
针对MLKNN算法仅对独立标签进行处理,忽略现实世界中标签之间相关性这一问题,提出了一种基于关联规则的MLKNN多标签分类算法(FP-MLKNN)。该算法采用关联规则算法挖掘标签之间的高阶相关性,并用标签之间的关联规则改进MLKNN算法,以达到提升分类性能的目的。首先,使用MLKNN算法求样本的特征置信度;采用关联规则算法挖掘生成一系列强关联规则,进而将2种算法进行融合来构造多标签分类器,对新标签进行预测;在此基础上,将本文提出的算法与MLKNN、AdaBoostMH和BPMLL这3种算法进行实验对比。实验结果表明,本文所提算法在yeast、emotions和enron数据集上的分类性能均优于这3种算法,具有较好的分类效果。 相似文献
17.
关联规则是数据挖掘中的核心任务之一,近年来国内外对关联规则算法的改进取得了比较大的成果.概念格是由二元关系导出的形式化工具.体现了概念内涵和外延的统一,非常适合于发现数据中的潜在关系,因此关联规则的提取也是概念格的一个主要的应用领域,极大的提高了关联规则的挖掘效率,然而由于缺乏领域知识的指导,所挖掘出的规则有些是无意义的或无法满足用户的需要,所以在规则的提取中需要引入领域知识,而领域本体是领域知识的清晰而结构化的表示,因此提出了应用领域本体对生成的概念格进行调整,从而实现对规则提取的指导,以发掘出高层关联规则以及多层次间的关联规则,以满足用户的需要. 相似文献
18.
针对现有加权关联规则挖掘算法不能适用于矩阵加权数据的缺陷,给出一种新的矩阵加权项集剪枝策略,构建矩阵加权正负关联模式评价框架SRCCCI,提出一种新的基于SRCCCI评价框架的矩阵加权正负关联规则挖掘算法MWARM-SRCCCI。该算法克服了现有挖掘技术的缺陷,采用新的剪枝技术和模式评价方法,挖掘有效的矩阵加权正负关联规则,避免一些无效和无趣的模式产生。以中文Web测试集CWT200g为实验数据,与现有无加权正负关联规则挖掘算法比较,MWARM-SRCCCI算法的挖掘时间减幅最大可达74.74%。理论分析和实验结果表明,MWARM-SRCCCI算法具有较好的剪枝效果,候选项集数量和挖掘时间明显减少,挖掘效率得到极大提高,其关联模式可为信息检索提供可靠的查询扩展词来源。 相似文献
19.
针对医学图像数据的特殊性,提出了一种适合挖掘大量医学图像数据的关联分类算法.该算法以频繁模式树为基础,通过引入双支持度,排除一部分对分类无意义且存在干扰的项,以提高分类正确率.实验结果表明,当用于医学图像分类时,该算法可以取得同样的基于关联规则的分类算法CMAR更高的执行效率及更好的分类效果. 相似文献