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

A quasi-static clustering algorithm in mobile heterogeneous sensor network

Journal of Computational information Systems 2013年第9期9卷 3741-3749页

作者： Wang, Bingting Lin, Qibin Hu, Yanjun Liang, Hui Wang, Xianbing Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei 230039 China School of Mechanical and Electronic Engineering Chuzhou University Chuzhou 239000 China School of Information Science and Technology Southwest Jiaotong University Chengdu 610031 China

In this paper, we constructed the architecture of mobile heterogeneous sensor network by introducing user equipments (UEs) in static wireless sensor network. We analyzed the failure of traditional static clustering algorithm, gave a set of parameters that affected the performance of cluster heads in the mobile environment and proposed a Quasi-Static Clustering Algorithm (QSCA). Through theoretical analysis and simulation, this algorithm can reduce average delay and prolong network lifetime. We verified the adaptability of QSCA algorithm to energy consumption and dynamic topology by comparing with the LEACH algorithm. © 2013 by Binary information Press.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Attribute reduction based on approximation dependency degree

引用

Journal of Computers (Finland) 2013年第4期8卷 920-928页

作者： Li, Min Deng, ShaoBo Feng, Shengzhong Fan, Jianping NanChang Institute of Technology Nanchang Jiangxi 330099 China Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen Guangdong 518055 China Key laboratory of intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China

Attribute reduction is one of the core research content of Rough sets theory. Many existing algorithms mainly are aimed at the reduction of consistency decision table, and very little work has been done for attribute reduction aimed at inconsistency decision table. In fact, the methods finding Pawlak reduction from consistent decision table are not suitable for inconsistency decision table. In this paper, we introduce the approximation dependency reduction modal and present the Quick Attribution Reduction based on Approximation Dependency Degree (Quick-ARADD), which can retain the original boundary region and the original positive region unchanged, and keep the approximation accuracy unchanged for all decision equivalence classes (the partition of universe on decision attributes) of a decision table. Theoretical analysis and experimental results show that the Quick-ARADD algorithm is effective and feasible. © 2013 ACADEMY PUBLISHER.

关键词： Decision tables

来源：评论

学校读者我要写书评

暂无评论

Semantic separator learning and its applications in unsupervised Chinese text parsing

引用

Frontiers of Computer Science 2013年第1期7卷 55-68页

作者： Yuming WU Xiaodong LUO Zhen YANG Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Graduate University of the Chinese Academy of Sciences Beijing 100049 China China Telecom Corporation Limited Shanghai Branch Shanghai 200120 China Shanghai Research Institute of China Telecom Corporation Limited Shanghai 200120 China

Grammar learning has been a bottleneck problem for a long time. In this paper, we propose a method of seman- tic separator learning, a special case of grammar learning. The method is based on the hypothesis that some classes of words, called semantic separators, split a sentence into sev- eral constituents. The semantic separators are represented by words together with their part-of-speech tags and other infor- mation so that rich semantic information can be involved. In the method, we first identify the semantic separators with the help of noun phrase boundaries, called subseparators. Next, the argument classes of the separators are learned from cor- pus by generalizing argument instances in a hypernym space. Finally, in order to evaluate the learned semantic separators, we use them in unsupervised Chinese text parsing. The exper- iments on a manually labeled test set show that the proposed method outperforms previous methods of unsupervised text parsing.

关键词： semantic separator separator learning unsuper vised text parsing

来源：评论

学校读者我要写书评

暂无评论

Refining image annotation by integrating PLSA with random walk model

Refining image annotation by integrating PLSA with random wa...

引用

19th International Conference on Advances in Multimedia Modeling, MMM 2013

作者： Tian, Dongping Zhao, Xiaofei Shi, Zhongzhi Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Graduate University of the Chinese Academy of Sciences Beijing 100049 China

ISBN: (纸本)9783642357244

In this paper, we present a new method for refining image annotation by integrating probabilistic latent semantic analysis (PLSA) with random walk (RW) model. First, we construct a PLSA model with asymmetric modalities to estimate the posterior probabilities of each annotating keywords for an image, and then a label similarity graph is constructed by a weighted linear combination of label similarity and visual similarity. Followed by a random walk process over the label graph is employed to further mine the correlation of the keywords so as to capture the refining annotation, which plays a crucial role in semantic based image retrieval. The novelty of our method mainly lies in two aspects: exploiting PLSA to accomplish the initial semantic annotation task and implementing random walk process over the constructed label similarity graph to refine the candidate annotations generated by the PLSA. Compared with several state-of-the-art approaches on Corel5k and Mirflickr25k datasets, the experimental results show that our approach performs more efficiently and accurately. © Springer-Verlag 2013.

关键词： Image annotation

来源：评论

学校读者我要写书评

暂无评论

引用

15th Asia-Pacific Web Conference on Web Technologies and Applications, APWeb 2013

作者： Shang, Tianfeng He, Qing Zhuang, Fuzhen Shi, Zhongzhi Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Graduate School Chinese Academy of Sciences Beijing 100049 China

ISBN: (纸本)9783642374005

Collaborative filtering is one of the most popular techniques in recommender systems, and the key point is to find similar users and items. There are already some similarity measures, such as vector cosine similarity and Pearson's correlation coefficient, and so on. However, in some cases, what recommender systems get are not the ratings, but preference sequences of users on a series of items. For this type of data, those traditional similarity measures may fail to meet the practical application requirements. In this paper, a similarity measure based on inversion is proposed for preference sequences naturally. Based on the Inversion similarity measure, some structural information of user preference sequences is analyzed. By merging average precision and weighted inversion into similarity computation, a new similarity measure based on preference sequences is proposed for collaborative filtering. Experimental results show that the proposed similarity measure based on preference sequences outperforms the common similarity measures on the datasets with continuous real numbers. © 2013 Springer-Verlag.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Hybrid Designing of a Neural System by Combining Fuzzy Logical Framework and PSVM for Visual Haze-Free Task

引用

International Journal of Intelligence Science 2013年第4期3卷 145-161页

作者： Hong Hu Liang Pang Dongping Tian Zhongzhi Shi Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

Brain-like computer research and development have been growing rapidly in recent years. It is necessary to design large scale dynamical neural networks (more than 106 neurons) to simulate complex process of our brain. But such kind of task is not easy to achieve only based on the analysis of partial differential equations, especially for those complex neural models, e.g. Rose-Hindmarsh (RH) model. So in this paper, we develop a novel approach by combining fuzzy logical designing with Proximal Support Vector Machine Classifiers (PSVM) learning in the designing of large scale neural networks. Particularly, our approach can effectively simplify the designing process, which is crucial for both cognition science and neural science. At last, we conduct our approach on an artificial neural system with more than 108 neurons for haze-free task, and the experimental results show that texture features extracted by fuzzy logic can effectively increase the texture information entropy and improve the effect of haze-removing in some degree.

关键词： Artificial Brain Research Brain-Like Computer Fuzzy Logic Neural Network Machine Learning Hopfield Neural Network Bounded Fuzzy Operator

来源：评论

学校读者我要写书评

暂无评论

Mining approximate keys based on reasoning from XML data

Mining approximate keys based on reasoning from XML data

引用

17th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2013

作者： Yijun, Liu Feiyue, Ye Sheng, He School of Computer Engineering Jiangsu University of Technology Changzhou Jiangsu 213001 China Key Laboratory of Cloud Computing and Intelligent Information Processing of Changzhou City Changzhou Jiangsu 213001 China

ISBN: (纸本)9783642403187

Keys are very important for data management. Due to the hierarchical and flexible structure of XML, mining keys from XML data is a more complex and difficult task than from relational databases. In this paper, we study mining approximate keys from XML data, and define the support and confidence of a key expression based on the number of null values on key paths. In the mining process, inference rules are used to derive new keys. Through the two-phase reasoning, a target set of approximate keys and its reduced set are obtained. Our research conducted experiments over ten benchmark XML datasets from XMark and four files in the UW XML Repository. The results show that the approach is feasible and efficient, with which effective keys in various XML data can be discovered. © Springer-Verlag 2013.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Color image segmentation based on dynamic model and power spectrum

Color image segmentation based on dynamic model and power sp...

引用

International Conference on Materials Science and Manufacturing, ICMSM 2012

作者： Chen, Yupu Qiao, Yuanhua Miao, Jun College of Applied Sciences Beijing University of Technology Beijing 100124 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

ISBN: (纸本)9783037855614

In this paper, the locally coupled neural oscillator model and power spectrum are introduced to solve the color image segmentation problem. Firstly the single neuron oscillator model is developed, the model parameter is set so as to create limit circle simulating the activity of neuron. Then the locally coupled network model is developed, taking R, G, Bas external input separately, the network output three dynamic orbits representing R, G, B for each image point. Lastly, the power spectrum of the orbits is calculated for each image point, the color image is segmented using the calculated power spectrum. The performance is comparable to the results from other segmentation methods. © (2013) Trans Tech Publications, Switzerland.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Translation with source constituency and dependency trees

Translation with source constituency and dependency trees

引用

2013 Conference on Empirical Methods in Natural Language processing, EMNLP 2013

作者： Meng, Fandong Xie, Jun Song, Linfeng Lü, Yajuan Liu, Qun Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China Centre for Next Generation Localisation Faculty of Engineering and Computing Dublin City University Ireland

ISBN: (纸本)9781937284978

We present a novel translation model, which simultaneously exploits the constituency and dependency trees on the source side, to combine the advantages of two types of trees. We take head-dependents relations of dependency trees as backbone and incorporate phrasal nodes of constituency trees as the source side of our translation rules, and the target side as strings. Our rules hold the property of long distance reorderings and the compatibility with phrases. Large-scale experimental results show that our model achieves significantly improvements over the constituency-to-string (+2.45 BLEU on average) and dependency-to-string (+0.91 BLEU on average) models, which only employ single type of trees, and significantly outperforms the state-of-the-art hierarchical phrase-based model (+1.12 BLEU on average), on three Chinese-English NIST test sets. © 2013 Association for Computational Linguistics.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

The maximal relation based on a given relation schema and its concept lattice

Journal of Software

引用

Journal of Software 2013年第6期8卷 1308-1315页

作者： Lei, Yuxia Sui, Yuefei Tian, Jingying School of Computer Science Qufu Normal University Yantai Street 80 Rizhao 276826 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China School of Architectual Engineering Rizhao Politechnic Rizhao 276826 China

Formal concept analysis (FCA) is a valid tool for data mining and knowledge discovery, which identifies concept lattices from binary relations. Given a nonempty finite set A of binary attributes, one obtains a maximal binary relation Rmax based on a relation schema S(A). Firstly, we analyze concepts in Rmax and the concept lattice L(Rmax), and there are some important results as follows: for any two concepts in Rmax, the union of their intents is an intent of some concept in Rmax, and further the intent of their supremum is the union of their intents;for any two concepts in Rmax, if one of them is not a sub-concept or super-concept of the other one, then the union of their extents is not an extent of any concept in Rmax;L(Rmax) is a complemented distributive lattice. Secondly, we provide the structural connection between L(R) and L(Rmax): for any relation R based on S(A), there is a supremum-preserving order-embedding map from L(R) to L(Rmax), and conversely, there is an infimum-preserving order-preserving map from L(Rmax) to L(R), which is generally not a surjective homomorphism. Thirdly, we propose two algorithms to extract concepts in R from L(Rmax), which are respectively based on intents and extents of concepts, and prove their soundness. These results have already been used to analyze the data in architectual engineering and medical science. © 2013 ACADEMY PUBLISHER.

关键词： Formal concept analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：