检索结果-内蒙古大学图书馆

A text classification method based on the improved CR-tree and the weighted association rule

Journal of computational Information Systems 2009年第6期5卷 1577-1584页

作者： Wang, Yu Zhao, Yao Yuan, Fang College of Mathematics and Computer Science Hebei University Baoding 071002 China Key Lab. in Machine Learning and Computational Intelligence of Hebei Province Baoding 071002 China

Classification based on association rules is a common and easily understand algorithm for text classification. To improve its classification accuracy, the key is to generate more effective rules. Sometimes, it will overdraw the role of some training texts. To avoiding this and generate more effective rules, this paper defines the Classification Path and proposes a new text classifier (CP-tree) based on CR-tree. When a new text is coming, to avoid overdrawing, association rules are generated through scanning Classification Path;in addition, to make the role of association rules in class prediction more reasonable, the association rules and weight for the new text are obtained not only according to the training texts, but also the new texts. Experimental results show that the accuracy of text classification is improved with the algorithm based on CP-tree. 1553-9105/ Copyright © 2009 Binary Information Press.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Support vector machine for suppressing error method

Support vector machine for suppressing error method

引用

1st International Conference on Information Science and Engineering, ICISE2009

作者： Lu, Shuxia Shi, Pu Chen, Ming Key Lab. of Machine Learning and Computational Intelligence College of Mathematics and Computer Science Hebei University Baoding China Baoding Pascali Cable TV Integrater Information Network Co. Ltd. Baoding China College of Mathematics and Computer Science Hebei University Baoding China

ISBN: (纸本)9780769538877

Support Vector machine (SVM) is sensitive to noises and outliers. For reducing the effect of noises and outliers, we propose a novel SVM for suppressing error function. The error function is limited to the interval of [0, 1]. The separation hypersurface is simplified and the margin of hypersurface is widened. Experimental results show that our proposed method is able to simultaneously increase the classification efficiency and the generalization ability of the SVM.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Markov property of Markov chains and its test

Markov property of Markov chains and its test

引用

International Conference on machine learning and Cybernetics (ICMLC)

作者： Yu-Fen Zhang Qun-Feng Zhang Rui-Hua Yu Key Lab. for Machine Learning and Computational Intelligence Hebei University Baoding China Department of Information Technology Baoding University Baoding China

Markov chains, with Markov property as its essence, are widely used in the fields such as information theory, automatic control, communication techniques, genetics, computer sciences, economic administration, education administration, and market forecasts. While using Markov chains to predict the future events, we must test the Markov property of random variable sequences of the past statistic data. Only when the random variable sequences satisfy the Markov property, can the prediction could be precise. This paper discusses the concept of Markov property and its features, studies its test method, and by example demonstrates the effectiveness of this prediction method.

关键词： Markov processes Random variables machine learning Biological system modeling Prediction methods Water resources

来源：评论

学校读者我要写书评

暂无评论

A HSC-based sample selection method for Support Vector machine

A HSC-based sample selection method for Support Vector Machi...

引用

International Conference on machine learning and Cybernetics

作者： He, Qing Li, Ning Shi, Zhong-Zhi Key Laboratory of Intelligent Information Processing Institute of Computing Technology Hebei University Baoding 071002 Hebei China Graduate University of Chinese Academy of Sciences Hebei University Baoding 071002 Hebei China Key Lab. of Machine Learning and Computational Intelligence College of Mathematics and Computer Science Hebei University Baoding 071002 Hebei China

ISBN: (纸本)9781424465262

Support Vector machine (SVM) is a classification technique of machine learning based on statistical learning theory. A quadratic optimization problem needs to be solved in the algorithm, and with the increase of the samples, the time complexity will also increase. So it is necessary to shrink training sets to reduce the time complexity. A sample selection method for SVM is proposed in this paper. It is inspired from the Hyper surface classification (HSC), which is a universal classification method based on Jordan Curve Theorem, and there is no need for mapping from lower-dimensional space to higher-dimensional space. The experiments show that the algorithm shrinks training sets keeping the accuracy for unseen vectors high. © 2010 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

A DYNAMIC FUZZY MEASURE FOR MULTIPLE CLASSIFIER FUSION

A DYNAMIC FUZZY MEASURE FOR MULTIPLE CLASSIFIER FUSION

引用

2009 International Conference on machine learning and Cybernetics(2009机器学习与控制论国际会议)

作者： YA-JING ZHANG XUE-FEI LI JUN-FEN CHEN HUI-MIN FENG College of Science Agricultural University of Hebei Baoding 071001 China Key Lab.of Machine Learning and Computational Intelligence College of Mathematics and Computer Scie

It has been shown that the fuzzy integral is an effective tool for the fusion of multiple classifiers. Of primary importance in the development of the system is the choice of the measure which embodies the importance of subsets of classifiers. In this paper we propose a method for a dynamic fuzzy measure which will change following the pattern to be classified (data dependent). This method uses the neural network which has good study ability. Our experiment results show that this method make the classification accurate improve.

关键词： Multiple classifier Fusion Fuzzy measure Fuzzy integral Neural network

来源：评论

学校读者我要写书评

暂无评论

AN INSTANCE SELECTION ALGORITHM BASED ON CONTRIBUTION

AN INSTANCE SELECTION ALGORITHM BASED ON CONTRIBUTION

引用

2008 International Conference on machine learning and Cybernetics(2008机器学习与控制论国际会议)

作者： XI-ZHAO WANG NING ZHANG TAO XIAO Key Lab.for Machine Learning and Computational Intelligence College of Mathematics and Computer Sci College of Science Agricultural University of Hebei Baoding 071002 China

This paper presents an approach to instance selection for the nearest neighbor rule which aims to obtain a condensed set with high condensing rate and prediction accuracy. By making an improvement on MCS algorithm and allowing certain error rate on the training set, a condensed set with high condensing rate and satisfying prediction accuracy is obtained. The condensed set is order-independent of the training instances and insensitive to noise. Comparative experiments have been conducted on real data sets, and the results show its superiority to MCS and FCNN in terms of condensing rate and prediction accuracy.

关键词： Instance selection nearest neighbor rule condensed set MCS FCNN

来源：评论

学校读者我要写书评

暂无评论

Refining Width Parameter of Gaussian Kernel Functionfor Tuning Coherent Point Drift(CPD) Registration

Refining Width Parameter of Gaussian Kernel Functionfor Tuni...

引用

作者： Junfen CHEN Qiang HE Yan LI Key Lab of Machine Learning and Computational Intelligence College of Mathematics and Information Sciences Hebei University School of Sciences Beijing University of Civil Engineering and Architecture

Coherent point drift(CPD), a sophistic non-rigid point sets registration method, is successfully applied in computer vision, medical image analysis, to name a few. Its registration error, however, is affected greatly by three free parameters. One of them, width parameter of Gaussian kernel function, is studied in this paper to tune registration error of the CPD method. Before computing width parameter by a heuristic algorithm, the given data is regulated using minmax and standard normalization in effort to remove heterogeneity among the features of the data. Several experiments are designed on the available six datasets to examine the effectiveness of CPD based on the refined width parameter. Experimental comparison indicated that the refined width parameter from the normalized data can reduce registration error of the CPD method, e.g., by 13.76% on bat dataset.

关键词： Normalization Gaussian kernel Width parameter Coherent point drift(CPD) Registration error(MSE)

来源：评论

学校读者我要写书评

暂无评论

A deep web interface integration approach based on domain knowledge and submitting queries

引用

Journal of Information and computational Science 2009年第3期6卷 1103-1111页

作者： Yuan, Fang Liu, Hongfei Wei, Yonggang Yao, Zengli College of Mathematics and Computer Science Hebei University Hebei Baoding 071002 China Key Lab. in Machine Learning and Computational Intelligence of Hebei Province Hebei Baoding 071002 China

Deep Web can provide us a great amount of high quality information. In order to make full use of the information, it is becoming urgent to establish Deep Web data integration system, in which Deep Web interface integration is an important component. This paper proposes a deep web interface integration method based on domain knowledge and submitting queries for certain domains. Before application this method, we categorize Deep Web interfaces according to their structures and introduce the concept of interface element, which be used to represent the interface. This approach first selects the required attributes, and then matches these attributes in each interface element, after that integrates each interface element which matches the same attribute to generate the global interface. This method includes interface template matching, domain knowledge-based interface elements matching and submitting queries-based interface elements matching, etc. Experimental results show that the proposed method has higher matching accuracy and lower dependency on preparatory work. 1548-7741/ Copyright © 2009 Binary Information Press.

关键词： Domain Knowledge

来源：评论

学校读者我要写书评

暂无评论

USING 2-ADDITIVE FUZZY MEASURE IN MULTIPLE CLASSIFIER SYSTEM

USING 2-ADDITIVE FUZZY MEASURE IN MULTIPLE CLASSIFIER SYSTEM

引用

2009 International Conference on machine learning and Cybernetics(2009机器学习与控制论国际会议)

作者： AI-XIA CHEN GUO-FANG ZHANG NING LI LI ZHAO GUO-QIANG YUAN Key Lab.of Machine Learning and Computational Intelligence College of Mathematics and Computer Scie Department of Basic Courses Hebei College of Finance Baoding 071051 China

Fuzzy measure and integral are widely used in Multiple Classifier System (MCS). But the number of coefficients involved in the fuzzy integral model grows exponentially with the number of classifiers to be aggregated. The main difficulty is to identify all these coefficients. This paper does an attempt Using 2-additrve fuzzy measure in Multiple Classifier System. Our conclusion is that when different interactions exist in different classifiers the complexity of the computation can be significantly reduced by 2-order additive measure.A simple example is included to illustrate the 2-order additive measure.

关键词： Fuzzy measure λ - fuzzy measure 2-additive fuzzy measure Interaction Multiple Classifier System

来源：评论

学校读者我要写书评

暂无评论

THE STUDY OF UNSTABLE CUT-POINT DECISION TREE GENERATION BASED-ON THE PARTITION IMPURITY

THE STUDY OF UNSTABLE CUT-POINT DECISION TREE GENERATION BAS...

引用

2009 International Conference on machine learning and Cybernetics(2009机器学习与控制论国际会议)

作者： XI-ZHAO WANG HUI-QIN ZHAO SHUAI WANG Key Lab.of Machine Learning and Computational Intelligence College of Mathematics and Computer Scie College of Mathematics and Computer Science Hebei University Baoding 071002 China

This paper is to discuss the reduction of computation complexity in decision tree generation for the numerical-valued attributes. The proposed method is based on the partition impurity. The partition impurity minimization is used to select the expanded attribute for generation the sub-node during the tree growth. After inducing the unstable cut-points of numerical-attributes, it is analytically proved that the partition impurity minimization can always be obtained at the unstable cut-points. It implies that the computation on stable cut-points may not be considered during the tree growth. Since the stable cut-points are far more than unstable cut-points, the experimental results show that the proposed method can reduce the computational complexity greatly.

关键词： Numerical-valued attributes decision trees Gini Indez Information entropy Partition impurity Unstable cut-point

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：