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

arXiv 2024年

作者： Lin, Xinyu Zhang, Tianyu Hou, Chengbin Wang, Jinbao Xue, Jianye Lv, Hairong School of Computing and Artificial Intelligence Fuyao University of Science and Technology Fuzhou China Department of Automation Tsinghua University Beijing China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China

Node Importance Estimation (NIE) is a task that quantifies the importance of node in a graph. Recent research has investigated to exploit various information from Knowledge Graphs (KGs) to estimate node importance scores. However, the semantic information in KGs could be insufficient, missing, and inaccurate, which would limit the performance of existing NIE models. To address these issues, we leverage Large Language Models (LLMs) for semantic augmentation thanks to the LLMs’ extra knowledge and ability of integrating knowledge from both LLMs and KGs. To this end, we propose the LLMs Empowered Node Importance Estimation (LENIE) method to enhance the semantic information in KGs for better supporting NIE tasks. To our best knowledge, this is the first work incorporating LLMs into NIE. Specifically, LENIE employs a novel clustering-based triplet sampling strategy to extract diverse knowledge of a node sampled from the given KG. After that, LENIE adopts the node-specific adaptive prompts to integrate the sampled triplets and the original node descriptions, which are then fed into LLMs for generating richer and more precise augmented node descriptions. These augmented descriptions finally initialize node embeddings for boosting the downstream NIE model performance. Extensive experiments demonstrate LENIE’s effectiveness in addressing semantic deficiencies in KGs, enabling more informative semantic augmentation and enhancing existing NIE models to achieve the state-of-the-art performance. The source code of LENIE is freely available at https://***/XinyuLin-FZ/LENIE. Copyright © 2024, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Graph-Augmented Contrastive Clustering for Time Series data

SSRN

引用

SSRN 2024年

作者： Zhang, Qin Liang, Zhuoluo Ngueilbaye, Alladoumbaye Zhang, Peng Chen, Junyang Chen, Xiaojun Huang, Joshua Zhexue College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China Cyberspace Institute of Advanced Technology Guangzhou University Guangzhou510006 China

The recent emergence of time series contrastive clustering methods can be categorized into two classes. The first class uses contrastive learning for universal representations, which can be effective in various downstream tasks, but overlooks important categorical information and clustering objectives, leading to unsuitable models. The second class incorporates contrastive learning into clustering objectives but fails to fully explore potential connections and structures between time series data. To this end, we propose the "Time Series Graph-augmented Contrastive Clustering (TSGCC) method", a graph-augmented contrastive learning framework aiming to create cluster-friendly features and assignments by iteratively optimizing contrastive loss. The method uses a weighted KNN graph to build positive and negative sample pairs, projecting the instances into a feature space with the dimensionality number of clusters. Experimental results demonstrate that TSGCC outperforms 18 advanced time-series clustering methods on the 36 representatives out of the 128 UCR benchmarks, achieving the best clustering results on 12 datasets, with the highest average rank (3.22) of RI and the second-highest average rank (3.89) of NMI among 18 clustering methods. We further compared our method with recent approaches on the entire set of 128 UCR datasets, demonstrating our method's broad applicability and effectiveness. © 2024, The Authors. All rights reserved.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

DPP-HSS: Towards Fast and Scalable Hypervolume Subset Selection for Many-objective Optimization

引用

IEEE Transactions on Evolutionary Computation 2024年

作者： Gong, Cheng Nan, Yang Shang, Ke Guo, Ping Ishibuchi, Hisao Zhang, Qingfu City University of Hong Kong Department of Computer Science Hong Kong City University of Hong Kong Shenzhen Research Institute Shenzhen China Southern University of Science and Technology Department of Computer Science and Engineering Shenzhen518055 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen China

Hypervolume subset selection (HSS) has received significant attention since it has a strong connection with evolutionary multi-objective optimization (EMO), such as environment selection and post-processing to identify representative solutions for decision-makers. The goal of HSS is to find the optimal subset that maximizes the hypervolume indicator subject to a given cardinality constraint. However, existing HSS algorithms or related methods are not efficient in achieving good performance in high-dimensional objective spaces. This is primarily because HSS problems become NP-hard when the number of objectives exceeds two, and the calculation of hypervolume contribution is very time-consuming. To efficiently solve HSS problems while maintaining a good solution quality, we propose a fast and scalable hypervolume subset selection method for many-objective optimization based on the determinantal point process (DPP), named DPP-HSS, which is fully free of hypervolume contribution calculation. Specifically, DPP-HSS constructs a hypervolume kernel matrix by extracting the convergence and diversity representations of each solution for a given HSS problem. This matrix is then used to build a DPP model. Subsequently, the original HSS problem is reformulated as a new maximization optimization problem based on the constructed model. A greedy DPP-based hypervolume subset selection algorithm is implemented to solve this transformed problem. Extensive experiments show that the proposed DPP-HSS achieves significant speedup and good hypervolume performance in comparison with state-of-the-art HSS algorithms on benchmark problems. Furthermore, DPP-HSS demonstrates very good scalability with respect to the number of objectives. © 1997-2012 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

CTGDiff: A Conditional Diffusion Model for Cardiotocography Signal Synthesis

CTGDiff: A Conditional Diffusion Model for Cardiotocography ...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Xiaoqing Li Pufan Cai Yu Lu Shijie Shi Liangkun Ma Xianghua Fu College of Big Data and Internet Shenzhen Technology University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Department of Surgery Yong Loo Lin School of Medicine National University of Singapore Singapore School of Applied Technology Shenzhen University Shenzhen China Department of Obstetrics and Gynecology Peking Union Medical College Hospital Beijing China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

The analysis of Cardiotocography (CTG) signals is often hindered by challenges such as limited data availability and label imbalance, which can undermine the performance of deep learning models. To address these issues, we present CTGDiff, a novel conditional diffusion model designed for generating synthetic Fetal Heart Rate (FHR) and Uterine Contraction (UC) signals. CTGDiff leverages both Phase-Rectified Signal Averaging (PRSA) spectrograms and UC as conditioning inputs for FHR, and integrates time encoding, condition generation from PRSA features, and residual blocks with dilated convolutions to capture both temporal dynamics and long-range dependencies. Extensive experiments, both qualitative and quantitative, demonstrate the model’s ability to synthesize high-quality CTG signals. In comparison with GANs and image-based diffusion models, CTGDiff achieves superior signal fidelity and distribution similarity for FHR, as indicated by metrics such as a 0.004 maximum mean deviation (MMD), 0.646 percent root mean square difference (PRD), 3.951 relative entropy (RE), and 0.291 Frechet distance (FD). Expert evaluations confirm that the model can generate both normal and abnormal CTG signals with high accuracy, conditioned on specific input data. These results underscore the potential of diffusion models for a wide range of applications in biomedical time series analysis, including signal synthesis, imputation, and noise reduction.

关键词： Measurement Fetal heart rate Biological system modeling Time series analysis Diffusion models data models Signal synthesis Cardiography Speech processing Spectrogram

来源：评论

学校读者我要写书评

暂无评论

UICopilot: Automating UI Synthesis via Hierarchical Code Generation from Webpage Designs 25

UICopilot: Automating UI Synthesis via Hierarchical Code Gen...

引用

34th ACM Web Conference, WWW 2025

作者： Gui, Yi Wan, Yao Li, Zhen Zhang, Zhongyi Chen, Dongping Zhang, Hongyu Su, Yi Chen, Bohua Zhou, Xing Jiang, Wenbin Zhang, Xiangliang Huazhong University of Science and Technology Wuhan China Chongqing University Chongqing China Hubei University of Automotive Technology Shiyan China Rabbitpre AI Shenzhen China University of Notre Dame Notre Dame United States National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster Grid Computing Lab School of Computer Science and Technology China

ISBN: (纸本)9798400712746

Automating the synthesis of User Interfaces (UIs) plays a crucial role in enhancing productivity and accelerating the development lifecycle, reducing both development time and manual effort. Recently, the rapid development of Multimodal Large Language Models (MLLMs) has made it possible to generate front-end Hypertext Markup Language (HTML) code directly from webpage designs. However, real-world webpages encompass not only a diverse array of HTML tags but also complex stylesheets, resulting in significantly lengthy code. The lengthy code poses challenges for the performance and efficiency of MLLMs, especially in capturing the structural information of UI designs. To address these challenges, this paper proposes UICopilot, a novel approach to automating UI synthesis via hierarchical code generation from webpage designs. The core idea of UICopilot is to decompose the generation process into two stages: first, generating the coarse-grained HTML hierarchical structure, followed by the generation of fine-grained code. To validate the effectiveness of UICopilot, we conduct experiments on a real-world dataset, i.e., WebCode2M. Experimental results demonstrate that UICopilot significantly outperforms existing baselines in both automatic evaluation metrics and human evaluations. Specifically, statistical analysis reveals that the majority of human annotators prefer the webpages generated by UICopilot over those produced by GPT-4V. © 2025 Copyright held by the owner/author(s).

关键词： Web Design

来源：评论

学校读者我要写书评

暂无评论

SLMP: A Scientific Literature Management Platform Based on Large Language Models 15

SLMP: A Scientific Literature Management Platform Based on L...

引用

15th IEEE International Conference on Knowledge Graph, ICKG 2024

作者： Guo, Menghao Jiang, Jinling Wu, Fan Sun, Shanxin Zhang, Chen Li, Wenhui Sun, Zeyi Chen, Guangyong Wu, Xindong Research Center for Life Sciences Computing Zhejiang Lab Hangzhou China Research Center for Data Hub and Security Zhejiang Lab Hangzhou China Research Center for High Efficiency Computing System Zhejiang Lab Hangzhou China Hefei University of Technology Key Laboratory of Knowledge Engineering With Big Data Hefei China

ISBN: (纸本)9798331508821

This paper presents a Scientific Literature Management Platform (SLMP, demo link1 ) based on large language models (LLMs). The platform consists of four modules: literature management, literature extraction, literature retrieval, and question answering. The core techniques used to support the four modules across the platform include a fine-tuned model PaperExtractGPT and a continual pre-training model ChatPaperGPT based on ChatGLM2 using the data from scientific research literature, responsible for information extraction and communication, respectively. Due to their powerful capabilities in natural language understanding and generation, LLMs can understand complex scientific concepts based on the provided contexts, and thus generate high-quality texts and conduct in-depth information retrieval and question answering. Our platform can help researchers manage and utilize literature more effectively and efficiently for finding relevant literature, obtaining required information, and generating new knowledge. © 2024 IEEE.

关键词： Question answering

来源：评论

学校读者我要写书评

暂无评论

Personalized Federated Learning with Multiple Classifier Aggregation

SSRN

引用

SSRN 2024年

作者： Zheng, Shaifeng Zhu, Qingling Lin, Qiuzhen Liu, Songbai Wong, Ka-Chun Li, Jianqiang College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Department of Computer Science City University of Hong Kong Hong Kong

Personalized federated learning (PFL) has garnered attention due to its capability to address statistical heterogeneity among clients. Typically, prevailing PFL methods aggregate a single global model for personalization, which may be inadequate for clients with diverse data distributions. Furthermore, in the local update, each private dataset is used to optimize the model independently, which increases the risk of overfitting the current data distribution and losing previously acquired knowledge, resulting in knowledge forgetting. In this study, personalized federated learning with multiple classifier aggregation is proposed. The method involves splitting the client model into its head and base, then optimizing them respectively using an alternating optimization strategy that first optimizes the head and then the base. Initially, to address the suboptimal model problem, the proposed approach aggregates multiple classifiers using data distribution and employs knowledge distillation to impart positive and negative classifier knowledge for learning the most suitable personalized model head. Additionally, to mitigate knowledge forgetting, a learnable personalization layer is introduced, and hidden loss is utilized to learn the knowledge of the global base and prevent overfitting of the model base. Empirical results demonstrate that the proposed method achieves competitive performance across various benchmarks, outperforming the majority of state-of-the-art PFL algorithms. The source code is publicly available at \href{https://***/xiaye-maker/FedMCA}{https://***/xiaye-maker/FedMCA} © 2024, The Authors. All rights reserved.

关键词： Aggregates

来源：评论

学校读者我要写书评

暂无评论

DINOv2-powered Few-Shot Semantic Segmentation: A Unified Framework via Cross-Model Distillation and 4D Correlation Mining

arXiv

引用

arXiv 2025年

作者： Zhuo, Wei Tang, Zhiyue Xue, Wufeng Ding, Hao Shen, Linlin School of Artificial Intelligence Shenzhen University Shenzhen518060 China National Engineering Laboratory of Big Data System Computing Technology Shenzhen University China School of Biomedical Engineering Shenzhen University Medical School Shenzhen University China School of Computer Science and Software Engineering Shenzhen University China

Few-shot semantic segmentation has gained increasing interest due to its generalization capability, i.e., segmenting pixels of novel classes requiring only a few annotated images. Prior work has focused on meta-learning for support-query matching, with extensive development in both prototype-based and aggregation-based methods. To address data scarcity, recent approaches have turned to foundation models to enhance representation transferability for novel class segmentation. Among them, a hybrid dual-modal framework including both DINOv2 and SAM has garnered attention due to their complementary capabilities. We wonder "can we build a unified model with knowledge from both foundation models?" To this end, we propose FS-DINO, with only DINOv2’s encoder and a lightweight segmenter. The segmenter features a bottleneck adapter, a meta-visual prompt generator based on dense similarities and semantic embeddings, and a decoder. Through coarse-to-fine cross-model distillation, we effectively integrate SAM’s knowledge into our lightweight segmenter, which can be further enhanced by 4D correlation mining on support-query pairs. Extensive experiments on COCO-20i, PASCAL-5i, and FSS-1000 demonstrate the effectiveness and superiority of our method. Copyright © 2025, The Authors. All rights reserved.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Last-X-Generation Archiving Strategy for Multi-Objective Evolutionary Algorithms

Last-X-Generation Archiving Strategy for Multi-Objective Evo...

引用

Congress on Evolutionary Computation

作者： Tianye Shu Yang Nan Ke Shang Hisao Ishibuchi Department of Computer Science and Engineering Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation Southern University of Science and Technology Shenzhen China Southern University of Science and Technology Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China

ISBN: (数字)9798350308365

ISBN: (纸本)9798350308372

For evolutionary multi-objective optimization algorithms (EMOAs), an external archive can be utilized for saving good solutions found throughout the evolutionary process. Recent studies showed that a solution set selected from an external archive is usually superior to the final population. That is, the incorporation of an external archive improves the performance of EMOAs. However, the computation time for maintaining an external archive is long, especially when the archive size is large. To solve this issue, a simple archiving strategy is to save all solutions generated in the last several generations. In this paper, we examine this archiving strategy for three representative EMOAs on artificial test problems (Minus-DTLZ and WFG) and real-world problems (RE). Our results show that archiving the last several generations clearly improves the performance of EMOAs without severely increasing the computation time.

关键词： Costs Sociology Evolutionary computation Statistics Optimization Standards

来源：评论

学校读者我要写书评

暂无评论

A method for accelerating relations search over big data scenario 5

A method for accelerating relations search over big data sce...

引用

5th International Conference on Algorithms, computing and Artificial Intelligence, ACAI 2022

作者： Liu, Lihua Wang, Mao Xiao, Kaiming Chen, Haiwen College of System Engineering National University of Defense Technology China and Laboratory for Big Data and Decision National University of Defense Technology Changsha410073 China

ISBN: (纸本)9781450398343

We propose an acceleration method for relations search over big data scenario. The relations search is in essence an induced subgraph search of graph data model, which is to search all edges with all adjacent vertices falling into a given vertex set. For example, in the risk-control scenario for anti-fraud, for a swindling gang of highly similar fraud behaviors, figuring out all relations between these swindlers can be greatly beneficial to precisely attack all similar gangs. In-memory induced subgraph search requires lots of random accesses, while in big data scenario, relations data tend to be stored on disk when the memory is limited, and the corresponding random lookups over disk incorporate huge overhead. Also, even a singleton disk access could be costly since there are usually many properties data in a relation. Hence, existing methods would suffer considerable performance bottlenecks when applied over data on disk. We build graph over disk-based edge index, and propose multiple BFS (Bread First Search) level gaps based induces subgraph acceleration method, with efficient performance guarantee when the memory is limited. We avoid imbalance in performance for query evaluation with edge index based data organization, with which we further reduce redundant I/O accesses. We filter most invalid no-result edge queries based our BFS level gaps framework. We find that, for each BFS, we can confirm the no edge status between a pair of vertices if their BFS accessing level are of distance more than 1, which indicates the nonexistence of edge. Extensive experiments over real world graph datasets confirm the effectiveness of our method. We find that more than 97% invalid edge queries are filtered by our method, which greatly improve the system performance. Hence, our method with multiple BFS level gap encoding over vertices could greatly filter no-result edge queries and improve the relation search performance. Out method also reduce the redundant I/O access over disk wi

关键词： big data

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：