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

8th International Conference on information, Communications and Signal processing, ICICS 2011

作者： Chen, Jie Duan, Ling-Yu Li, Bing Ji, Rongrong Gao, Wen Institute of Digital Media School of Electronic Engineering and Computer Science Peking University Beijing China Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781457700309

We propose a novel locality sensitive vocabulary coding scheme to extract compact descriptors for low bit rate visual search. We employ Latent Dirichlet Allocation (LDA) to learn the topic vocabularies of lower dimension to generate compact descriptors. To deal with diverse datasets, LDA model is introduced to subdivide a dataset into groups of images with a topic model, where the code word distributions in each group produce coherent statistics from generative learning. Moreover, our empirical study has shown that the original Bag-of-Word (BoW) is sparse, and the occurrences of non-zero words is coherent within a topic. Our proposed topic-wise vocabulary learning yields a more compact yet discriminative codebook to search images. Given a query image, multiple topics are determined, which is fed into the topic vocabularies to generate more compact topical descriptor. Comparison experiments show our topic-wise locality sensitive vocabulary coding produces more compact and discriminative descriptors than the state-of-the-arts. © 2011 IEEE.

关键词： Statistics

来源：评论

学校读者我要写书评

暂无评论

Enriched format text categorization using a component similarity approach

Journal of Software

引用

Journal of Software 2011年第9期6卷 1713-1720页

作者： Zhu, Fei Yang, Jiong Zhou, Yong School of Computer Science and Technology Soochow University Suzhou Jiangsu 215006 China Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou China

Text categorization has been widely studied for years. However, conventional plain text categorization approaches which work good in plain text behave poor when they are simply applied to enriched format texts. An categorization approach that is applicable to enriched format text is proposed. During feature selection, we get feature structure distribution weight by using extended structure model so that structure affections to categorization are fully considered. Text formats are also taken into account in feature weighting. The combined feature weighting approach strengthens important parts and weakens less important ones. The text categorization is fulfilled by document component similarity, which first decomposes document, gathers features by components and other user-defined rules, completes document component tree, and then achieves categorization by it. We implement a CSBC based Naïve Bayes classifier in which the final result is the combination of all classifiers of component tree. Finally we parse *** document, draw components that are most related to classification from *** documents, and then use the classifier to categorize *** documents. The experiment results show that the classifier can automatically classify *** documents and work quite well. © 2011 ACADEMY PUBLISHER.

关键词： Classifiers

来源：评论

学校读者我要写书评

暂无评论

Privacy preservation in role-based access control model

引用

Journal of Networks 2011年第8期6卷 1106-1113页

作者： Chen, Zuo Yang, Qiuwei Wan, Xin Tu, Yuanyan Yu, Fei Xu, Chen School of Computer and Communication Hunan University Changsha China Jiangsu Provincial Key Laboratory for Computer Information Processing Technology Soochow University Soochow China

Privacy preservation is a crucial problem in resource sharing and collaborating among multi-domains. Based on this problem, we propose a role-based access control model for privacy preservation. This scheme avoided the privacy leakage of resources while implementing access control, and it has the advantage of lower communication overhead. We demonstrate this scheme meets the IND-CCA2 semantic security by using random oracle. The simulation result shows this scheme has better execution efficiency and application effects. © 2011 ACADEMY PUBLISHER.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Automated trust negotiation with time behavior

引用

Journal of Networks 2011年第8期6卷 1091-1098页

作者： Chen, Zuo Yang, Qiuwei Wan, Xin Tu, Yuanyan Yu, Fei Xu, Chen School of Computer and Communication Hunan University Chang sha China Jiangsu Provincial Key Laboratory for Computer Information Processing Technology Soochow University Soochow China

In automated trust negotiation(ATN), strangers build trust relationship by disclosing attributes credentials alternately. In the recent study of ATN, there was no rigorous formal definition of ATN abstract model, and have nothing to do with the time behavior. It exist denial of service attack which can lead system to paralysis. We present the basic components of ATN abstract model. It defines ATN abstract model by bringing state-transition system. Based on this formalized basis, the time behavior will be explored. We analyze and discuss some time semantics of ATN, and describe the extended ATN by constructing a state-transition system with time behavior. It can describe the ATN abstract model more comprehensive and secure. The satiability of security policies in ATN is discussed. © 2011 ACADEMY PUBLISHER.

关键词： Denial-of-service attack

来源：评论

学校读者我要写书评

暂无评论

On alpha-mean of Kullback-Leibler divergences for subspace selection

On alpha-mean of Kullback-Leibler divergences for subspace s...

引用

2011 8th International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2011, Jointly with the 2011 7th International Conference on Natural Computation, ICNC'11

作者： Chen, Si-Bao Wang, Hai-Xian Zhang, Xing-Yi Luo, Bin Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei 230039 China Key Lab of Child Development and Learning Science of Ministry of Education Research Center for Learning Science Southeast University Nanjing Jiangsu 210096 China

ISBN: (纸本)9781612841816

Fisher's linear discriminant analysis (FLDA) is one of the most well-known linear subspace selection methods. However, FLDA suffers from the class separation problem. The projection to a subspace tends to merge close class pairs. Recent results show that maximizing the geometric mean or harmonic mean of Kullback-Leibler (KL) divergences of class pairs can significantly reduce this problem. In this paper, to further reduce the class separation problem, the alpha-mean of divergences as a framework is proposed for subspace selection, with arithmetic mean, geometric mean and harmonic mean as special cases. We named it the maximization of the alpha-mean of all pairs of KL divergences (MAMD) criterion. A quasi-Newton method is applied to solve the optimization problem. Experiments on synthetic data and two datasets in UCI machine learning repository show the validity of MAMD. © 2011 IEEE.

关键词： Newton-Raphson method

来源：评论

学校读者我要写书评

暂无评论

An intelligent load balancing algorithm towards efficient cloud computing

An intelligent load balancing algorithm towards efficient cl...

引用

2011 AAAI Workshop

作者： Xu, Yang Wu, Lei Guo, Liying Chen, Zheng Yang, Lai Shi, Zhongzhi Agent-based Cooperative System Lab School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu SC 611731 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

ISBN: (纸本)9781577355243

MapReduce provided a novel computing model for complex job decomposition and sub-tasks management to support cloud computing with large distributed data sets. However, its performance is significantly influenced by the working data distributions over those data sets. In this paper, we put forward a novel model to balance data distribution to improve cloud computing performance in data-intensive applications, such as distributed data mining. By extending the classic MapReduce model with an agent-aid layer and abstracting working load requests for data blocks as tokens, the agents can reason from previously received tokens about where to send other tokens in order to balance the working tasks and improve system performance. Our key contribution lies in building an efficient token routing algorithm in spite of agents' unknowing to the global state of data distribution in cloud. We also built a prototype of our system, and the experimental results show that our approach can significantly improve the efficiency of cloud computing. Copyright © 2011, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Mining dynamical frequent itemsets based on ant colony algorithm

Mining dynamical frequent itemsets based on ant colony algor...

引用

IEEE International Conference on computer Science and Automation Engineering (CSAE)

作者： Chen, Shengbing Wang, Xiaofeng Wang, Xiaofang Key Lab of Network and Intelligent Information Processing Hefei University Hefei 230601 China Department of Computer Science and Technology Hefei University Hefei 230601 China Intelligent Computing Lab Institute of Intelligent Machines Chinese Academy of Sciences Hefei 230031 China Department of Computer Artillery Academy Hefei 230031 China

ISBN: (纸本)9781424487257

Mining frequent itemsets is a core problem in many data mining tasks, most existing works on mining frequent itemsets can only capture the long-term and static frequency itemsets, they do not suit the task whose frequent itemsets often change. Using the theory of ant colony algorithm, we proposed a new method for mining dynamical frequent itemset(called AC-MFI). The method considers the item of transaction as a node in the path, takes the itemset as a path, and takes each transaction as a foraging behavior. According to the pheromone updating policy of ant colony algorithm, AC-MFI mines dynamical frequent itemsets from transaction data stream. Experiment results show that the method is valid and practicable. © 2011 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

On a generalization of cubic spline interpolation

Journal of Software

引用

Journal of Software 2011年第9期6卷 1632-1639页

作者： Gao, Shang Zhang, Zaiyue Cao, Cungen School of Computer Science and Technology Jiangsu University of Science and Technology Zhenjiang 212003 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China

Based on analysis of basic cubic spline interpolation, the clamped cubic spline interpolation is generalized in this paper. The methods are presented on the condition that the first derivative and second derivative of arbitrary node are given. The Clamped spline and Curvature-adjusted cubic spline are also generalized. The methods are presented on the condition that the first derivatives of arbitrary two nodes or second derivatives of arbitrary two node are given. At last, these calculation methods are illustrated through examples. © 2011 ACADEMY PUBLISHER.

关键词： Interpolation

来源：评论

学校读者我要写书评

暂无评论

Differentiation and numerical integral of the cubic spline interpolation

引用

Journal of computers 2011年第10期6卷 2037-2044页

Based on analysis of cubic spline interpolation, the differentiation formulas of the cubic spline interpolation on the three boundary conditions are put up forward in this paper. At last, this calculation method is illustrated through an example. The numerical results show that the spline numerical differentiations are quite effective for estimating first and higher derivatives of equally and unequally spaced data. The formulas based on cubic spline interpolation solving numerical integral of discrete function are deduced. The degree of integral formula is n=3. The formulas has high accuracy. At last, these calculation methods are illustrated through examples. © 2011 ACADEMY PUBLISHER.

关键词： Interpolation

来源：评论

学校读者我要写书评

暂无评论

Road traffic freight volume forecast using support vector machine combining forecasting

Journal of Software

引用

Journal of Software 2011年第9期6卷 1680-1687页

The grey system forecasting model, neural network forecasting model and support vector machine forecasting model are proposed in this paper. Taking the road goods traffic volume from year of 1996 to 2003 in the whole country as a study case, the forecasting results are got by three methods. From the forecasting results, we can conclude that the accuracy of the support vector machine forecasting method is higher. Analyzing the characteristic of combining forecasting method, based on grey system forecasting model, neural network forecasting model and support vector machine forecasting model, the linear combining forecasting model, neural network combining forecasting model and support vector machine combining forecasting model are set up. Compared with single prediction methods, linear combining forecasting method and neural network combining forecasting model, the accuracy of the support vector machine combining forecasting method is higher. © 2011 ACADEMY PUBLISHER.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：