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

LTFML: Multi-label learning based on label typical features

Journal of Computational information Systems 2015年第4期11卷 1497-1504页

作者： Zheng, Xiyuan Zhang, Huaxiang Fang, Xiaonan Meng, Lili School of Information Science and Engineering Shandong Normal University Jinan China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan China Jinan China

In recent years, multi-label learning is becoming a new research hot spot. In this paper, we proposed a multi-label learning method called LTFML based on the idea of trying to determine the typical features for each class label. First, LTFML choose those samples with some specific class label from the multilabel data set and cluster these selected samples. We use these clustering centers gained by above step as typical features which can represent effectively this class label. Then the distances between each sample and these clustering centers are used to represent each sample and weighted according to the standard deviations of each clustering cluster. Finally, a set of SVM classifiers are used to estimate the class label vector of unseen instance. Experimental results show that LTFML can have a very good performance over the well-known multi-label learning algorithms. 1553-9105/Copyright © 2015 Binary information Press

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

A Data Hiding Scheme Based on Lagrange Interpolation Algorithm and Multi-clouds

A Data Hiding Scheme Based on Lagrange Interpolation Algorit...

引用

International Symposium on Parallel Architectures, Algorithms and Programming (PAAP)

作者： Yu Jin Yadan Wang Wei Xia Li Deng Heng He Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial Wuhan China Department of Computer Science and Technology Wuhan University of Science and Technology

The use of cloud storage services has increased rapidly in many organizations. However, the security of data stored in the cloud still remains major concerns. Due to risks of service availability failure and the possibility of malicious insiders in the single cloud, researches about "multi-clouds" have emerged recently. Recent researches that are related to multi-clouds have some limitations. For instance, Redundant Array of Cloud Storage (RACS) does not ensure data confidentiality. The performance of system is low in DEPSKY and so on. This paper presents a data hiding scheme that is based on Lagrange interpolation algorithm and multi-clouds. This scheme addresses data availability, data confidentiality and vendor lock-in issue in cloud storage services through the erasure codes and Lagrange interpolation algorithm instead of encryption to store data on diverse clouds. The performance analysis was done through experiences. We observed that our scheme improved the performance for the response times of data uploaded and downloaded.

关键词： Cloud computing Interpolation Reed-Solomon codes Encoding Encryption

来源：评论

学校读者我要写书评

暂无评论

Multigranulation information fusion: A dempster-shafer evidence theory based clustering ensemble method

Multigranulation information fusion: A dempster-shafer evide...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Fei-Jiang Li Yu-Hua Qian Jie-Ting Wang Ji-Ye Liang School of Computer and Information Technology Shanxi University Taiyuan Shanxi China Chinese Information Processing of Ministry of Education Key Laboratory of Computational Intelligence Taiyuan Shanxi China

ISBN: (纸本)9781467372220

As an important reflection of human cognitive ability, the multi-granulation analysis gets more reasonable solution of a problem in comparison to the single granulation. Clustering analysis is an active area of machine learning and a fundamental technique of information granulation. By using different clustering algorithms and different parameters of an algorithm, a data set can be granulated into multiple granular spaces. Clustering ensemble with these granular spaces is an effective strategy of multigranulation information fusion. The existing algorithms of clustering ensemble can be categorized into three types: feature-based method, combinatorial method and graph-based method. Given the fact that every type of methods has their own advantages and disadvantages, combining their advantages will obtain better granulation results. Based on this consideration, this paper introduces a Dempster-Shafer evidence theory based clustering ensemble method that combines advantages of combinatorial method and graph-based method. In this strategy, the definition of mass functions considers neighbors of an object using the graph binarization and the final clustering ensemble result is generated by applying the Dempster's combination rule. The form of the Dempster's combination rule makes the algorithm conforming to the pattern of combinatorial method. Experimental results show that the proposed method yields better performance in comparison with other seven clustering ensemble methods conducted on fourteen numerical real-world data sets from the UCI Machine Learning Repository.

关键词： Clustering ensemble Dempster-Shafer evidence theory information fusion Multigranulation information fusion combinatorial method Evidence Theory Dempster and Shafer's theory Cluster Analysis Clustering algorithms granulation

来源：评论

学校读者我要写书评

暂无评论

XGRouter: high-quality global router in X-architecture with particle swarm optimization

引用

Frontiers of computer Science 2015年

作者： Liu, Genggeng Guo, Wenzhong Li, Rongrong Niu, Yuzhen Chen, Guolong College of Mathematics and Computer Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China

This paper presents a high-quality very large scale integration (VLSI) global router in X-architecture, called XGRouter, that heavily relies on integer linear programming (ILP) techniques, partition strategy and particle swarm optimization (PSO). A new ILP formulation, which can achieve more uniform routing solution than other formulations and can be effectively solved by the proposed PSO is proposed. To effectively use the new ILP formulation, a partition strategy that decomposes a large-sized problem into some small-sized sub-problems is adopted and the routing region is extended progressively from the most congested region. In the post-processing stage of XGRouter, maze routing based on new routing edge cost is designed to further optimize the total wire length and mantain the congestion uniformity. To our best knowledge, XGRouter is the first work to use a concurrent algorithm to solve the global routing problem in X-architecture. Experimental results show that XGRouter can produce solutions of higher quality than other global routers. And, like several state-of-the-art global routers, XGRouter has no overflow. © 2015 Higher Education Press and Springer-Verlag Berlin Heidelberg

关键词： VLSI circuits

来源：评论

学校读者我要写书评

暂无评论

Nearest Regularized Subspace Based Hyperspectral Image Classification with Adaptive Markov Random Field and High Confidence Index Rule

Nearest Regularized Subspace Based Hyperspectral Image Class...

引用

2015 IEEE International Conference on Progress in Informatics and Computing(PIC 2015)

作者： Tianming Zhan Yang Xu Zebin Wu School of Computer Science and Communication Engineering Jiangsu University Jiangsu Key Laboratory of Meteorological Observation and Information Processing Nanjing University of Information Science and Technology School of Computer Science and Engineering Nanjing University of Science and Technology

Spectral-spatial classification is very important in the field of remotely sensed hyperspectral imaging. The Markov Random Field(MRF) is usually used to provide the spatial constraint. However, the traditional construction of MRF uses a neighborhood and gives the same weight for all the pixels in the same neighborhood. Without the structure information in HSI, the performance of classification is not good enough. In this paper, we propose two improvements on MRF: the adaptive MRF is constructed according to spectral similarity of the spatial patch to reflect the structure information in HSI;a regularized method with a high confidence index(HCI) rule is presented to determine the refined probabilities of each pixel that promotes spatial continuity within each class. The effect of HCI rule is utilized to treat the probabilities discriminately, where the vectors with HCI are supposed to be well labeled. And the original probabilities of the pixels belong to each class are obtained by the spectral information using nearest regularized subspace(NRS) method in the first step. Experimental results on real hyperspectral data set demonstrate that the proposed method outperforms many existing methods in terms of the overall accuracy, average accuracy and kappa statistic.

关键词： Hyperspectral image classification Nearest regularized subspace Adaptive MRF High confidence index

来源：评论

学校读者我要写书评

暂无评论

An endocrine cooperative particle swarm optimization algorithm for routing recovery problem of wireless sensor networks with multiple mobile sinks

引用

information Sciences 2015年第1期300卷 100-113页

作者： Hu, Yi-Fan Ding, Yong-Sheng Ren, Li-Hong Hao, Kuang-Rong Han, Hua Engineering Research Center of Digitized Textile and Fashion Technology Ministry of Education Donghua University Shanghai 201620 China Shandong Computer Science Center (National Supercomputer Center in Jinan) Jinan 250014 China College of Information Sciences and Technology Donghua University Shanghai 201620 China Shandong Provincial Key Laboratory of Computer Network Jinan 250014 China College of Electronic and Electrical Engineering Shanghai University of Engineering Science Shanghai 201620 China

In the wireless sensor networks with multiple mobile sinks, the movement of sinks or failure of sensor nodes may lead to the breakage of the existing routes. In most routing protocols, the query packets are broadcasted to repair a broken path from source node to sink, which cause significant communication overhead in terms of both energy and delay. In order to repair broken path with lower communication overhead, we propose an efficient routing recovery protocol with endocrine cooperative particle swarm optimization algorithm (ECPSOA) to establish and optimize the alternative path. In the ECPSOA, mutation direction of the particle is determined by multi-swarm evolution equation, and its diversity is enriched by the endocrine mechanism, which can enhance the capacity of global search and improve the speed of convergence and accuracy of the algorithm. By using this method, the alternative path from source nodes to the sink with the optimal QoS parameters can be selected. Simulation results show that our routing protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption. © 2014 Elsevier Inc. All rights reserved.

关键词： Endocrine cooperative mechanism Multiple mobile sinks PSO algorithm Routing recovery Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Context-aware computing for smart home environment

引用

Journal of Computational information Systems 2015年第15期11卷 5453-5460页

作者： Liu, Li Fu, Xiaodong Liu, Lijun Huang, Qingsong Yunnan Provincial Key Laboratory of Computer Technology Application Faculty of Information Engineering and Automation Kunming University of Science and Technology Kunming China State-Province Joint Laboratory of Digital Home Interactive Applications School of Information Science & Technology Sun Yat-sen University Guangzhou China

Context-aware computing has proven to be successful in collecting and understanding various sensor data. However, providing an intelligent service by exploiting the collected context data from heterogeneous sensors is difficult on smart home because it is a complex environment with various devices and appliances. In this paper, we propose a context-aware computing approach for heterogeneous smart home environments. The key idea in this work is to integrate large-scale home context information from multiple heterogeneous sensors. We first define a semantic decision by context-aware inference including rule, inference and pattern driven. Then, a designed architecture that manages home environment is developed between large numbers of heterogeneous information entities and enhances intelligence abilities. Using the established rules and inferences, the proposed method is applicable for intelligent home to further discover more useful representative activities and personalized services with inhabitant needs. Experimental results show the effectiveness of our proposed method. Copyright © 2015 Binary information Press.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

ECNU at 2015 eHealth task 2: User-centred health information retrieval 16

ECNU at 2015 eHealth task 2: User-centred health information...

引用

16th Conference and Labs of the Evaluation Forum, CLEF 2015

作者： Song, Yang He, Yun Hu, Qinmin He, Liang Haacke, E. Mark Shanghai Key Laboratory of Multidimensional Information Processing East China Normal University Shanghai200241 China Department of Computer Science and Technology East China Normal University Shanghai200241 China MR Research Facility Department of Radiology Wayne State University DetroitMI48201 United States

This paper presents our work on the 2015 CLEF eHealth Task 2. In particular, we propose a Web-based query expansion model and a learning-to-rank algorithm to better understand and satisfy the task.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Completion time-a ware flow scheduling in heterogenous networks 1

引用

15th International Conference on Algorithms and Architectures for Parallel processing, ICA3PP 2015

作者： He, Shiming Xie, Kun Zhang, Dafang Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of Computer and Communication Engineering Hunan Province Engineering Research Center of Electric Transportation and Smart Distributed Network Changsha University of Science and Technology Changsha410114 China College of Computer Science and Electronics Engineering Hunan University Changsha410082 China Department of Electrical and Computer Engineering State University of New York at Stony Brook NY United States

ISBN: (数字)9783319271194

ISBN: (纸本)9783319271187

In China, the expressway isn’t free. When a vehicle exits, the exit toll station needs to calculate the toll according to the vehicle trajectory obtained by sending a trajectory query task to the trajectory center remotely. For the accurate of toll and keep the exit smoothly, transmitting the trajectory result reliably and in time is a key issue. There are three heterogenous networks in expressway, Fibernet, Telecommunications Network and 3G. We concurrently exploit three heterogenous networks by allocating the trajectory result into three sub-flows where each sub-flow is transmitted in one kind of networks. But existing multipath transfer solution(FMTCP) doesn’t consider the difference of completed time among all sub-flows and can’t make sure the completed time in time. Therefore, we formulate the sub-flows schedule as a integer programming problem, which is proved to be NP-hard problem, and propose a Completion time-aware Flow Scheduling scheme (CaFS) which calculates the size of sub-flows. For the reliably, it exploits generation-based network coding. For the transmission in time, CaFS allocates the size of sub-flow into suitable generation and scheduling the generations. The simulation results demonstrate that, comparing with the FMTCP, CaFS improves 31. 9% in completion time and 30% in task finished rate. © Springer International Publishing Switzerland 2015.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

An IABC Based Route Maintaining Protocol in Mobile Wireless Sensor Networks

An IABC Based Route Maintaining Protocol in Mobile Wireless ...

引用

2015 IEEE 16th International Conference on Communication technology(ICCT 2015)

作者： Xiaoming Wu Yinglong Wang Yifan Hu College of Information Science and Engineering Shandong University of Science and Technology Shandong Computer Science Center (National Supercomputer Center in Jinan) Shandong Provincial Key Laboratory of Computer Networks

Recent studies have shown that utilizing a mobile sink to harvest and carry data from wireless sensor network(WSN) can enhance network operations and balance the network energy consumption. Because of the sink mobility, the paths between the sensor nodes and the sink change frequently, and have profound influence on the lifetime of WSN. To find an efficient protocol that can maintain the routes between the mobile sink and nodes with few network resources are important. We propose a swarm intelligent algorithm based route maintaining protocol in this paper to resolve this issue. The protocol utilizes the concentric ring mechanism to guide the route researching direction, and the optimal routing selection to maintain the data delivery route. Using the immune based artificial bee colony(IABC) algorithm to optimize the forwarding path,the protocol could find an alternative path efficiently when sink moves. The results of our experiments demonstrate that the protocol could balance the network traffic load.

关键词： Wireless sensor networks Mobile sink Route maintaining Artificial bee colony algorithm Concentric ring

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：