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

IEEE International Conference on systems, Man and Cybernetics

作者： Yixi Wu Yaying Zhang Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

ISBN: (纸本)9781665442084

Path recommendation is an essential application in people’s daily life. However, drivers’ experience hidden in their driving history and their personal preferences are less considered in path planning. In this paper we propose a dynamic time-constrained path recommendation method, utilizing the historical GPS trajectory information and user preferences. First, based on graph entropy, critical intersections are extracted from trajectory information to simplify the road network structure. Then the time-dependent mostly chosen path (TDMCP) is obtained by trajectories processing to determine the time-varying paths between critical intersections. Thus the original complex road network is abstracted as a search subnet. Finally we propose an improved dynamic A* search (IDAS) on the search sub-net to find the candidate paths satisfying the time-constraints, and further allow users to set personal preferences to select the final optimal path. The proposed method is validated on the real-world data set, and the result shows that the proposed method surpasses the competing ones especially on long distance path recommendation.

关键词： Roads Conferences Entropy Trajectory History Data mining Cybernetics

来源：评论

学校读者我要写书评

暂无评论

Edge-weight-Based link prediction in heterogeneous graph

Edge-weight-Based link prediction in heterogeneous graph

引用

IEEE International Conference on Networking, Sensing and Control

作者： Jie Zong Zhijun Ding The key laboratory of embedded system and service computing ministry of education TONGJI University Shanghai China

ISBN: (纸本)9781665472449

Link prediction is to predict whether there is a link between two nodes in the graph, it is a very important application and plays a great role in various industries. In recent years, with the development of graph neural network technology, many algorithms make effort to study the expression of each node from the original graph data and use them to infer new links. However, most of the existing algorithms have a common problem when facing heterogeneous graphs, which is, they do not consider the weight of edges in graphs. Instead, they put all their energies into computing node features. Although a few algorithms such as RGCN are trying to take the influence of different link types into account while extracting node features, these implicit feature extractions do not start from the global information, but just calculate independently for each node. In other words, in these algorithms, even the same type of links will be abstracted into different features on different nodes. This is obviously inconsistent with reality. On the same map, the feature of the same link should be relatively fixed and should not be changed just because of different positions. In addition, when the current graph neural network algorithm is applied to link prediction, the link type to be predicted must be specified in advance, which makes the algorithm extremely inflexible. In order to solve these problems, we propose an edge weight calculation algorithm that extracts the edge feature from the whole graph. We also propose the edge-weight-based link prediction algorithm. By introducing edge weight into the MLP, there is no need to specify the target link type at the beginning of model training. It improves both the performance and efficiency of the link prediction model. Experiments on two datasets show that this edge-weight-based link prediction algorithm performs better than current algorithms and reaches SOTA.

关键词： Training Industries Semantics Predictive models Prediction algorithms Feature extraction Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

The preference relation and its application in the information system

The preference relation and its application in the informati...

引用

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

作者： Zhao Mingqing Key Laboratory of Embedded System and Service Computing Ministry of Education University of Tongji Shanghai China

In order to strengthen the traditional information system's capacity of describing practical problems, preference relation is introduced into information system and the concepts of preference information system, preference decision table, and information utility function are offered in this paper. In addition, the existence theorem of information utility function and several applications of information utility function in knowledge acquisition are provided.

关键词： Information systems Knowledge acquisition Economics Clustering methods Transforms Information science Approximation methods

来源：评论

学校读者我要写书评

暂无评论

Quality assessment for color images with tucker decomposition

Quality assessment for color images with tucker decompositio...

引用

IEEE International Conference on Image Processing

作者： Cheng, Cheng Wang, Hanli Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

As an extension of the singular value decomposition based approaches, a novel metric based on Tucker decomposition for color image quality assessment is proposed in this paper. It extracts both the spacial and chromatic information of a color image with Tucker decomposition. As compared to most of the other existing quality metrics for color images, the key advantage of the proposed metric is that it treats the color image as a whole entity instead of an assembly of three independent visual channels, and thus the interrelation among the different visual channels is well involved. Experimental results on the LIVE Database Release 2 demonstrate that the proposed metric can generally achieve similar or better performance than other metrics.

关键词： Tensile stress Measurement Image color analysis Color Matrix decomposition Image quality Vectors

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Heterogeneous Credit Card Fraud Detection Model Based on Deep Reinforcement Training Subset Selection

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第8期5卷 4026-4041页

作者： Zhu, Kun Zhang, Nana Ding, Weiping Jiang, Changjun the Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai201804 China Collaborative Innovation Center for Financial Network Security Tongji University Shanghai201804 China the School of Computer Science and Technology Donghua University Shanghai201620 China the School of Information Science and Technology Nantong University Nantong226019 China

Heterogeneous fraud detection is an important means of credit card security assurance, which can utilize historical transaction records in a source and target domain to build an effective fraud detection model. Nevertheless, large feature distribution differences between source and target transaction instances and the complex intrinsic structure hidden behind transaction data make it difficult for existing credit card fraud detection (CCFD) models to capture and transfer the most informative feature representations and seriously hinder detection performance. In this work, we propose a novel adaptive heterogeneous CCFD model named adaptive heterogeneous credit card fraud detection model based on deep reinforcement training subset selection (RTAHC) based on deep reinforcement training subset selection, which mainly contains two components: selection distribution generator (SDG) and transaction fraud detector (TFD, including feature extractor with an attention mechanism and classifier). The SDG can generate the selection probability distribution vector via the reinforcement reward mechanism, and then transaction instances in the source domain relevant to the target domain are selected. The feature extractor with an attention mechanism can learn the abstract deep semantic feature representations of selected source transaction instances and the target domain. The joint training of SDG and TFD can provide more real-time and accurate transaction feature representations to reduce the distribution discrepancy between the two domains. We verify the detection performance of RTAHC across a large real-world credit card transaction dataset and four public datasets. Experimental results demonstrate that the RTAHC model can exhibit competitive CCFD performance. Impact Statement—With the rise of artificial intelligence (AI)generated models, credit card fraud has become increasingly rampant, which also causes tens of billions of U.S. dollars in credit card losses worldwide every year

关键词： Hidden Markov models

来源：评论

学校读者我要写书评

暂无评论

Reader activation scheduling in multi-reader RFID systems: A study of general case

Reader activation scheduling in multi-reader RFID systems: A...

引用

25th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2011

作者： Tang, Shaojie Wang, Cheng Li, Xiang-Yang Jiang, Changjun Department of Computer Science Illinois Institute of Technology Chicago IL 60616 United States Department of Computer Science Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China

ISBN: (纸本)9780769543857

Radio frequency identification (RFID) is a technology where a reader device can "sense" the presence of a close by object by reading a tag device attached to the object. To guarantee the coverage quality, multiple RFID readers can be deployed in the given region. In this paper, we consider the problem of activation schedule for readers in a multi-reader environment. In particular, we try to design a schedule for readers to maximize the number of served tags per time-slot while avoiding various interferences. We first develop a centralized algorithm under the assumption that different readers may have different interference and interrogation radius. Next, we propose a novel algorithm which does not need any location information of the readers. Finally, we extend the previous algorithm in distributed manner in order to suit the case where no central entity exists. We conduct extensive simulations to study the performances of our proposed algorithm. And our evaluation results corroborate our theoretical analysis. © 2011 IEEE.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Single camera 3D lane detection and tracking based on EKF for urban intelligent vehicle

Single camera 3D lane detection and tracking based on EKF fo...

引用

IEEE International Conference on Vehicular Electronics and Safety, ICVES 2006

作者： Min, Tian Fuqiang, Liu Zhencheng, Hu IEEE Key Laboratory of Embedded System and Service Computing Ministry of Education China Electronic and Information Engineering Department Tongji University Shanghai 201804 China Department of Computer Science Kumamoto University Kumamoto 860-8555 Japan

ISBN: (纸本)1424407591

Road boundary detection and tracking is an important and integral function in advanced driver-assistance system. This paper proposes an algorithm, which can follow multi-kinds of lane, straight and curved, quickly and robustly. The algorithm uses several masks to extract blobs of road markings, combining with KNN function to remove the disturbance. Further more, road is modeled as a 3D surface, and some important parameters of current lane are provided on real-time by tracking based on Extended Kalman Filter (EKF). The results of experiments, which have been done in urban road, show that the algorithm is adapted to many road conditions. Even in a complex driving environment, it also has a good performance. © 2006 IEEE.

关键词： Extended Kalman filters

来源：评论

学校读者我要写书评

暂无评论

Top-n recommendation algorithms for cloud data

引用

Tien Tzu Hsueh Pao/Acta Electronica Sinica 2015年第1期43卷 54-61页

作者： Huang, Zhen-Hua Department of Computer and Technology Tongji University Shanghai200092 China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai200092 China

Top-n recommendation technology has recently received a lot of attention in information service community. In this paper, we study the problem of top-n recommendation under the cloud data. Firstly, we propose a multilayer distributed storage architecture(MDSA)which can fit the need of top-n recommendation. Secondly, based on the consideration of reducing the cost of network transmission, we present the data encoding pattern which is based on the MDSA architecture. Lastly, we fast realize top-n recommendation using the map/reduce distributed programming model. For satisfying the realistic requirement, we further present three application variants of top-n recommendation. Massive experiments demonstrate that our approach is efficient and has high overall performance. ©, 2015, Chinese Institute of Electronics. All right reserved.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

A robust facial descriptor for face recognition

A robust facial descriptor for face recognition

引用

International Conference on Applications and Techniques in Cyber Security and Intelligence, ATCSI 2017

作者： Liu, Na Duan, Huixian Song, Lei Yan, Zhiguo Cyber Physical System R&D Center The Third Research Institute of Ministry of Public Security Shanghai China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Shanghai International Technology and Trade United Co. Ltd Shanghai China

ISBN: (纸本)9783319670706

Illumination, occlusion, pose and expression variations are the most common challenging problems for face recognition in many real-world applications. However, existing face recognition methods are proposed to handle part of these variations. In this paper, we propose a robust facial descriptor to address this issue. First, we apply a chain of three processing to tackle the illumination variation. Second, we compute the facial sparse local descriptor to handle the occlusion, pose, and expression variations. Experimental evaluation on the FRGC database shows that our approach is able to achieve very promising recognition rates under uncontrolled environments. © 2018, Springer International Publishing AG.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Road Incident Information Delivery Strategy to Reduce Urban Traffic Congestion

引用

IEEE/CAA Journal of Automatica Sinica 2018年第5期5卷 934-945页

作者： Liang Qi Mengchu Zhou Wenjing Luan IEEE Department of Computer Scicnce and Technology Shandong University of Science and TechnologyQingdao 266590China Department of Computer Science Tongji UniversityShanghai 201804China Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewark NJ 07102USA Key Laboratory of Embedded System and Service Computing Ministry of EducationShanghai Electronic Transactions and Information Service Collaborative Innovation CenterDepartment of Com-puter ScienceTongji UniversityShanghai 201804China

Advanced information and communication technolo-gies can be used to facilitate traffic incident *** an incident is detected and blocks a road link,in order to reduce the incident-induced traffic congestion,a dynamic strategy to deliver incident information to selected drivers and help them make detours in urban areas is proposed by this ***-dependent shortest path algorithms are used to generate a subnetwork where vehicles should receive such information.A simulation approach based on an extended cell transmission model is used to describe traffic flow in urban networks where path information and traffic flow at downstream road links are well *** results reveal the influences of some major parameters of an incident-induced congestion dissipation process such as the ratio of route-changing vehicles to the total vehicles,operation time interval of the proposed strategy,traffic density in the traffic network,and the scope of the area where traffic incident information is *** results can be used to improve the state of the art in preventing urban road traffic congestion caused by incidents.

关键词： Cell transmission model(CTM) intelligent transportation systems(ITS) traffic incident management(TIM) urban traffic congestion

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：