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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Multi-feature subspace learning via sparse correlation fusion and embedding

Multi-feature subspace learning via sparse correlation fusio...

引用

14th Pacific-Rim Conference on Multimedia, PCM 2013

作者： Zhang, Hong Zhang, Yanpeng College of Computer Science and Technology Wuhan University of Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing Real-time Industrial System China State Key Laboratory of Software Engineering Wuhan University Wuhan 430072 China

ISBN: (纸本)9783319037301

Subspace learning is most traditional and important in multimedia analysis. Numerous researches have focused on how to introduce machine learning and statistical methods to multimedia subspace learning for semantic understanding and denoising, and have gained remarkable achievement in different multimedia applications, such as content-based retrieval, data clustering, face recognition, etc. However, most of these researches are based on multimedia data of single modality. Nowadays, with the rapid development of multimedia and information technology, multimedia data of different modalities often coexist, and the presence of one has a complementary effect on the other to some extent. Because different multimedia data are usually represented with heterogeneous low-level features and there exists the wellknown semantic gap, it is interesting and challenging to learn multimedia semantics by multi-feature subspace learning of different modalities. In this paper, we analyze sparse canonical correlation between feature matrices of different multimedia data, construct an isomorphic sparse multi-feature subspace;moreover, we propose subspace optimization strategy with correlation fusion, which explores both geometrical-based content correlation and graph-based semantic correlation. Our algorithm has been applied to content-based multimodal retrieval and data classification. Comprehensive experiments have demonstrated the superiority of our method over several existing algorithms. © Springer International Publishing Switzerland 2013.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

A new feature evaluation method for visual tracking

引用

ICIC Express Letters, Part B: Applications 2013年第5期4卷 1303-1310页

作者： Jiang, Longkui Wang, Yuru School of Information Engineering Jilin Business and Technology College No. 1606 Haoyue Road Changchun 130062 China School of Computer Science and Information Technology Northeast Normal University No. 2555 Jingyue Street Changchun 130117 China Key Laboratory of Intelligent Information Processing of Jilin Province Northeast Normal University No. 2555 Jingyue Street Changchun 130117 China

Target modeling plays an important role in visual tracking, and it determines the precision of the tracking system. This paper proposed a statistical analysis based feature's discriminative ability evaluation method, which helps choosing the best feature for target modeling in a specific video. A number of randomly distributed sample points are generated around the target, and the sampling region covers both the target and its backgrounds. When different features are employed to observe these sample points, some statistical values of their similarities' distribution are used to evaluate their significance. Specially, a statistical evaluation model is constructed based on the observed samples' distribution analysis. Experiments are implemented employing different features, and their tracking results are in accordance with the evaluation results, which demonstrate the effectiveness of the proposed evaluation method in selecting salient features in varied conditions. © 2013 ISSN 2185-2766.

关键词： Statistical methods

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Uncertain subgraph query processing over uncertain graphs

Uncertain subgraph query processing over uncertain graphs

引用

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

作者： Ruan, Wenjing Wang, Chaokun Han, Lu Peng, Zhuo Bai, Yiyuan School of Software Tsinghua University Beijing 100084 China Tsinghua National Laboratory for Information Science and Technology Tsinghua University China Department of Computer Science and Technology Tsinghua University China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9783642374005

In some real-world applications, data cannot be measured accurately. Uncertain graphs emerge when this kind of data is modeled by graph data structures. When the graph database is uncertain, our query is highly possibly uncertain too. All of the prior works do not consider the uncertainty of the query. In this paper, we propose a new algorithm called Mutual-Match to solve the problem of uncertain subgraph query under the situation where both the graph dataset and the query are uncertain. Considering that the subgraph isomorphism verification is an NP-hard problem, and it will be more complex on uncertain graph data, the Mutual-Match algorithm uses MapReduce processes to find out all the subgraph matches and can adapt to dynamic graphs well. Experimental results on both real-world and synthetic datasets show the correctness and effectiveness of our proposed methods. © 2013 Springer-Verlag.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：