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

International Joint Conference on Neural Networks (IJCNN)

作者： Yan-Di Huang Guang-Yu Zhang Dong Huang Chang-Dong Wang Yang Liu Enbo Huang College of Mathematics and Informatics South China Agricultural University Guangzhou China School of Computer Science and Engineering Sun Yat-Sen University Guangdong Provincial Key Laboratory of Intellectual Property and Big Data Guangzhou China School of Computer Science and Engineering Sun Yat-Sen University Guangzhou China Guangxi Key Lab of Human-Machine Interaction and Intelligent Decision Nanning Normal University Nanning China

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

Contrastive clustering has recently been an emerging topic in deep unsupervised learning. Nevertheless, the previous works mostly adopt the stochastic data augmentations, which easily leads to the semantic drift problem by limited transformations. Moreover, these approaches ignore the data distribution information when generating the positive and negative pair-wise samples. In light of this, this paper proposes a simple yet effective unsupervised clustering network termed Confidence-oriented Contrastive Graph Clustering (CoCGC). Particularly, we design an end-to-end network paradigm with un-shared weights, among which a hybrid graph filter is utilized to generate two views of reliable augmentations. Guided by the non-dominated sorting theory, we further construct a confidence-oriented sample set from the latent data distribution perspective. By considering the local density and cluster distribution of the embedding representations, the discriminative sample pairs can be derived from the confidence-oriented sets in a two-view contrastive manner. Finally, a cross-view neighbor contrastive loss is devised for better exploiting the self-supervised network signals. Extensive experimental results on five benchmark datasets demonstrate the effectiveness of our method against the existing state-of-the-art deep graph clustering methods.

关键词： Network topology Semantics Neural networks Reliability theory Reliability engineering Information filters Filtering theory

来源：评论

学校读者我要写书评

暂无评论

I³: Interactive Iterative Improvement for Few-Shot Action Segmentation

I³: Interactive Iterative Improvement for Few-Shot Action S...

引用

IEEE International Workshop on Robot and human Communication (ROMAN)

作者： Martina Gassen Frederic Metzler Erik Prescher Lisa Scherf Vignesh Prasad Felix Kaiser Dorothea Koert Interactive AI & Cognitive Models for Human-AI Interaction (IKIDA) TU Darmstadt Germany Centre for Cognitive Science TU Darmstadt Germany Department of Computer Science Institute for Intelligent Autonomous Systems TU Darmstadt Germany Department of Law and Economics Chair for Marketing and Human Resource Management TU Darmstadt Germany

Extracting modular segments from raw video demonstrations of high-level actions is important to understand the underlying building blocks for different tasks in human-robot interaction. While (data-hungry) supervised learning approaches for Action Segmentation show good performance when the underlying segments are predefined, their performance degrades when unseen actions are introduced on-the-go as new data samples are scarce. In this regard, Zero-and Few-Shot Learning approaches have shown good performance in generalizing to unseen examples. In Action Segmentation, where each frame needs to be labeled, annotating new data even for a few tasks can become tedious as the number of tasks scale. In this work, we propose Interactive Iterative Improvement $(I^{3})$ for Few-Shot Action Segmentation, a Semi-Supervised Interactive Meta-Learning approach for Zero-Shot Learning on unlabeled videos and Few-Shot Learning on small amounts of labeled videos. $I^{3}$ consists of a Prototypical Network model for frame-wise prediction coupled with a Hidden-Semi-Markov-Model to prevent over-segmentation. The model is iteratively improved in an interactive manner through users’ annotations provided via a webinterface. This is done in a task-agnostic manner that, in theory, can be reused for a number of different actions. Our model provides sequentially accurate segmentations using only a limited amount of labeled data which shows the efficacy of our learning approach. A lower edit distance compared to baselines indicates a lower number of required user edits making it well suited for non-expert users to smoothly provide annotations enabling them to have more control over the learned model.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Value-of-Information-based management framework for fog services

A Value-of-Information-based management framework for fog se...

引用

作者： Poltronieri, Filippo Tortonesi, Mauro Morelli, Alessandro Stefanelli, Cesare Suri, Niranjan Engineering Department University of Ferrara Ferrara Italy Department of Mathematics and Computer Science University of Ferrara Ferrara Italy Florida Institute for Human and Machine Cognition PensacolaFL United States United States Army Research Laboratory AdelphiMD United States

The management of fog computing applications is a challenging task that requires dealing with a dynamic and resource-scarce environment. We argue that approaches leveraging Value-of-Information (VoI) concepts and tools are particularly interesting to support the realization of that objective. This paper describes innovative methodologies and reference models for the service fabric management of fog computing services. First, we formalize the VoI concept and discuss its adoption in fog computing environments. Then, we propose a model that aims at maximizing the allocation of fog services from a value-based perspective. To overcome the complexity of this model, we present two possible solutions (a simplified user-specific VoI model and a distance-based heuristic), and we compare them by adopting meta-heuristics as optimization techniques. Then, we investigate the adoption of a hybrid model, which combines the distance-based heuristic with the simplified user-specific VoI model. Experimental results prove the validity of all presented approaches and highlight the soundness of the distance-based heuristic, which is capable of reaching the 91% performance of the simplified user-specific VoI model in a very short amount of time. This makes it a suitable approach for online optimization of resources in fog computing. © 2021 John Wiley & Sons, Ltd.

关键词： Fog computing

来源：评论

学校读者我要写书评

暂无评论

Finding Our Joy: Queer Perspectives on HCI Research

Finding Our Joy: Queer Perspectives on HCI Research

引用

2025 CHI Conference on human Factors in Computing Systems, CHI EA 2025

作者： O’Reilly-Kime, Molly Feng, Yifan Cipelli, Francesca Osipova, Ekat Kender, Kay Steeds, Madeleine Clinch, Sarah Rubegni, Elisa Rode, Jennifer School of Computing & Communications Lancaster University Lancaster United Kingdom Knowledge Lab. University College London London United Kingdom Creative Computing Institute University of the Arts London London United Kingdom Catholic University of the Sacred Heart Milan Italy Crip Collective Human-Computer Interaction Group TU Wien Vienna Austria Smurfit Business School University College Dublin Dublin Ireland Department of Computer Science The University of Manchester Manchester United Kingdom School of Computing and Communication Lancaster University Lancaster United Kingdom

ISBN: (纸本)9798400713958

How do we make space for joy in Queer HCI? This work draws on our authors’ experiences as Queer researchers and allies, navigating a field that is ostensibly receptive to our work, yet provides a narrow framework for acceptable research. We relate personal accounts of contending with identity, practice, and publication;we discuss what joy means to us, and the gap we see in Queer HCI where joy should exist. We believe that Queer HCI and research can itself be subversive, and assert that it needs to be in order for our research community to flourish. Our work emerges from a need for Queer joy in our research practice, and we approach Queerness as a multifaceted experience that by nature resists the categorisation that we often see in HCI. Finally, we present reflective guidelines for future work, that will allow us achieve inclusive, intentional, and joyful research. © 2025 Copyright held by the owner/author(s).

关键词：

来源：评论

学校读者我要写书评

暂无评论

Dynamic Localisation of Spatial-Temporal Graph Neural Network

arXiv

引用

arXiv 2025年

作者： Duan, Wenying Guo, Shujun Zhou, Zimu Huang, Wei Rao, Hong He, Xiaoxi Jiangxi Provincial Key Laboratory of Intelligent Systems and Human-Machine Interaction Nanchang University Nanchang China School of Mathematics and Computer Sciences Nanchang University Nanchang China School of Data Science City University of Hong Kong Hong Kong School of Software Nanchang University Nanchang China Faculty of Science and Technology University of Macau China

Spatial-temporal data, fundamental to many intelligent applications, reveals dependencies indicating causal links between present measurements at specific locations and historical data at the same or other locations. Within this context, adaptive spatial-temporal graph neural networks (ASTGNNs) have emerged as valuable tools for modelling these dependencies, especially through a data-driven approach rather than pre-defined spatial graphs. While this approach offers higher accuracy, it presents increased computational demands. Addressing this challenge, this paper delves into the concept of localisation within ASTGNNs, introducing an innovative perspective that spatial dependencies should be dynamically evolving over time. We introduce DynAGS, a localised ASTGNN framework aimed at maximising efficiency and accuracy in distributed deployment. This framework integrates dynamic localisation, time-evolving spatial graphs, and personalised localisation, all orchestrated around the Dynamic Graph Generator, a light-weighted central module leveraging cross attention. The central module can integrate historical information in a node-independent manner to enhance the feature representation of nodes at the current moment. This improved feature representation is then used to generate a dynamic sparse graph without the need for costly data exchanges, and it supports personalised localisation. Performance assessments across two core ASTGNN architectures and nine real-world datasets from various applications reveal that DynAGS outshines current benchmarks, underscoring that the dynamic modelling of spatial dependencies can drastically improve model expressibility, flexibility, and system efficiency, especially in distributed settings. © 2025, CC BY-NC-ND.

关键词： Spatio-temporal data

来源：评论

学校读者我要写书评

暂无评论

Augmenting Scientific Creativity with Retrieval across Knowledge Domains

arXiv

引用

arXiv 2022年

作者： Kang, Hyeonsu B. Mysore, Sheshera Huang, Kevin Chang, Haw-Shiuan Prein, Thorben McCallum, Andrew Kittur, Aniket Olivetti, Elsa Human-Computer Interaction Institute CMU PA United States Manning College of Information and Computer Sciences UMASS AmherstMA United States Department of Materials Science and Engineering MIT MA United States

Exposure to ideas in domains outside a scientist’s own may benefit her in reformulating existing research problems in novel ways and discovering new application domains for existing solution ideas. While improved performance in scholarly search engines can help scientists efficiently identify relevant advances in domains they may already be familiar with, it may fall short of helping them explore diverse ideas outside such domains. In this paper we explore the design of systems aimed at augmenting the end-user ability in cross-domain exploration with flexible query specification. To this end, we develop an exploratory search system in which end-users can select a portion of text core to their interest from a paper abstract and retrieve papers that have a high similarity to the user-selected core aspect but differ in terms of domains. Furthermore, end-users can ‘zoom in’ to specific domain clusters to retrieve more papers from them and understand nuanced differences within the clusters. Our case studies with scientists uncover opportunities and design implications for systems aimed at facilitating cross-domain exploration and inspiration. © 2022, CC BY.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

Surface defect identification using Bayesian filtering on a 3D mesh

arXiv

引用

arXiv 2025年

作者： Vedove, Matteo Dalle Bonetto, Matteo Lamon, Edoardo Palopoli, Luigi Saveriano, Matteo Fontanelli, Daniele Department of Industrial Engineering Università di Trento Trento Italy DRIM Ph.D. of national interest in Robotics and Intelligent Machines Italy Department of Information Engineering and Computer Science Università di Trento Trento Italy Human-Robot Interfaces and Interaction Istituto Italiano di Tecnologia Genoa Italy

This paper presents a CAD-based approach for automated surface defect detection. We leverage the a-priori knowledge embedded in a CAD model and integrate it with point cloud data acquired from commercially available stereo and depth cameras. The proposed method first transforms the CAD model into a high-density polygonal mesh, where each vertex represents a state variable in 3D space. Subsequently, a weighted least squares algorithm is employed to iteratively estimate the state of the scanned workpiece based on the captured point cloud measurements. This framework offers the potential to incorporate information from diverse sensors into the CAD domain, facilitating a more comprehensive analysis. Preliminary results demonstrate promising performance, with the algorithm achieving convergence to a sub-millimeter standard deviation in the region of interest using only approximately 50 point cloud samples. This highlights the potential of utilising commercially available stereo cameras for high-precision quality control applications. © 2025, CC BY-SA.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

Surface defect identification using Bayesian filtering on a 3D mesh

引用

Measurement: Sensors 2025年 38卷

作者： Dalle Vedove, Matteo Bonetto, Matteo Lamon, Edoardo Palopoli, Luigi Saveriano, Matteo Fontanelli, Daniele Department of Industrial Engineering Universitá di Trento Trento Italy DRIM Ph.D. of National Interest in Robotics and Intelligent Machines Italy Department of Information Engineering and Computer Science Universitá di Trento Trento Italy Human-Robot Interfaces and Interaction Istituto Italiano di Tecnologia Genoa Italy

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

Federated Learning and Convolutional Neural Networks for Intrusion Detection Systems

Federated Learning and Convolutional Neural Networks for Int...

引用

International Conference on Pattern Analysis and Intelligent Systems (PAIS)

作者： Malika Abid Mohammed Kamel Benkaddour Mohamed Benouis Computer Science Department Faculty of Sciences and Technology Artificial Intelligence and Information Technology Laboratory (LINATI) University of Kasdi Merbah Ouargla Algeria Human-Centered Artificial Intelligence University of Augsburg Augsburg Germany

ISBN: (数字)9798350350265

ISBN: (纸本)9798350350272

Recently, there has been a growing focus on network traffic threats due to the proliferation of mobile devices and the expanding Internet of Things (IoT). The centralised anomaly detection approach implies sharing the user’s data with a cloud server, which mostly exposes the user to the data breach issue. Given the above issues, this paper proposes a federated learning intrusion detection system (FedIDS) to improve the performance of intrusion detection while protecting user privacy. Motivated by recent exploits into deep learning for intrusion detection, we propose a convolutional neural network (CNN) model to learn and train the record data collected from independent and non-independent identically distributed (Non-IID, IID)data. This work conducts experiments on the NSL-KDD Data set for network intrusion detection. Experimental results show that FedIDS has achieved a competitive advantage over state-of-the-art centralised machine learning methods.

关键词： Performance evaluation Analytical models Privacy Federated learning Intrusion detection Telecommunication traffic Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

EventBERT: Incorporating Event-Based Semantics for Natural Language Understanding 21

EventBERT: Incorporating Event-Based Semantics for Natural L...

引用

21st China National Conference on Computational Linguistics, CCL 2022

作者： Zou, Anni Zhang, Zhuosheng Zhao, Hai Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Shanghai Jiao Tong University Shanghai China MoE Key Lab of Artificial Intelligence AI Institute Shanghai Jiao Tong University Shanghai China

ISBN: (纸本)9783031183140

Natural language understanding tasks require a comprehensive understanding of natural language and further reasoning about it, on the basis of holistic information at different levels to gain comprehensive knowledge. In recent years, pre-trained language models (PrLMs) have shown impressive performance in natural language understanding. However, they rely mainly on extracting context-sensitive statistical patterns without explicitly modeling linguistic information, such as semantic relationships entailed in natural language. In this work, we propose EventBERT, an event-based semantic representation model that takes BERT as the backbone and refines with event-based structural semantics in terms of graph convolution networks. EventBERT benefits simultaneously from rich event-based structures embodied in the graph and contextual semantics learned in pre-trained model BERT. Experimental results on the GLUE benchmark show that the proposed model consistently outperforms the baseline model. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：