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

High-Dimensional Multi-Label data Stream Classification With Concept Drifting Detection

IEEE Transactions on Knowledge and data Engineering 2023年第8期35卷 8085-8099页

作者： Li, Peipei Zhang, Haixiang Hu, Xuegang Wu, Xindong Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei230601 China Hefei University of Technology School of Computer Science and Information Engineering Hefei230601 China Second People's Hospital of Hefei Anhui Hefei230011 China Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of Education of China School of Computer Science and Information Engineering Anhui Hefei230002 China

Multi-label data streams such as Web texts and images have been popular on the Web. These data present the characteristics of multiple label, high dimensionality, high volume, high velocity and especial concept drift etc. Thus, multi-label data stream classification is a very challenging and significant task especially in the handling of high-dimensional data with concept drifts. However, this challenge has received little attention from the research community. Therefore, we propose the max-relevance and min-redundancy based algorithm adaptation approach for the efficient and effective classification on multi-label data streams with high-dimensional attributes and concept drifts. In order to reduce the impact from the high-dimensional data with noisy attributes, we first refine the minimal-redundancy-maximal-relevance criterion based on mutual information to select qualified features in multi-label data streams. Second, we propose the data distribution based concept drifting detection approach to distinguish concept drifts hidden in data streams. Finally, we build an incremental ensemble classification model for efficiently classifying multi-label data streams. Extensive studies show that our approach can get optimal subsets of features while maintaining a good performance in the multi-label classification, as compared to several state-of-the-art multi-label feature selection algorithms using two efficient multi-label classification methods as base classifiers. Meanwhile, our approach is superior to three well-known multi-label data stream classification approaches in the effectiveness and efficiency. © 1989-2012 IEEE.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Dual-view Label and Feature Supervision Network for Semi-supervised Medical Image Segmentation 24

Dual-view Label and Feature Supervision Network for Semi-sup...

引用

7th International Conference on Signal Processing and Machine Learning, SPML 2024

作者： Zhou, Zhen Li, Zuoyong Wang, Zhengyuan Teng, Shenghua Wang, Tao College of Electronic and Information Engineering Shandong University of Science and Technology Qingdao China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control School of Computer and Big Data Minjiang University Fuzhou China

ISBN: (纸本)9798400717192

Semi-supervised learning has garnered significant attention, particularly in medical image segmentation, owing to its capacity to leverage a large number of unlabeled data and a limited amount of labeled data to improve performance. However, most existing semi-supervised segmentation methods exhibit shortcomings in supervising unlabeled data, both in the label space due to potential noise in pseudo-labels, and the feature space due to indistinct class boundaries. To address the issues above, we propose Dual-view Label and Feature Supervision Network, termed DLFS-Net, to enhance label and feature supervision for unlabeled data. Our approach is based on a dual-view learning strategy that incorporates two modules: the Confidence Fusion Supervision Module (CFS) and the Dual-view Prototype Learning Module (DPL). Specifically, the CFS module generates weight matrices to integrate complementary information from two model outputs, producing more accurate pseudo-labels in the label space. The DPL module reduces intra-class variations in the feature space from two different views through prototype learning to generate clear class boundaries. Experiments on the LA and Pancreas-CT datasets demonstrate that our framework show solid gains (e.g.,1.76% Dice and 2.37% Jaccard improvement on Pancreas-CT dataset with 20% labeled data) compared with the state-of-the-art methods. © 2024 ACM.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

A Differential Privacy Protection Protocol Based on Location Entropy

引用

Tsinghua science and technology 2023年第3期28卷 452-463页

作者： Ping Guo Baopeng Ye Yuling Chen Tao Li Yixian Yang Xiaobin Qian Xiaomei Yu State Key Laboratory of Public Big Data School of Computer Science and TechnologyGuizhou UniversityGuiyang 550025China Information Technology Innovation Service Center of Guizhou Province Guiyang 550025China School of Cyberspace Security Beijing University of Posts and TelecommnuicationsBeijing 100000China Guizhou CoVision Science&Technology Co. Ltd.Guiyang 550025China School of Information Science and Engineering Shandong Normal UniversityJinan 250000China

A Location-Based Service(LBS)refers to geolocation-based services that bring both convenience and *** an increase in the scale and value of data,most existing location privacy protection protocols cannot balance privacy and *** solve the revealing problems in LBS,we propose a differential privacy protection protocol based on location ***,we design an algorithm of the best-assisted user selection for constructing anonymity ***,we employ smart contracts to evaluate the credibility of participants,which ensures the honesty of ***,we provide a comprehensive experiment;the theoretical analysis and experiments show that the proposed protocol effectively resists background knowledge ***,our protocol improves data ***,it realizes user-controllable privacy protection,which improves privacy protection and strengthens security.

关键词： Location-Based Services(LBS) smart contract location entropy differential privacy privacy protection

来源：评论

学校读者我要写书评

暂无评论

Power Optimization for Low Transmission Delay in Software Defined data Center Networks

引用

IEEE Transactions on Mobile Computing 2025年第7期24卷 5716-5730页

作者： Zhao, Yong Cao, Jiannong Wang, Xingwei Li, Fuliang He, Qiang Liu, Xiaojie University of Electronic Science and Technology of China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Laboratory of Intelligent Collaborative Computing Chengdu611731 China Hong Kong Polytechnic University Department of Computing Hung Hom Hong Kong Northeastern University College of Computer Science and Engineering Shenyang110819 China Northeastern University College of Medicine and Biological Information Engineering Shenyang110819 China Pengcheng Laboratory Shenzhen518066 China

Software-Defined data Center Networks (SDDCNs) utilizes Software Defined Networking (SDN) as a network architecture to achieve highly flexible, programmable, and automated management of data Center Networks (DCNs). The high energy consumption of DCNs remains a persistent and significant challenge. Thus, the energy saving is crucial and imperative for DCNs. Current energy-efficient solutions primarily rely on flow consolidation and dynamic device sleeping techniques to reduce energy consumption. However, these approaches often yield long Flow Completion Time (FCT), potentially resulting in violations of service-level agreements, particularly for delay-sensitive applications. In this paper, we formulate the problem of minimizing the power consumption in SDDCNs as key objective while ensuring timely FCT for delay-sensitive applications. To solve this problem, we first introduce the Active Network Generation (ANG) approach, which generates a minimal active subnet with the least number of active devices while meeting the current traffic demand. Subsequently, we propose two algorithms based on the type of applications: the Delay-Tolerant Flow Route (DTFR) algorithm for delay-tolerant applications and the Delay-Sensitive Flow Route (DSFR) algorithm for delay-sensitive applications. Simulation results demonstrate that our propose solution achieves an energy-saving rate of up to 67.77% and significantly reduces FCT compared to benchmark solutions. © 2002-2012 IEEE.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

DFGET: Displacement-Field Assisted Graph Energy Transmitter for Gland Instance Segmentation 17

DFGET: Displacement-Field Assisted Graph Energy Transmitter ...

引用

17th IEEE International Conference on Signal Processing, ICSP 2024

作者： Jian, Caiqing Qin, Yongbin Wang, Lihui Ye, Chen Cheng, Xinyu Guizhou University Engineering Research Center of Text Computing & Cognitive Intelligence Ministry of Education Key Laboratory of Intelligent Medical Image Analysis and Precise Diagnosis of Guizhou Province State Key Laboratory of Public Big Data College of Computer Science and Technology Guiyang China

ISBN: (纸本)9798350387384

Gland instance segmentation is an essential but challenging task in the diagnosis of adenocarcinoma. The existing models usually achieve gland instance segmentation through multi-task learning and boundary loss constraint. However, how to deal with the problems of gland adhesion and inaccurate boundary in segmenting the complex samples remains a challenge. In this work, we propose a novel geometric feature named displacement field (DF), which can represent the geometric information such as shape, size, and orientation of the glands. Based on the explicit constraint of DF, a displacement-field assisted graph energy transmitter (DFGET) framework is proposed for solving the above problems. Using such graph framework, the gland semantic segmentation map and the displacement field of the graph nodes are estimated with two graph network branches. With the constraint of DF, a graph cluster module is presented to improve the intra-class feature consistency and inter-class feature discrepancy, as well as to separate the adherent glands. Extensive comparison and ablation experiments on the GlaS dataset demonstrate the effectiveness of the displacement field and the superiority of DFGET. Compared to the best comparative model, DFGET increases the object-Dice and object-F1 score by 2.27% and 3.11% respectively, while decreases the object-HD by 15.58, achieving state-of-the-art performance, which indicates that DFGET can serve as an auxiliary tool for the diagnosis of adenocarcinoma. © 2024 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

A Social recommendation model based on hypergraph deep representation learning 5

A Social recommendation model based on hypergraph deep repre...

引用

5th International Conference on Computer Vision and data Mining, ICCVDM 2024

作者： Huang, Shan Liu, Yanan Wu, Yufan Wang, Jinlan Duan, Xiaodong College of Computer Science and Engineering Dalian Minzu University Dalian116600 China State Ethnic Affairs Commission Key Laboratory of Big Data Applied Technology Dalian Minzu University Dalian116600 China

ISBN: (纸本)9781510682863

In social recommendation, user's interest preference is influenced by multiple factors. It is a challenging problem to mine data information effectively in multiple types of interaction behaviors between users and items to obtain more accurate embedding of user items. Existing social recommendation models tend to take a homogeneous approach to the interaction effects of neighbourhood nodes on target nodes. We propose a social recommendation model based on deep representation learning of hypergraphs. The model aims to learn embedded representations of users and items from multi-type user-item interaction data efficiently. An attention mechanism that integrating time interval information is introduced for computing the preference weights of each item to the user. Messages are generated with time-interval attention weights the inter-user and inter-item hypergraph information is combined to update the messages and aggregate the information from multiple layers. Extensive experiments on two real datasets show that the proposed models are superior to other advanced recommendation methods in improving the recommendation performance. © 2024 SPIE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Integration of Cross-Organizational Business Processes with Blockchain: Identifying key Activities for On-Chain Execution Based on Behavioral Profiles 6

Integration of Cross-Organizational Business Processes with ...

引用

6th International Conference on Artificial Intelligence and Advanced Manufacturing, AIAM 2024

作者： Lei, Jiaxin Wang, Lili College of Mathematics and Big Data Anhui University of Science&Technology Anhui Huainan232001 China State Key Laboratory of Mining Response and Disaster Prevention and Control in Deep Coal Mines Anhui University of Science and Technology Anhui Huainan232001 China

ISBN: (纸本)9781837242672

Business Process Management (BPM) is widely applied within enterprises to standardize and streamline processes, and blockchain offers an effective solution for managing inter-organizational business processes. Lots of throughput and gas are required when deploying smart contracts for normative process execution and storing data on chains. However, a complete normative process on the chain requires a lot of gas and operation and maintenance costs, and also limits the flexibility of process execution and modification. To address these challenges, the paper proposes an improved approach about how to convert the full process into on-chain. Firstly, key activities of business processes suitable for on-chain implementation are identified by constructing a matrix of behavior profile, adapting frequency analysis, and executable sequence analysis. Secondly, these key activities are then converted into smart contracts and deployed on the blockchain. Finally, we enhance intelligent management in BPM by employing Intelligent Information Systems (IIS) for real-time monitoring, process prediction, and automated decision-making to implement an experiment. Experimental results show that the proposed method can be adapted to most business scenarios, improves the flexibility of BPM and blockchain integration, and reduces the application cost of blockchain in business processes. Meanwhile, it takes into account the security transparency of blockchain and the execution performance of business processes. © The Institution of Engineering & technology 2024.

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

Cross-modal image text retrieval based on Cross-optimization and Joint strategy

Cross-modal image text retrieval based on Cross-optimization...

引用

2024 International Conference on Image, Signal Processing, and Pattern Recognition, ISPP 2024

作者： Zheng, Wei Han, Na Hu, Yan Kang, Peipei Zhang, Yue Yang, Aqing Zhang, Lei School of Computer Science Guangdong Polytechnic Normal University China Guangdong Provincial Key Laboratory of Intellectual Property and Big Data China School of Computer Science and Technology Guangdong University of Technology China School of Information Engineering East University of Heilongjiang China

ISBN: (纸本)9781510680425

In the fields of computer vision and natural language processing, cross-modal retrieval is of great importance that cannot be ignored. In existing multi-granularity alignment methods, significant progress has been made by globally aligning images and sentences or locally aligning regions and words. However, most of these methods rely on attention mechanisms, which may be affected by noise and cannot balance the differences between modalities, resulting in suboptimal image-text alignment. In addition, training with attention mechanisms consumes a lot of computational resources, and the retrieval process is time-consuming. To address these challenges, we develop a novel multigranularity image-text alignment model, which we call DFVLM. First, we independently train the intra-modal encoder and cross-modal encoder to reduce interference between different modal encoders and better learn intra-modal and inter-modal information. Then, we propose a joint strategy to combine the intra-modal and inter-modal information to better capture the information between image and text. In addition, we introduce a hard negative pair-based method to train the performance of the intra-modal multi-granularity encoder without using attention mechanisms. Unlike existing methods, We treat image and text retrieval as a two-way process and delve into the intrinsic connections between the two matrices. We propose a cross-validation method to optimize the retrieval result based on common image-to-text alignment scenarios in daily life, i.e., during the image-to-text retrieval process, a text-to-image reverse verification is performed on the retrieved corresponding text. Through extensive qualitative experiments and analysis, our approach performs well on both Flickr30K and MSCOCO datasets and also significantly reduces the time required for testing. © 2024 SPIE.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Multi-Task Learning Network Optimization Based on Weight Adaptive 11

Multi-Task Learning Network Optimization Based on Weight Ada...

引用

11th IEEE International Conference on Behavioural and Social Computing, BESC 2024

作者： Cao, Zizhuo Li, Yidong Ding, Chuntao Zhang, Zhuxi School of Computer Science and Technology Beijing Jiaotong University Key Laboratory of Big Data & Artificial Intelligence in Transportation Ministry of Education Beijing100044 China General Logistics Information Center Beijing100036 China

ISBN: (纸本)9798331531904

Multi-task learning has emerged as a significant topic in artificial intelligence research, where a singular network model performs numerous tasks. This approach simultaneously processes multiple related tasks and shared knowledge, enhancing model generalization while increasing efficiency. This methodology provides innovative solutions to complex real-world problems. However, the single-model-based approach for multi-task learning suffers from inter-task interference in practice. Therefore, the exploration of more efficient multi-task learning strategies, aimed at balancing the synergy and conflict among tasks and minimizing the dependence on computational resources, is pivotal for the field's future progress. We propose a strategy that autonomously adjusts both the parameters and structures of the model to alleviate gradient interference in multi-task learning. This method includes integrating a lightweight, weight-adaptive module that enhances the network's ability to process tasks by optimally balancing parameter sharing and isolation. This adaptation enables the model to share common features across tasks while allocating distinct spaces for each task, thereby reducing interference. Our extensive experimental validation indicates that our framework surpasses other multi-task learning approaches, achieving joint optimization of tasks more effectively. This enhancement not only bolsters performance but also maintains an equilibrium between accuracy and inference speed. © 2024 IEEE.

关键词： Multi-task learning

来源：评论

学校读者我要写书评

暂无评论

Towards Exploratory Query Optimization for Template-Based SQL Workloads 40

Towards Exploratory Query Optimization for Template-Based SQ...

引用

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Feng, Jieming Li, Zhanhuai Chen, Qun School of Computer Science and Engineering Northwestern Polytechnical University Shaanxi Xi'an China Key Laboratory of Big Data Storage and Management Ministry of Industry and Information Technology Northwestern Polytechnical University Shaanxi Xi'an China

ISBN: (纸本)9798350317152

SQL query optimization aims to choose an optimal Query Execution Plan (QEP) for a query. The existing optimizers usually choose the plan with the minimal execution cost. However, in some real scenarios (e.g., cloud OLAP), it is a business imperative to minimize the cost of an entire workload. Unfortunately, the greedy optimizers are prone to generating execution plans that are only suboptimal from the workload perspective. In this paper, we propose a novel QEP optimization approach for template-based SQL that aims to minimize the execution cost of an entire workload instead of individual queries. While choosing an execution plan for a query, the proposed approach considers a plan's impact on future query execution as well as its own execution cost. We first define an exploratory metric, Plan Exploration Value (PEV), to measure a plan's potential benefit to future query execution. Then, we model exploratory plan selection as an optimization problem with cost constraints, and present an efficient algorithm based on dynamic programming for its solution. Finally, we evaluate the performance of the proposed approach by a comparative study on benchmark workloads. Our extensive experiments have shown that it generates more efficient workload execution plans than the existing alternatives. © 2024 IEEE.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：