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

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： He, Haibin Ye, Maoyuan Zhang, Jing Liu, Juhua Du, Bo Tao, Dacheng School of Computer Science National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Wuhan University China College of Computing & Data Science Nanyang Technological University Singapore

Beyond the text detection and recognition tasks in image text spotting, video text spotting presents an augmented challenge with the inclusion of tracking. While advanced end-to-end trainable methods have shown commendable performance, the pursuit of multi-task optimization may pose the risk of producing sub-optimal outcomes for individual tasks. In this paper, we identify a main bottleneck in the state-of-the-art video text spotter: the limited recognition capability. In response to this issue, we propose to efficiently turn an off-the-shelf query-based image text spotter into a specialist on video and present a simple baseline termed GoMatching, which focuses the training efforts on tracking while maintaining strong recognition performance. To adapt the image text spotter to video datasets, we add a rescoring head to rescore each detected instance's confidence via efficient tuning, leading to a better tracking candidate pool. Additionally, we design a long-short term matching module, termed LST-Matcher, to enhance the spotter's tracking capability by integrating both long- and short-term matching results via Transformer. Based on the above simple designs, GoMatching delivers new records on ICDAR15-video, DSText, BOVText, and our proposed novel test set with arbitrary-shaped text termed ArTVideo, which demonstrates GoMatching's capability to accommodate general, dense, small, arbitrary-shaped, Chinese and English text scenarios while saving considerable training budgets. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Predicting Protein-Protein Interactions Using Self-Attention-Based Deep Neural Networks and FastText Embeddings 15

Predicting Protein-Protein Interactions Using Self-Attention...

引用

15th International Conference on computing Communication and Networking Technologies, ICCCNT 2024

作者： Oviya, I.R. Shanmukha Sravya, N. Raja, Kalpana Amrita Vishwa Vidyapeetham Amrita School Of Computing Department of Computer Science Engineering Chennai601103 India Yale University Section for Biomedical Informatics and Data Science School of Medicine New HavenCT United States

ISBN: (纸本)9798350370249

Predicting Protein-protein interactions are central to understanding the intricate mechanisms governing cellular functions, as proteins seldom act in isolation. While current machine learning and deep learning models focus on encoding protein sequences based on residue composition or physicochemical properties, they often overlook the complex relationships between amino acid segments within lengthy sequences. To address these limitations, we propose a novel hybrid model that combines a self-attention to enhance Deep neural network feature extraction with an with FastText Protein embeddings for predicting PPI. Utilizing transfer learning via the unsupervised FastText embedding technique to derive statistical representations of protein sequences, offers advantages over traditional protein encoding techniques in the context of analysing k-Mer sequences. Our model's performance is assessed through 5-fold cross-validation on datasets of *** and Human-Bacillus Anthracis protein interactions, resulting in accuracies of 92.28% and 94.08%, respectively. Compared to existing machine learning models, our model demonstrates superior performance on both datasets. © 2024 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

MedCare4Home: A Mobile Medical System for Families

MedCare4Home: A Mobile Medical System for Families

引用

2023 IEEE International Conference on E-Health Networking, Application and Services, Healthcom 2023

作者： Wang, Mengting Le, Yen Yu, Chen-Hsiang School of Computing and Data Science Wentworth Institute of Technology BostonMA United States Multidisciplinary Graduate Engineering College of Engineering Northeastern University BostonMA United States

ISBN: (纸本)9798350302301

Managing healthcare data is essential for everyone, but it can be challenging and time-consuming. Although several Web and mobile applications existed for personal medical record management, there were few home-based, family-oriented solutions. In this research, we proposed to design an easy-to-use solution for a family. We designed and implemented an innovative Home Medical Care System, MedCare4Home, by deploying a MERN stack Web application to a minicomputer, Raspberry Pi 4, and enabling a local network to connect different devices at home. The users can access the Web application using either a desktop, tablet, mobile phone, or simply a 7-inch LCD touchscreen. MedCare4Home not only allows users to keep track of appointments and organize healthcare documents, but it can also help set up medication reminders and provide a self-report interface for symptom collection for family members easily and securely in one place. The final developed system demonstrated that we achieved the original goal and beyond. We expect to extend our current hardware design and software development to support physiological data collection with external sensors in the future. © 2023 IEEE.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Finding Top-k Important Edges on Bipartite Graphs: Ego-betweenness Centrality-based Approaches 39

Finding Top-k Important Edges on Bipartite Graphs: Ego-betwe...

引用

39th IEEE International Conference on data engineering, ICDE 2023

作者： Weng, Tongfeng Zhou, Xu Fang, Yixiang Tan, Kian-Lee Li, Kenli Hunan University College of Computer Science and Electronic Engineering China The Chinese University of HongKong School of Data Science Shenzhen China National University of Singapore School of Computing Singapore

ISBN: (纸本)9798350322279

Bipartite graph is an important data structure that widely exists in disease prevention and control, community detection, and other real-life applications. In a bipartite graph, edges not only connect entries of different types but also are bridges of different communities in the above applications. However, research to date has not yet focused on edge importance in bipartite graphs. Inspired by this, we study a new problem of top-k edge search in bipartite graphs with the goal of finding k most important edges for a given bipartite graph;these edges are crucial bridges among communities. In particular, we introduce the measure of ego-betweenness for evaluating the importance of edges. To handle this problem effectively, a lazy bound-based algorithm is first proposed by integrating an upper bound pruning strategy. After that, to further get better efficiency, a greedy bound-based heuristic algorithm is explored on the basis of a tighter upper bound which contributes to reducing redundant computation for calculating ego-betweenness. Last but not least, two parallel techniques with different levels of granularity, called P -src and P -task, are respectively introduced to further improve the search efficiency. The experimental results on both real-world and synthetic graphs demonstrate the efficiency and scalability of the proposed algorithms. © 2023 IEEE.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

TERM: Tree Ensemble Models for Interpretable Rule Mining 25th

TERM: Tree Ensemble Models for Interpretable Rule Mining

引用

25th International Conference on Web Information Systems engineering, WISE 2024

作者： Zhu, Mengyu Li, Zhao Zhao, Jun Liu, Xiaopeng Liu, Yongning School of Information Engineering Ningxia University Yinchuan China College of Intelligence and Computing Tianjin University Tianjin China School of Economics and Management Ningxia University Yinchuan China Financial Big Data Laboratory Bank of Shizuishan Yinchuan China

ISBN: (纸本)9789819605781

Ensemble learning, particularly tree-based ensemble techniques, is acknowledged as the advanced approach to solving a wide range of challenging issues because of its exceptional performance in multiple machine learning applications. Nonetheless, even with its capacity for prediction, ensemble learning’s interpretability continues to be a problem, which restricts its use in situations where decision transparency is necessary. We suggest a novel model named TERM (Tree Ensemble Models for Interpretable Rule Mining) in order to get over this restriction and enhance the interpretability of Ensemble Tree Models. This method converts the complex binary classification decision-making process inside tree ensemble models into a series of rule lists that are globally equivalent to the decision-making process of the original model. This transformation aids in a more precise understanding and interpretation of the model’s predictive outcomes, enhancing its interpretability. Compared with existing rule extraction methods, TERM can simultaneously be applied to bagging methods and boosting methods. During the rule extraction phase, an adaptive set cover algorithm ADAPT-TA, is proposed to select rule subsets from the original rule set while avoiding local optima. Additionally, this method reduces the generalization error in the set of rules and runs faster on ensemble models involving multiple decision trees. Through comparisons with six other models, we evaluated the performance and applicability of TERM, demonstrating its outstanding accuracy and interpretability. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

MP-GAN: Cyber-Attack Detection and Localization for Cyber-Physical Systems with Multi-Process Generative Adversarial Networks*

MP-GAN: Cyber-Attack Detection and Localization for Cyber-Ph...

引用

2023 International Conference on Artificial Intelligence of Things and Systems, AIoTSys 2023

作者： Zhou, Yikui Wang, Jie Tang, Junnan Gou, Chao Jiang, Zigui Li, Dan Ng, See-Kiong Sun-Yat Sen University School of Software Engineering Zhuhai China Sun-Yat Sen University School of Intelligent Systems Engineering Shenzhen China National University of Singapore Institute of Data Science School of Computing Singapore

ISBN: (纸本)9798350312270

Cyber-Physical System (CPS) integrates sensing, computation, cybernetics, and networking to control a hybrid physical system consisting of different functional subsystems, making the production process more intelligent and controllable. However, cyber-attacks during its operation will lead to abnormal system behaviors or even system breakdowns. In recent years, data-driven anomaly detection methods have been adopted to judge whether the CPS system is under cyber-attacks based on rich sensor measurements to avoid further economic losses or safety issues. However, the multi-process essence of CPS has not been adequately addressed in existing works to locate the processes or points being attacked for in-time actions. In this work, we proposed a Multi-Process Generative Adversarial Network (MP-GAN) framework to detect anomalous CPS statuses and locate cyber-attacks. Specifically, the Long-Short-Term-Memory Recurrent Neural Networks (LSTM-RNN) was adopted as the base model to capture the temporal correlation of time series distributions, and the data was transferred between latent space and data space in a bi-directional manner, which regulated the generator to generate more realistic samples and thus better grasping the underline principles of the system. Moreover, parallel generators were employed to capture system performances at different physical processes, thus localizing the attacked CPS processes. Experiments on three CPS datasets, two collected from the Secure Water Treatment (SWaT) system and one collected from the water Distribution (WADI) system, showed that the proposed MP-GAN framework effectively reported anomalies caused by various cyber-attacks inserted in these complex multiprocess CPSs, which outperforms the state-of-the-art methods and can also locate most of the detected irregularities at the corresponding stages where the attacks were inserted. © 2023 IEEE.

关键词： Cyber Physical System

来源：评论

学校读者我要写书评

暂无评论

Plausible Heterogeneous Graph k-Anonymization for Social Networks

引用

Tsinghua Science and Technology 2022年第6期27卷 912-924页

作者： Kaiyang Li Ling Tian Xu Zheng Bei Hui School of Computer Science and Engineering University of Electronic Science and Technology of ChinaChengdu 611731China School of Information and Software Engineering University of Electronic Science and Technology of ChinaChengdu 610054China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Chengdu 610000China

The inefficient utilization of ubiquitous graph data with combinatorial structures necessitates graph embedding methods,aiming at learning a continuous vector space for the graph which is amenable to be adopted in traditional machine learning algorithms in favor of vector *** embedding methods build an important bridge between social network analysis and data analytics as social networks naturally generate an unprecedented volume of graph data *** social network data not only bring benefit for public health,disaster response,commercial promotion,and many other applications,but also give birth to threats that jeopardize each individual’s privacy and ***,most existing works in publishing social graph embedding data only focus on preserving social graph structure with less attention paid to the privacy issues inherited from social *** be specific,attackers can infer the presence of a sensitive relationship between two individuals by training a predictive model with the exposed social network *** this paper,we propose a novel link-privacy preserved graph embedding framework using adversarial learning,which can reduce adversary’s prediction accuracy on sensitive links while persevering sufficient non-sensitive information such as graph topology and node attributes in graph *** experiments are conducted to evaluate the proposed framework using ground truth social network datasets.

关键词： social network graph embedding privacy preservation adversarial learning

来源：评论

学校读者我要写书评

暂无评论

Towards High-throughput and Low-latency Billion-scale Vector Search via CPU/GPU Collaborative Filtering and Re-ranking 23

Towards High-throughput and Low-latency Billion-scale Vector...

引用

23rd USENIX Conference on File and Storage Technologies, FAST 2025

作者： Tian, Bing Liu, Haikun Tang, Yuhang Xiao, Shihai Duan, Zhuohui Liao, Xiaofei Jin, Hai Zhang, Xuecang Zhu, Junhua Zhang, Yu National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China Huawei Technologies Co. Ltd. China

ISBN: (纸本)9781939133458

Approximate nearest neighbor search (ANNS) has emerged as a crucial component of database and AI infrastructure. Ever-increasing vector datasets pose significant challenges in terms of performance, cost, and accuracy for ANNS services. None of modern ANNS systems can address these issues simultaneously. In this paper, we present FusionANNS, a high-throughput, low-latency, cost-efficient, and high-accuracy ANNS system for billion-scale datasets using SSDs and only one entry-level GPU. The key idea of FusionANNS lies in CPU/GPU collaborative filtering and re-ranking mechanisms, which significantly reduce I/O operations across CPUs, GPU, and SSDs to break through the I/O performance bottleneck. Specifically, we propose three novel designs: (1) multi-tiered indexing to avoid data swapping between CPUs and GPU, (2) heuristic re-ranking to eliminate unnecessary I/Os and computations while guaranteeing high accuracy, and (3) redundant-aware I/O deduplication to further improve I/O efficiency. We implement FusionANNS and compare it with the state-of-the-art SSD-based ANNS system-SPANN and GPU-accelerated in-memory ANNS system-RUMMY. Experimental results show that FusionANNS achieves 1) 9.4-13.1× higher query per second (QPS) and 5.7-8.8× higher cost efficiency compared with SPANN;2) and 2-4.9× higher QPS and 2.3-6.8× higher cost efficiency compared with RUMMY, while guaranteeing low latency and high accuracy. © 2025 FAST. All Rights Reserved.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Fededrated Learning: Research, Challenges, and Future Directions 5

Fededrated Learning: Research, Challenges, and Future Direct...

引用

5th IEEE International Conference on computing, Power, and Communication Technologies, IC2PCT 2024

作者： Kaswan, Kuldeep Singh Dhatterwal, Jagjit Singh Yadav, Rishika Malik, Kiran Tripathi, Aanjey Mani Galgotias University School of Computing Science and Engineering UP Greater Noida India Artificial Intelligence and Data Science Koneru Lakshmaiah Education Foundation AP Guntur India Graphic Era Hills University Department of Computer Science and Engineering Uttarakhand Dehradun India Mriem Department of Computer Science and Engineering Rohtak India Galgotias University School of Computing Science and Engineering Greater Noida India

ISBN: (纸本)9798350383522

Federated Learning, a disruptive and novel aspect of machine learning, is at the forefront of decentralized, privacy-conscious data processing. This in-depth review study navigates the complex environment of Federated Learning Ecosystems, attempting to extract the core of the topic while shining light on its research horizons, pressing difficulties, and promising approaches. Our trip begins with a look at the fundamental concepts of Federated Learning, emphasizing its importance in the landscape of distributed machine learning paradigms. We track its development via historical milestones and key contributions, offering context for the field's increasing research. This study focuses on the many features of Federated Learning research, including privacy-preserving techniques, communication protocols, aggregation approaches, and real-world applications. We aggregate major results and advances within these domains, highlighting notable authors and their contributions. However, the route to Federated Learning's full fulfillment is plagued with difficulties, including questions about privacy, communication efficiency, and scalability. In the future, we will enlighten the growing paths of Federated Learning research, forecasting trends, providing insights into overcoming present problems, and visualizing its integration into diverse fields. To summarize, this review article serves as a guidepost for scholars, practitioners, and enthusiasts wanting to understand the vast domain of Federated Learning. It captures the core of this dynamic discipline, offers strategic counsel for resolving its obstacles, and encourages optimism about its bright future within the domain of distributed machine learning paradigms. © 2024 IEEE.

关键词： data Analysis Distributed Environments Edge computing Federated Learning Machine Learning

来源：评论

学校读者我要写书评

暂无评论

Optimized Reading for ADHD and Dyslexia Users In VR

Optimized Reading for ADHD and Dyslexia Users In VR

引用

2023 Congress in Computer Science, Computer engineering, and Applied computing, CSCE 2023

作者： Hoang, Kyler Deligiannidis, Leonidas School of Engineering Wentworth Institute of Technology BostonMA02115 United States School of Computing and Data Science Wentworth Institute of Technology BostonMA02115 United States

ISBN: (纸本)9798350327595

To combat the rising population of ADHD and dyslexic patients, current advancements in Unity and Oculus Integration are investigated and employed to design a user-friendly reading experience. Unlike physical novels that lack visual aid, our prototype ensures a distraction-free and minimalistic VR environment. It utilizes *** speech recognition to aid ADHD and dyslexic patients in mechanical and comprehensive reading. Users can also change the background color and music to enhance their facilitated experience. This approach allows the user to constantly focus on the text without averting their gaze. We believe that further development of this prototype can create a powerful tool that redefines reading E-books. © 2023 IEEE.

关键词： ADHD Dyslexia Virtual Reality

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：