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

Extending generalized unsupervised manifold alignment

Science China(information Sciences) 2022年第7期65卷 139-156页

作者： Xiaoyi YIN Zhen CUI Hong CHANG Bingpeng MA Shiguang SHAN Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences School of Computer Science and Engineering Nanjing University of Science and Technology CAS Center for Excellence in Brain Science and Intelligence Technology

Building connections between different data sets is a fundamental task in machine learning and related application community. With proper manifold alignment, the correspondences between data sets will assist us with comprehensive study of data processes and analyses. Despite the several progresses in semi-supervised and unsupervised scenarios, potent manifold alignment methods in generalized and realistic circumstances remain in absence. Besides, theretofore unsupervised algorithms seldom prove themselves mathematically. In this paper, we devise an efficient method to properly solve the unsupervised manifold alignment problem and denominate it as extending generalized unsupervised manifold alignment(EGUMA)method. More specifically, an explicit relaxed integer programming method is adopted to solve the unsupervised manifold alignment problem, which reconciles three factors covering the updated local structure matching, the the feature comparability and geometric preservation. An additional effort is retained on extending the Frank Wolfe algorithm to tacking our optimization problem. Besides our previous endeavors we adopt a new strategy for neighborhood discovery in the manifolds. The main advantages over previous methods accommodate(1) simultaneous alignment and discovery of manifolds;(2) complete unsupervised learning structure without any prerequisite correspondence;(3) more concise local geometry for the embedding space;(4) efficient alternative optimization;(5) strict mathematical analysis on the convergence and efficiency issues. Experiments on real-world applications verify the high accuracy and efficiency of our proposed method.

关键词： unsupervised manifold alignment relaxed integer programming Frank Wolfe algorithm

来源：评论

学校读者我要写书评

暂无评论

FIRE: A Dataset for Feedback Integration and Refinement Evaluation of Multimodal Models 38

FIRE: A Dataset for Feedback Integration and Refinement Eval...

引用

38th Conference on Neural information Processing Systems, NeurIPS 2024

作者： Li, Pengxiang Gao, Zhi Zhang, Bofei Yuan, Tao Wu, Yuwei Harandi, Mehrtash Jia, Yunde Zhu, Song-Chun Li, Qing Beijing Key Laboratory of Intelligent Information Technology School of Computer Science & Technology Beijing Institute of Technology China State Key Laboratory of General Artificial Intelligence BIGAI China State Key Laboratory of General Artificial Intelligence Peking University China Department of Electrical and Computer System Engineering Monash University Australia Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China Department of Automation Tsinghua University China

Vision language models (VLMs) have achieved impressive progress in diverse applications, becoming a prevalent research direction. In this paper, we build FIRE, a feedback-refinement dataset, consisting of 1.1M multi-turn conversations that are derived from 27 source datasets, empowering VLMs to spontaneously refine their responses based on user feedback across diverse tasks. To scale up the data collection, FIRE is collected in two components: FIRE-100K and FIRE-1M, where FIRE-100K is generated by GPT-4V, and FIRE-1M is freely generated via models trained on FIRE-100K. Then, we build FIRE-Bench, a benchmark to comprehensively evaluate the feedback-refining capability of VLMs, which contains 11K feedback-refinement conversations as the test data, two evaluation settings, and a model to provide feedback for VLMs. We develop the FIRE-LLaVA model by fine-tuning LLaVA on FIRE-100K and FIRE-1M, which shows remarkable feedback-refining capability on FIRE-Bench and outperforms untrained VLMs by 50%, making more efficient user-agent interactions and underscoring the significance of the FIRE dataset. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Bi-selection Method Based on Consistent Matrix for Large-Scale Datasets

引用

IEEE Transactions on Fuzzy Systems 2025年第6期33卷 1992-2005页

作者： Quan, Jinsheng Qiao, Fengcai Yang, Tian Shen, Shuo Qian, Yuhua Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Institute of Interdisciplinary Studies Changsha410081 China National University of Defense Technology College of Advanced Interdisciplinary Studies Changsha410081 China Shanxi University Institute of Big Data Science and Industry Taiyuan030006 China

Biselection (feature and sample selection) enhances the efficiency and accuracy of machine learning models when handling large-scale data. Fuzzy rough sets, an uncertainty mathematics model known for its excellent interpretability, are widely used in machine learning, particularly for feature selection. While the consistent matrix has significantly improved the computational efficiency and scalability of feature selection, like most fuzzy rough set-based methods, it focuses only on feature selection and seldom incorporates sample selection. This feature-centric approach can limit classification performance, particularly in noisy and large-scale datasets where both features and samples require judicious selection. To overcome these limitations, this article explores the integration of sample selection with feature selection. First, we introduce a β-consistent granulation method to generate more accurate and concise fuzzy information granules, reducing the impact of noisy samples. In addition, a novel membership function is employed to distinguish noise while simultaneously evaluating both features and samples. As a result, a biselection algorithm with linear computation complexity is proposed to select high-quality features and samples. Numerical experiments demonstrate that, compared to eleven representative algorithms, our proposed method achieves an average accuracy improvement of 9.66% and a 933-fold increase in efficiency. © 2025 IEEE.

关键词： Rough sets Noise Feature extraction Classification algorithms Accuracy Machine learning information systems Data models Computational efficiency Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Design of Control Circuit for Active Metasurface Based on Varactor Diode

Design of Control Circuit for Active Metasurface Based on Va...

引用

2023 International Applied Computational Electromagnetics Society Symposium, ACES-China 2023

作者： Zhang, Yue Liu, Yuefei Yang, Guohui Zhang, Kuang Li, Yingsong School of Electronics and Information Engineering Harbin Institute of Technology Harbin China Ministry of Education Anhui University Key Laboratory of Intelligent Computing and Signal Processing Hefei China

ISBN: (纸本)9781733509657

A control circuit for active metasurface based on varactor diode is designed in this paper. By varying the reverse bias voltage on the varactor diode, the designed circuit can regulate the additional phase of the active meta-atoms. The circuit adopts a form of one master and multiple slaves, which can simultaneously control the bias voltage of 960 meta-atoms. Each slave can control up to 64 channels. The control accuracy is 0.04V. The power consumption of a single slave is 160mW. Though experiment verification, the circuit has a good effect in controlling the beam deflection of the metasurface and generating OAM beams. © 2023 Applied Computational Electromagnetics Society (ACES).

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

Dynamic Task Scheduling for Coordinated Truck-Drone Parcel Delivery: A Hybrid Genetic Tabu Algorithm Approach 22

Dynamic Task Scheduling for Coordinated Truck-Drone Parcel D...

引用

22nd IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2024

作者： Li, Ruitai Yuan, Quan Liao, Tongxin Luo, Lijun Hu, Menglan Lai, Pan Zhang, Xiao South-Central Minzu University College of Computer Science China State Ethnic Affairs Commission Key Laboratory of Cyber-Physical Fusion Intelligent Computing China Huazhong University of Science and Technology School of Electronic Information and Communications China Hubei Key Laboratory of Smart Internet Technology China

ISBN: (纸本)9798331509712

With the rapid growth of the on-demand economy, logistics companies and merchants increasingly struggle to meet customer demands in dynamic and uncertain conditions. This paper studies the coordinated delivery of parcels by trucks and drones under such demands, proposing a Dynamic Task Scheduling Algorithm based on Hybrid Genetic Tabu algorithm (DTSAGT) for route optimization. Simulating dynamic customer demands with a Poisson distribution and statistical methods, the algorithm addresses timeliness issues due to variations in customer needs. It optimizes drone path planning and task allocation considering drone endurance and payload limits to minimize total delivery time. The algorithm includes three steps: initial solution construction, iterative optimization, and dynamic operations. Experimental results show that DTSAGT reduces the total service time by 15.05%, 34.13%, and 35.71% on average compared to the baseline algorithms. This paper's contribution is the combination of hybrid genetic and tabu search algorithms applied to dynamic task scheduling in truck-drone delivery, enhancing logistics efficiency. © 2024 IEEE.

关键词： Poisson distribution

来源：评论

学校读者我要写书评

暂无评论

Online Dynamic Scaling of Microservices with Fair Probabilistic Routing 22

Online Dynamic Scaling of Microservices with Fair Probabilis...

引用

22nd IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2024

作者： Chen, Yang Lin, Shisheng Hu, Yi Wang, Liangyuan Hu, Menglan Lai, Pan Xie, Yuanai College of Computer Science South-Central Minzu University China Key Laboratory of Cyber-Physical Fusion Intelligent Computing State Ethnic Affairs Commission China School of Electronic Information and Communications Huazhong University of Science and Technology China Hubei Key Laboratory of Smart Internet Technology China

ISBN: (纸本)9798331509712

Microservice architecture, as an emerging network architecture, has gained widespread adoption in latency-sensitive applications within the realm of mobile edge computing (MEC). In MEC networks, these latency-sensitive applications necessitate the concurrent processing of numerous service requests, which are composed of microservices. The complex dependencies between microservices and frequent data communication between servers contribute to the intricacy of deploying and routing microservice instances within the network. Moreover, the dynamic and unpredictable nature of service request traffic significantly complicates the timeliness and efficiency of service deployment and request routing strategies. However, existing research predominantly focuses on static network environments and neglects the time-varying characteristics of service request traffic in realistic scenarios. Consequently, we address the joint optimization problem of service deployment and request routing in the presence of dynamic service request traffic. To model the inherent data dependencies and analyze service request response latency, we employ the open Jackson queuing network. We propose a fine-grained microservice dynamic scaling (FMDS) algorithm to capture the dynamic fluctuations in service request traffic within the network. This algorithm scales microservice instances based on the principle of equal proportional change, obtaining a service deployment scheme that minimizes costs while satisfying latency constraints. Furthermore, we introduce a recursive path search algorithm that explores the service deployment scheme to determine the node forwarding probability for the entire network, adhering to the principles of fair routing. Simulation results show that the proposed method effectively improves network latency stability by 75% and enhances the timeliness of the service deployment strategy. © 2024 IEEE.

关键词： microservice request routing service deployment services computing

来源：评论

学校读者我要写书评

暂无评论

Improving Fake News Video Detection by Correlating with Neighbors 61

Improving Fake News Video Detection by Correlating with Neig...

引用

Findings of the Association for Computational Linguistics, ACL 2023

作者： Qi, Peng Zhao, Yuyang Shen, Yufeng Ji, Wei Cao, Juan Chua, Tat-Seng Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China National University of Singapore Singapore

ISBN: (纸本)9781959429623

The prevalence of short video platforms has spawned a lot of fake news videos, which have stronger propagation ability than textual fake news. Thus, automatically detecting fake news videos has been an important countermeasure in practice. Previous works commonly verify each news video individually with multimodal information. Nevertheless, news videos from different perspectives regarding the same event are commonly posted together, which contain complementary or contradictory information and thus can be used to evaluate each other mutually. To this end, we introduce a new and practical paradigm, i.e., cross-sample fake news video detection, and propose a novel framework, Neighbor-Enhanced fakE news video Detection (NEED), which integrates the neighborhood relationship of new videos belonging to the same event. NEED can be readily combined with existing single-sample detectors and further enhance their performances with the proposed graph aggregation (GA) and debunking rectification (DR) modules. Specifically, given the feature representations obtained from single-sample detectors, GA aggregates the neighborhood information with the dynamic graph to enrich the features of independent samples. After that, DR explicitly leverages the relationship between debunking videos and fake news videos to refute the candidate videos via textual and visual consistency. Extensive experiments on the public benchmark demonstrate that NEED greatly improves the performance of both single-modal (up to 8.34% in accuracy) and multimodal (up to 4.97% in accuracy) base detectors. Codes are available in https://***/ICTMCG/NEED. © 2023 Association for Computational Linguistics.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Retrievable Image Encryption Based on Adaptive Block Compressed Sensing

Retrievable Image Encryption Based on Adaptive Block Compres...

引用

International Conference on Image, Vision and intelligent Systems, ICIVIS 2023

作者： Fang, Jiuchuan Zhao, Hui Zheng, Mingwen Wang, Zijian Niu, Sijie Gao, Xizhan Shandong Provincial Key Laboratory of Network Based Intelligent Computing School of Information Science and Engineering University of Jinan Jinan250022 China School of Mathematics and Statistics Shandong University of Technology Zibo255000 China

ISBN: (纸本)9789819708543

The increasing popularity of the internet and mobile devices, cloud storage has emerged as a popular storage method. However, because data carries a lot of information, untrustworthy servers can access users’ private information. This paper introduces an approach based on adaptive block compressed sensing and hash retrieval. The objective of this paper is to reduce the storage space required by encryption algorithms while simultaneously improving interaction efficiency. Firstly, compress images using block compressed sensing, and use BCS-SPL algorithm to reconstruct. And curves are fitted based on the gradient features and root mean square values of the blocks. Then, the sub-rates are allocated based on the gradient characteristics of the image using a fitting curve, and then the image is compressed. Next, encrypt the image and save it. The features of the queried image are used for retrieval, the results are decrypted, and then reconstructed. Finally, through a series of security analyses, the method is effective. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Cloud storage

来源：评论

学校读者我要写书评

暂无评论

Imperceptible and Sparse Adversarial Attacks via a Dual-Population-Based Constrained Evolutionary Algorithm

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2023年第2期4卷 268-281页

作者： Tian, Ye Pan, Jingwen Yang, Shangshang Zhang, Xingyi He, Shuping Jin, Yaochu Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Institutes of Physical Science and Information Technology Hefei230601 China Hefei Comprehensive National Science Center Institute of Artificial Intelligence Hefei230088 China Anhui University School of Computer Science and Technology Hefei230601 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Artificial Intelligence Hefei230601 China Anhui University Anhui Engineering Laboratory of Human-Robot Integration System and Intelligent Equipment School of Electrical Engineering and Automation Hefei230601 China Bielefeld University Faculty of Technology Bielefeld33619 Germany

The sparse adversarial attack has attracted increasing attention due to the merit of a low attack cost via changing a small number of pixels. However, the generated adversarial examples are easily detected in vision since the perturbation to each pixel is relatively large. To achieve imperceptible and sparse adversarial attacks, this article formulates a bi-objective constrained optimization problem, simultaneously minimizing the 0 and 2 distances to the original image, and proposes a dual-population-based constrained evolutionary algorithm to solve it. The proposed method solves the optimization problem by evolving two populations, where one population is responsible for finding feasible solutions (i.e., successful attacks) and the other one is to minimize both the 0 and 2 distances. Moreover, a population initialization strategy and two genetic operators are customized to accelerate the convergence speed. Experimental results indicate that the proposed method can achieve high success rates with low attack costs, and strikes a better balance between the 0 and 2 distances than state-of-the-art methods. © 2020 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Context-Driven Index Trimming: A Data Quality Perspective to Enhancing Precision of RALMs

Context-Driven Index Trimming: A Data Quality Perspective to...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Ma, Kexin Jin, Ruochun Wang, Haotian Wang, Xi Chen, Huan Tang, Yuhua Wang, Qian Institute for Quantum Information State Key Laboratory of High Performance Computing China College of Computer Science and Technology National University of Defense Technology Changsha China Intelligent Game and Decision Lab Academy of Military Science Beijing China

ISBN: (纸本)9798891761681

Retrieval-Augmented Large Language Models (RALMs) have made significant strides in enhancing the accuracy of generated responses. However, existing research often overlooks the data quality issues within retrieval results, often caused by inaccurate existing vector-distance-based retrieval methods. We propose to boost the precision of RALMs' answers from a data quality perspective through the Context-Driven Index Trimming (CDIT) framework, where Context Matching Dependencies (CMDs) are employed as logical data quality rules to capture and regulate the consistency between retrieved contexts. Based on the semantic comprehension capabilities of Large Language Models (LLMs), CDIT can effectively identify and discard retrieval results that are inconsistent with the query context and further modify indexes in the database, thereby improving answer quality. Experiments demonstrate average improvement of 3.75% in accuracy on challenging question-answering tasks. Also, the flexibility of CDIT is verified through its compatibility with various language models and indexing methods, which offers a promising approach to bolster RALMs' data quality and retrieval precision jointly. © 2024 Association for Computational Linguistics.

关键词： Data accuracy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：