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

2017 International Conference on Progress in Informatics and computing(PIC)

作者： Hang Yu Xiaoxiao Qian Yang Yu Jiujun Cheng Ying Yu Shangce Gao College of Computer Science and Technology Taizhou University Faculty of Engineering University of Toyama Key Laboratory of Embedded System and Service Computing Ministry of EducationTongji University

ISBN: (纸本)9781538619797;9781538619780

By constructing a list of IF-THEN rules, the traditional ant colony optimization(ACO) has been successfully applied on data classification with not only a promising accuracy but also a user comprehensibility. However, as the collected data to be classified usually contain large volumes and redundant features, it is challenging to further improve the classification accuracy and meanwhile reduce the computational time for *** paper proposes a novel hybrid mutual information based ant colony algorithm(mrAM+) for classification. First, a maximum relevance minimum redundancy feature selection method is used to select the most informative and discriminative attributes in a dataset. Then, we use the enhanced ACO classifier(i.e., AM+)to perform the classification. Experimental results show that the proposed mrAM+ outperforms other seven state-of-art related classification algorithms in terms of accuracy and the size of model.

关键词： ant colony optimization mutual information classification data mining feature selection

来源：评论

学校读者我要写书评

暂无评论

A Privacy Preserving Algorithm Based on R-constrained Dummy Trajectory in Mobile Social Network

引用

Procedia Computer Science 2018年 129卷 420-425页

作者： Lina Ni Yanfeng Yuan Xiao Wang Jiguo Yu Jinquan Zhang College of Computer Science and Engineering Shandong University of Science and Technology Qingdao China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China School of Information Science and Engineering Qufu Normal University Shandong China

Recently the research of location privacy preserving has become a hot spot. Location privacy preserving involves not only a single location privacy but also the trajectory privacy where the mobile users in different locations publish the consecutive query requests. In this paper, we consider the problem of trajectory privacy preserving in MSN. Particularly, we propose privacy preserving algorithms based on R-constraint dummy trajectory (RcDT). By constraining the generating range R of the dummy positions, the generated dummy positions are within a certain range near the real locations. Furthermore, the dummy trajectories which have higher similarity to the real trajectories are generated via constraining both the single location exposure risk and the trajectory exposure risk.

关键词： Privacy preserving mobile social network trajectory privacy location-based service R-constrained dummy trajectory

来源：评论

学校读者我要写书评

暂无评论

A rich ranking model based on the matthew effect optimization 7th

A rich ranking model based on the matthew effect optimizatio...

引用

7th International Conference on Computational Data and Social Networks, CSoNet 2018

作者： Li, Jinzhong Liu, Guanjun Department of Computer Science and Technology College of Electronic and Information Engineering Jinggangshan University Ji’an343009 China Network and Data Security Key Laboratory of Sichuan Province University of Electronic Science and Technology of China Chengdu610054 China Department of Computer Science and Technology College of Electronic and Information Engineering Tongji University Shanghai201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China

ISBN: (纸本)9783030046477

Most existing approaches of learning to rank treat the effectiveness of each query equally which results in a relatively lower ratio of queries with high effectiveness (i.e. rich queries) in the produced ranking model. Such ranking models need to be further optimized to increase the number of rich queries. In this paper, queries with different effectiveness are distinguished, and the queries with higher effectiveness are given higher weights. We modify the gradient in the LambdaMART algorithm based on a new perspective of Matthew effect to highlight the optimization of the rich queries and to produce the rich ranking model, and we present a consistency theorem for the modified optimization objective. Based on the effectiveness evaluation criteria for information retrieval, we introduce the Gini coefficient, mean-variance and quantity statistics to measure the performances of the ranking models. Experimental results show that the ranking models produced by the gradient-modified LambdaMART algorithm based on Matthew effect exhibit a stronger Matthew effect compared to the original LambdaMART algorithm. © Springer Nature Switzerland AG 2018.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Robust Learning to Rank Based on Portfolio Theory and AMOSA Algorithm

引用

IEEE Transactions on systems, Man, and Cybernetics: systems 2017年第6期47卷 1007-1018页

作者： Li, Jinzhong Liu, Guanjun Yan, Chungang Jiang, Changjun Key Laboratory of the Ministry of Education for Embedded System and Service Computing Department of Computer Science and Technology Tongji University Shanghai201804 China Key Laboratory of Watershed Ecology and Geographical Environment Monitoring NASG Department of Computer Science and Technology Jinggangshan University Ji'an343009 China

Effectiveness is the most important factor considered in the ranking models yielded by algorithms of learning to rank (LTR). Most of the related ranking models only focus on improving the average effectiveness but ignore robustness. When a ranking model ignores robustness, the effectiveness for many queries is possibly very poor although the average effectiveness for all queries is relatively high. Therefore, Wang et al. first consider robustness in their ranking models. However, the robustness formula defined by Wang et al. cannot characterize those queries whose effectiveness are hurt seriously in comparison with the baseline model. In order to overcome this shortcoming, we propose a novel formula of characterizing robustness based on portfolio theory, and construct a multiobjective optimization model of the robust LTR in which the formula is used. Based on this model, we propose an approach of risk-sensitive and robust LTR, named as R2Rank, which is based on the framework of archived multiobjective simulated annealing algorithm and the idea of preference ranking organization method for enrichment evaluation. The experimental results show that the ranking models produced by our proposed R2Rank approach are better in both effectiveness and robustness than those produced by three state-of-the-art LTR approaches. © 2016 IEEE.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Spatial sparse subspace clustering for compressive spectral imaging

arXiv

引用

arXiv 2019年

作者： Zhu, Jianchen Zhang, Tong Zhao, Shengjie Hinojosa, Carlos Liu, Zengli Arce, Gonzalo R. Key Laboratory of Embedded System and Service Computing Ministry of Education School of Software Engineering Tongji University Shanghai201804 China School of Electronic and Information Engineering Tongji University Shanghai201804 China Department of System Engineering and Informatics Universidad Industrial de Santander Bucaramanga680002 Colombia Institute of information engineering and automation Computer Center Kunming University of Science and Technology Kunming650500 China Department of Electrical and Computer Engineering University of Delaware NewarkDE19716 United States

This paper aims at developing a clustering approach with spectral images directly from CASSI compressive measurements. The proposed clustering method first assumes that compressed measurements lie in the union of multiple low-dimensional subspaces. Therefore, sparse subspace clustering (SSC) is an unsupervised method that assigns compressed measurements to their respective subspaces. In addition, a 3D spatial regularizer is added into the SSC problem, thus taking full advantages of the spatial information contained in spectral images. The performance of the proposed spectral image clustering approach is improved by taking optimal CASSI measurements obtained when optimal coded apertures are used in CASSI system. Simulation with one real dataset illustrates the accuracy of the proposed spectral image clustering approach. Copyright © 2019, The Authors. All rights reserved.

关键词： Spectroscopy

来源：评论

学校读者我要写书评

暂无评论

Vision-based Semantic Mapping and Localization for Autonomous Indoor Parking

arXiv

引用

arXiv 2018年

作者： Huang, Yewei Zhao, Junqiao He, Xudong Zhang, Shaoming Feng, Tiantian Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai Department of Computer Science and Technology School of Electronics and Information Engineering Tongji University Shanghai School of Surveying and Geo-Informatics Tongji University Shanghai China

In this paper, we proposed a novel and practical solution for the real-time indoor localization of autonomous driving in parking lots. High-level landmarks, the parking slots, are extracted and enriched with labels to avoid the aliasing of low-level visual features. We then proposed a robust method for detecting incorrect data associations between parking slots and further extended the optimization framework by dynamically eliminating suboptimal data associations. Visual fiducial markers are introduced to improve the overall precision. As a result, a semantic map of the parking lot can be established fully automatically and robustly. We experimented the performance of real-time localization based on the map using our autonomous driving platform TiEV, and the average accuracy of 0.3m track tracing can be achieved at a speed of 10kph. Copyright © 2018, The Authors. All rights reserved.

关键词： Indoor positioning systems

来源：评论

学校读者我要写书评

暂无评论

MapReduce-based parallel GEP algorithm for efficient function mining in big data applications

MapReduce-based parallel GEP algorithm for efficient functio...

引用

作者： Liu, Yang Ma, Chenxiao Xu, Lixiong Shen, Xiaodong Li, Maozhen Li, Pengcheng School of Electrical Engineering and Information Sichuan University Chengdu610065 China Department of Electronic and Computer Engineering Brunel University London UxbridgeUB8 3PH United Kingdom Key Laboratory of Embedded Systems and Service Computing Ministry of Education Tongji University Shanghai200092 China State Grid Shanxi Electric Power Company Xi'an710048 China

Gene expression programming (GEP) algorithm is one of the most effective function mining algorithms in enabling the mathematical equation fitting for the input dataset. However, GEP algorithm encounters low efficiency issue in big data processing due to large overhead in its evolution when it handles the large-scale data. In order to solve the issue, this paper presents two parallelized GEP algorithms using MapReduce. Based on data separation, the first algorithm aims at speeding up the large-scale classification. However, it is lack of ability to output the mined equation explicitly. Therefore, based on the further improvements of the first algorithm, the second parallelized GEP algorithm aims at mining the equation efficiently and also outputs the equation explicitly and directly. The experimental results show that both algorithms are effective for processing large volume of data. © 2017 John Wiley & Sons, Ltd.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Differential Private Preservation Multi-core DBScan Clustering for Network User Data

引用

Procedia Computer Science 2018年 129卷 257-262页

作者： Lina Ni Chao Li Haoran Liu Anu G. Bourgeois Jiguo Yu College of Computer Science and Engineering Shandong University of Science and Technology Qingdao China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Department of Computer Science Georgia State University University Plaza Atlanta GA 30303 USA School of Information Science and Engineering Qufu Normal University Shandong China

Mining rich network user data to extract valuable information becomes the focus and commercial interest of researchers. Differential privacy protection is a new paradigm based on data distortion, which protects sensitive data while maintains a certain statistical properties by adding random noise, and makes up for the shortcomings that traditional schemas require knowledge background assumptions and cannot analyze quantitatively. In this paper, we propose a DP-MCDBScan schema based on the powerful differential privacy. We perform simulation to evaluate our schema, whose results show that our schema has better efficiency, accuracy, and privacy protection effect than previous schemas.

关键词： Private preserving differential privacy MCDBScan clustering data mining Laplace noise

来源：评论

学校读者我要写书评

暂无评论

Implicit cooperative caching based on information popularity for vehicular networks 12

Implicit cooperative caching based on information popularity...

引用

12th Workshop on Challenged Networks, CHANTS 2017

作者： Li, Yuhong Wang, Ji Lindgren, Anders Su, Xiang Riekki, Jukka State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China RISE SICS Sweden Luleå University of Technology Sweden Centre for Ubiquitous Computing University of Oulu Finland

ISBN: (纸本)9781450351447

Information-centric networking (ICN) technology is becoming a popular research topic in vehicular networks due to the connectionless and lightweight characteristics of this networking paradigm. Caching plays an essential role in information-centric networks, but current caching techniques for ICN are not ideal for the dynamic and wireless vehicular networks. This paper presents a caching approach for ICN-based vehicular networks that takes into account both the dynamicity of vehicular networks and the popularity of the information being distributed. We introduce an interval metric for selective caching. With this metric and estimates of information popularity and vehicle density, cooperative caching can be realized without exchanging cache management information among the vehicular nodes. Simulation results show that the proposed approach can increase the storage space utilization and has low data response time for vehicular networks. © 2017 Association for computing Machinery.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Automatic vector-based road structure mapping using multi-beam lidar

arXiv

引用

arXiv 2018年

作者： He, Xudong Zhao, Junqiao Sun, Lu Huang, Yewei Zhang, Xinglian Li, Jun Ye, Chen Key Laboratory of Embedded System and Service Computing Tongji University Ministry of Education Shanghai Department of Computer Science and Technology School of Electronics and Information Engineering Tongji University Shanghai School of Surveying and Geo-Informatics Tongji University Shanghai China School of Automotive Studies Tongji University Shanghai China

In this paper, we studied a SLAM method for vector-based road structure mapping using multi-beam LiDAR. We propose to use the polyline as the primary mapping element instead of grid cell or point cloud, because the vector-based representation is precise and lightweight, and it can directly generate vector-based High-Definition (HD) driving map as demanded by autonomous driving systems. We explored: 1) the extraction and vectorization of road structures based on local probabilistic fusion. 2) the efficient vector-based matching between frames of road structures. 3) the loop closure and optimization based on the pose-graph. In this study, we took a specific road structure, the road boundary, as an example. We applied the proposed matching method in three different scenes and achieved the average absolute matching error of 0.07 m. We further applied the mapping system to the urban road with the length of 860 meters and achieved an average global accuracy of 0.466 m without the help of high precision GPS. Copyright © 2018, The Authors. All rights reserved.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：