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

Time-aware bike flow prediction framework with dynamic edge fusion and memory integration

Knowledge-Based Systems 2025年 322卷

作者： M.Rajeh, Taha Li, Tianrui Luo, Zhpeng Javed, Muhammad Hafeez Alhaek, Fares School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education Chengdu611756 China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu611756 China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Southwest Jiaotong University Chengdu611756 China Stirling College Chengdu University Chengdu610106 China Computing Science Faculty of Natural Sciences University of Stirling StirlingFK9 4LA United Kingdom

Bike-Sharing Systems (BSSs) have become a popular solution to urban sustainability concerns, providing affordable and environmentally friendly transportation. However, modeling and predicting shared-bike flow patterns are essential for developing intelligent transportation systems and facilitating city management. Despite the existence of several inflow and outflow prediction models, certain unresolved issues remain, including the inability to differentiate and capture heterogeneous dynamic relationships within daily flows, and the suboptimal utilization of historical flow data for forecasting. To address these limitations, we propose MVRC (Multi-View Relational Framework based on Clustering), a novel deep-learning framework for precise inflow and outflow prediction. The MVRC framework models three types of heterogeneous dynamic flow relationships during different periods of the day. Initially, we introduce a novel clustering method to group nearby stations exhibiting similar patterns, followed by creating a dynamic memory module to store and update edge attributes based on the time of day. Furthermore, the dynamic edge fusion mechanism effectively integrates heterogeneous, time-evolving flow features, capturing their varying impacts. To further enhance the model's capabilities, an offline component that leverages historical data is incorporated, improving performance during testing. Extensive experiments conducted on real datasets from New York City and Washington, D.C., demonstrate the superior prediction efficiency and framework effectiveness of the MVRC framework compared to existing state-of-the-art techniques. These results highlight the practicality and efficacy of MVRC in terms of prediction accuracy and stability. © 2025

关键词： Urban transportation

来源：评论

学校读者我要写书评

暂无评论

Object tracking by the least spatiotemporal searches

arXiv

引用

arxiv 2020年

作者： Yu, Zhiyong Han, Lei Chen, Chao Guo, Wenzhong Yu, Zhiwen College of Mathematics and Computer Sciences Fuzhou University Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350108 China School of Computer Science Northwestern Polytechnical University Xi'an710072 China School of Computer Science Chongqing University Chongqing400044 China

Tracking a suspicious car or a person in a city efficiently is crucial in urban safety management. But how can we complete the task with the minimal number of spatiotemporal searches when massive camera records are involved? To this end, this study proposes a strategy named intermediate searching at heuristic moments (IHMs). At each step, we determine which moment is the best one for the search based on a heuristic indicator. Then, at that moment, locations are searched one by one in descending order of predicted appearing probabilities until a search hit is obtained. We iterate this step until we derive the object's current location. Five searching strategies are compared via experiments. Among these strategies, the IHMs strategy is validated as the most efficient. IHMs can save up to 1/3 of the total cost. This result provides evidence that "searching at intermediate moments can save cost. Copyright © 2020, The Authors. All rights reserved.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Hyperspectral Image Classification with Spatial Consistence Using Fully Convolutional Spatial Propagation Network

arXiv

引用

arxiv 2020年

作者： Jiang, Yenan Li, Ying Zou, Shanrong Zhang, Haokui Bai, Yunpeng School of Computer Science National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology Shaanxi Provincial Key Laboratory of Speech and Image Information Processing Northwestern Polytechnical University Xi’an710129 China School of Computer Science University of Adelaide AdelaideSA5005 Australia National Key Laboratory of Science and Technology on Space Microwave Xi’an710000 China School of Computing and Information Systems University of Melbourne MelbourneVIC3010 Australia

In recent years, deep convolutional neural networks (CNNs) have demonstrated impressive ability to represent hyperspectral images (HSIs) and achieved encouraging results in HSI classification. However, the existing CNN-based models operate at the patch-level, in which pixel is separately classified into classes using a patch of images around it. This patch-level classification will lead to a large number of repeated calculations, and it is hard to identify the appropriate patch size that is beneficial to classification accuracy. In addition, the conventional CNN models operate convolutions with local receptive fields, which cause the failure of contextual spatial information modeling. To overcome these aforementioned limitations, we propose a novel end-to-end, pixel-to-pixel fully convolutional spatial propagation network (FCSPN) for HSI classification. Our FCSPN consists of a 3D fully convolution network (3D-FCN) and a convolutional spatial propagation network (CSPN). Specifically, the 3D-FCN is firstly introduced for reliable preliminary classification, in which a novel dual separable residual (DSR) unit is proposed to effectively capture spectral and spatial information simultaneously with fewer parameters. Moreover, the channel-wise attention mechanism is adapted in the 3D-FCN to grasp the most informative channels from redundant channel information. Finally, the CSPN is introduced to capture the spatial correlations of HSI via learning a local linear spatial propagation, which allows maintaining the HSI spatial consistency and further refining the classification results. Experimental results on three HSI benchmark datasets demonstrate that the proposed FCSPN achieves state-of-the-art performance on HSI classification. Copyright © 2020, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

A Diverse Biases Non-negative Latent Factorization of Tensors Model for Dynamic Network Link Prediction

A Diverse Biases Non-negative Latent Factorization of Tensor...

引用

IEEE International Conference on Networking, Sensing and Control

作者： Xuke Wu Hang Gou Hao Wu Juan Wang Minzhi Chen Siyu Lai Computer School China West Normal University Nanchong China Computer School of China West Normal University Nanchong Sichuan China University of Chinese Academy of Sciences Beijing China Chongqing Engineering Research Center of Big Data Application for Smart Cities and Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing China North Sichuan Medical College Nanchong China Medical College Nanchong Sichuan China

ISBN: (数字)9781728168555

ISBN: (纸本)9781728168562

Dynamic networks vary over time, making it vital to capture networks temporal patterns for predicting missing links with high accuracy. A biased non-negative latent factorization of tensors (BNLFT) model is very effective in extracting such patterns from dynamic data. However, a BNLFT model only integrates single bias, which cannot adequately represents the volatility of the dynamic data. To address this issue, this paper presents a Diverse Biases Non-negative Latent Factorization of Tensors (DBNT) model for accurate prediction of missing links in dynamic networks. Meanwhile, for further prediction accuracy improvement, the preprocessing bias is integrated into the DBNT model. Empirical studies on two dynamic networks datasets from real applications show that compared with state of the art predictors, a DBNT model achieves higher prediction accuracy.

关键词： Tensors Conferences Predictive models data models Sensors data mining

来源：评论

学校读者我要写书评

暂无评论

Effects of annotation granularity in deep learning models for histopathological images

arXiv

引用

arxiv 2020年

作者： Shi, Jiangbo Gao, Zeyu Zhang, Haichuan Puttapirat, Pargorn Wang, Chunbao Zhang, xiangrong Li, Chen National Engineering Lab for Big Data Analytics Xi'an Jiao tong University Xi'an Shaanxi710049 China School of Electronic and Information Engineering Xi'an Jiao tong University Xi'an Shaanxi710049 China Shaan xi Province Key Laboratory of Satellite and Terrestrial Network Tech.R&D Xi'an Jiao tong University Xi'an Shaanxi710049 China Department of Pathology First Affiliated Hospital of Xi'an Jiaotong University Xi'an Shaanxi710061 China Institute of Intelligent Information Processing Xidian University Xi'an Shaanxi710071 China

Pathological examination is an important step in cancer diagnosis. Pathologists make diagnosis and pathology report based on observed cell and tissue structure on pathological slides. With the development of statistical machine learning, especially deep learning, automated classifiers are being used to analyze histopathological slides and assist pathologists in diagnosis. Currently, commonly used annotation methods in histopathological slides include image-wise, bounding box, ellipse-wise, pixel-wise. In order to verify the influence of annotation in pathological slide on deep learning model, we design corresponding experiments to test the performance based on annotations with different granularity annotation. In classification, all state-of-the-art deep learning based classifiers perform better when they are trained by the dataset with pixel-wise annotation. On average, precision, recall and F1-score improves by 7.87%, 8.83% and 7.85% respectively. Thus, it is suggested that finer annotations are better utilized by deep learning algorithms in classification tasks. Similarly, semantic segmentation algorithms can achieve 8.33% better segmentation accuracy when trained by pixel-wise annotations. Our study shows that finer-grained annotation can not only improve the performance of deep learning models, but help deep learning model extract more accurate phenotypic information from histopathological slides. An accurate acquisitions of phenotypic information can help pathologists to enquire the model based on which regions and features in the slide were mainly used to calculate the prediction, improve the reliability of the model prediction. The compartmentalized prediction approach similar to this work may contribute to phenotype and genotype association studies. Copyright © 2020, The Authors. All rights reserved.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Sledge: Towards Efficient Live Migration of Docker Containers

Sledge: Towards Efficient Live Migration of Docker Container...

引用

IEEE International Conference on Cloud computing, CLOUD

作者： Bo Xu Song Wu Jiang xiao Hai Jin Yingxi Zhang Guoqiang Shi Tingyu Lin Jia Rao Li Yi Jizhong Jiang National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China State Key Laboratory of Intelligent Manufacturing System Technology Beijing China The University of Texas at Arlington Arlington TX USA Alibaba Cloud Computing Co. Ltd. Hangzhou China

ISBN: (数字)9781728187808

ISBN: (纸本)9781728187815

Modern large-scale cloud platforms require live migration technique on Docker containers with stateful workload to support load balancing, host maintenance, and Quality of Service (QoS) improvement. Efficient and scalable Docker live migration is expected to guarantee the component-integrity (image, runtime, and management context) with negligible downtime. In this paper, we present a highly efficient live migration system called Sledge, which ensures the component-integrity by integrating both images and management context during runtime migration. The key insight is that the layered image can be leveraged to reduce the migration overhead, and appropriately selective migration of management context will effectively improve QoS with negligible downtime. To achieve good scalability, a lightweight container registry mechanism for end-to-end image migration is designed to avoid the redundant layers transmission. In addition, a dynamic context loading scheme is proposed to precisely load the management context into the running daemon, which can significantly reduce downtime. Experiments show that, compared with the state-of-the-art, Sledge reduces 57% of total migration time, 55% of image migration time, and 70% downtime.

关键词： Cloud computing Runtime Scalability Loading Quality of service Containers Maintenance engineering

来源：评论

学校读者我要写书评

暂无评论

FedLGMatch: Federated semi-supervised learning via joint local and global pseudo labeling

引用

Knowledge-Based Systems 2025年 320卷

作者： Zhao, Qing Chu, Jielei Li, Zhaoyu Huang, Wei Luo, Zhipeng Li, Tianrui School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education Chengdu611756 China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu611756 China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Southwest Jiaotong University Chengdu611756 China China Railway Engineering Group Limited Beijing100039 China China Railway Eryuan Engineering Group Co. Ltd. Sichuan Chengdu610031 China College of Computer and Data Science Fuzhou University China

The bulk of existing Federated Learning (FL) algorithms pay attention to supervised setting and assume that clients have fully labeled data. However, it may be impractical for all clients to obtain plenty of labels due to high annotation costs. Hence, the Federated Semi-Supervised Learning (FSSL) as a promising paradigm has better prospect in many realistic applications (e.g. medical scenario). Under Labels-at-Server scenario, most pseudo labeling based FSSL approaches use only the global model to generate pseudo-labels for unlabeled data, while the local models are ignored. When the local data distribution is much more different from the central server (e.g., Non-IID setting), the generated pseudo-labels may contain much noise, thus, resulting in more serious confirmation bias. To tackle the crucial issue, a novel Federated Semi-Supervised Learning via Joint Local and Global Pseudo Labeling (FedLGMatch) framework is proposed in this paper. The prominent advantage of the proposed FedLGMatch is that it allows local models trained in the last communication round to assist global model in generating pseudo-labels, which successfully emphasizes more clean pseudo-label learning at each client. Experimental results also show that FedLGMatch achieves significant performance improvements than other state-of-the-art models on the standard benchmark datasets. © 2025 Elsevier B.V.

关键词： Semi-supervised learning

来源：评论

学校读者我要写书评

暂无评论

A Deep Temporal Collaborative Filtering Recommendation Framework via Joint Learning from Long and Short-Term Effects

A Deep Temporal Collaborative Filtering Recommendation Frame...

引用

IEEE International Conference on big data and Cloud computing (BdCloud)

作者： Qianqian Ji xiaoyu Shi Mingsheng Shang Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing China University of Chinese Academy of Sciences Beijing China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

Recommendations based on deep learning technologies are attracting increasingly attentions from academia and industry recently, due to it has the powerful ability of data representation learning, and can capture the complex and non-linear user-item interaction patterns. Previous studies on deep learning based recommenders heavily emphasize on learning the short-term or long-term temporal effects in separate ways. Furthermore, most of the existing recommenders studied on temporal dynamics hidden in user-item interactions by using ratings or review texts solely, without utilizing these heterogeneous side information in a comprehensive manner. As a result, they own a limited ability to exploit all of available user-item interaction data. To address the above issues, we propose a temporal collaborative filtering recommendation framework with utilizing deep learning technologies, which can capture the drift of users' preferences and items' attributes over time from available heterogeneous feedback. For studying the rich sentiment information about particular item features hidden in reviews and capturing the short-term temporal dynamics in user preference, a parallel recurrent neural network (RNN) coupled in the last layer is presented. With consideration of the life cycle of each item, we further propose an item-based time evolution model as a supplement to enrich the long-term temporal effects when recommendation. In addition, a modified cosine similarity function is incorporated to produce the personalized candidate list for each user. Finally, extensive experimental are conducted on Amazon's three datasets. They indicate that the proposed method outperforms the other state-of-the-art recommenders in terms of precision and recall when doing the Top-n recommendation task.

关键词： Hidden Markov models Recommender systems Analytical models Deep learning Predictive models Collaboration Bidirectional control

来源：评论

学校读者我要写书评

暂无评论

ProFPred: a two-step protein function prediction model based on sequence and evolutionary information

ProFPred: a two-step protein function prediction model based...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Ruiquan Ge Guanwen Feng Pu Wang Qiguang Miao School of Computer Science and Technology Hangzhou Dianzi University Zhejiang University Hangzhou Yiyitaidi Information Technology Co. Ltd. Hangzhou China Xi’an Key Laboratory of Big Data and Intelligent Vision School of Computer Science and Technology Xidian University Xi’an China Computer School Hubei University of Arts and Science Xiangyang China School of Computer Science and Technology Xidian University Xi’an China

ISBN: (数字)9781728162157

ISBN: (纸本)9781728162164

In post-genomic era, the understanding of protein function has been seriously behind the development of sequencing technology. Experimental verification for protein function is difficult, time consuming and expensive. Meanwhile, the new proteins vary in function. It is difficult for traditional methods to fully and accurately understand its functions. In this work, we present a novel method ProFPred to predict protein function based on sequence and evolutionary information to deal with small samples data corresponding to new diseases or discoveries. Experimental results demonstrate that our method can achieve better or comparable performances compared with current state-of-the-art methods.

关键词： Proteins Amino acids Peptides Feature extraction Correlation Tools Protein engineering

来源：评论

学校读者我要写书评

暂无评论

Ball k-means

arXiv

引用

arxiv 2020年

作者： xia, Shuyin Peng, Daowan Meng, Deyu Zhang, Changqing Wang, Guoyin Chen, Zizhong Wei, Wei Department of Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and Telecommunications Chongqing400065 China National Engineering Laboratory for Algorithm and Analysis Technologiy on Big Data Xian Jiaotong University Xi'an710049 China College of Intelligence and Computing Tianjin University 300072 China Department of Computer Science and Engineering University of California Riverside 900 University Avenue RiversideCA92521 United States School of Computer Science and Engineering Xi'an University of Technology Xi'an710048 China

This paper presents a novel accelerated exact k-means algorithm called the Ball k-means algorithm, which uses a ball to describe a cluster, focusing on reducing the point-centroid distance computation. The Ball k-means can accurately find the neighbor clusters for each cluster resulting distance computations only between a point and its neighbor clusters centroids instead of all centroids. Moreover, each cluster can be divided into a stable area and an active area, and the later one can be further divided into annulus areas. The assigned cluster of the points in the stable area is not changed in the current iteration while the points in the annulus area will be adjusted within a few neighbor clusters in the current iteration. Also, there are no upper or lower bounds in the proposed Ball k-means. Furthermore, reducing centroid-centroid distance computation between iterations makes it efficient for large k clustering. The fast speed, no extra parameters and simple design of the Ball k-means make it an all-around replacement of the naive k-means algorithm. Copyright © 2020, The Authors. All rights reserved.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：