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

arXiv 2023年

作者： An, Wenbin Shi, Wenkai Tian, Feng Lin, Haonan Wang, QianYing Wu, Yaqiang Cai, Mingxiang Wang, Luyan Chen, Yan Zhu, Haiping Chen, Ping School of Automation Science and Engineering Xi’an Jiaotong University China School of Computer Science and Technology Xi’an Jiaotong University China Ministry of Education Key Laboratory of Intelligent Networks and Network Security China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering China Lenovo Research China University of Massachusetts Boston United States

Generalized Category Discovery (GCD) is a crucial task that aims to recognize both known and novel categories from a set of unlabeled data by utilizing a few labeled data with only known categories. Due to the lack of supervision and category information, current methods usually perform poorly on novel categories and struggle to reveal semantic meanings of the discovered clusters, which limits their applications in the real world. To mitigate the above issues, we propose Loop, an end-to-end active-learning framework that introduces Large Language Models (LLMs) 1 into the training loop, which can boost model performance and generate category names without relying on any human efforts. Specifically, we first propose Local Inconsistent Sampling (LIS) to select samples that have a higher probability of falling to wrong clusters, based on neighborhood prediction consistency and entropy of cluster assignment probabilities. Then we propose a Scalable Query strategy to allow LLMs to choose true neighbors of the selected samples from multiple candidate samples. Based on the feedback from LLMs, we perform Refined Neighborhood Contrastive Learning (RNCL) to pull samples and their neighbors closer to learn clustering-friendly representations. Finally, we select representative samples from clusters corresponding to novel categories to allow LLMs to generate category names for them. Extensive experiments on three benchmark datasets show that Loop outperforms SOTA models by a large margin and generates accurate category names for the discovered clusters. Code and data are available at https://***/Lackel/LOOP. Copyright © 2023, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Local anatomy for personalised privacy protection

引用

International Journal of Information and Computer Security 2021年第2-3期15卷 254-271页

作者： Li, Boyu Liu, Yanheng Wang, Minghai Sun, Geng Li, Bin College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun China Big Data and Network Management Center Jilin University Changchun China College of Mathematics Jilin University Changchun China

Anonymisation technique has been extensively studied and widely applied for privacy-preserving data publishing. However, most existing methods ignore personal anonymity requirements. In these approaches, the microdata consist of three categories of attribute: explicit-identifier, quasi-identifier and sensitive attribute. In fact, the data sensitivity should be determined by individuals. An attribute is semi-sensitive if it contains both QI and sensitive values. In this paper, we propose a novel anonymisation approach, called local anatomy, to address personalised privacy protection. Local anatomy partitions the tuples who consider the value as sensitive into buckets inside each attribute. We conduct some experiments to illustrate that local anatomy can protect all the sensitive values and preserve great information utility. Additionally, we also present the concept of intelligent anonymisation system as our direction of future work. © 2021 Inderscience Enterprises Ltd.

关键词： Sensitive data

来源：评论

学校读者我要写书评

暂无评论

Unsupervised statistical text simplification using pre-trained language modeling for initialization

引用

Frontiers of Computer Science 2023年第01期17卷 171303-171303页

作者： QIANG Jipeng ZHANG Feng LI Yun YUAN Yunhao ZHU Yi WU Xindong Department of Computer Science Yangzhou University Yangzhou 225127 China Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education Hefei 23009 China Mininglamp Academy of Sciences Mininglamp Beijing 100089 China

Unsupervised text simplification has attracted much attention due to the scarcity of high-quality parallel text simplification corpora. Recent an unsupervised statistical text simplification based on phrase-based machine translation system (UnsupPBMT) achieved good performance, which initializes the phrase tables using the similar words obtained by word embedding modeling. Since word embedding modeling only considers the relevance between words, the phrase table in UnsupPBMT contains a lot of dissimilar words. In this paper, we propose an unsupervised statistical text simplification using pre-trained language modeling BERT for initialization. Specifically, we use BERT as a general linguistic knowledge base for predicting similar words. Experimental results show that our method outperforms the state-of-the-art unsupervised text simplification methods on three benchmarks, even outperforms some supervised baselines.

关键词： text simplification pre-trained language modeling BERT word embeddings

来源：评论

学校读者我要写书评

暂无评论

A Heuristic Sampling Method for Maintaining the Probability Distribution

引用

Journal of Computer Science & Technology 2021年第4期36卷 896-909页

作者： Jiao-Yun Yang Jun-Da Wang Yi-Fang Zhang Wen-Juan Cheng Lian Li Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education Hefei University of Technology Hefei 230601China National Smart EldeTca/re International Science and Technology Coopemtion Base Hefei University of Technology Hefei 230601China School of Computer Science and Information Engirwering Hefei University of TechnologyHefei 230601China School of Mathematics Hefei University of TechnologyHefei 230601China

Sampling is a fundamental method for generating data *** many data analysis methods are developed based on probability distributions,maintaining distributions when sampling can help to ensure good data analysis ***,sampling a minimum subset while maintaining probability distributions is still a *** this paper,we decompose a joint probability distribution into a product of conditional probabilities based on Bayesian networks and use the chi-square test to formulate a sampling problem that requires that the sampled subset pass the distribution test to ensure the ***,a heuristic sampling algorithm is proposed to generate the required subset by designing two scoring functions:one based on the chi-square test and the other based on likelihood *** on four types of datasets with a size of 60000 show that when the significant difference level,a,is set to 0.05,the algorithm can exclude 99.9%,99.0%,93.1%and 96.7%of the samples based on their Bayesian networks-ASIA,ALARM,HEPAR2,and ANDES,*** subsets of the same size are sampled,the subset generated by our algorithm passes all the distribution tests and the average distribution difference is approximately 0.03;by contrast,the subsets generated by random sampling pass only 83.8%of the tests,and the average distribution difference is approximately 0.24.

关键词： Bayesian network chi-square test sampling probability distribution

来源：评论

学校读者我要写书评

暂无评论

Evaluation of China's Digital Economy: A Case Study using Entropy and TOPSIS 11

Evaluation of China's Digital Economy: A Case Study using En...

引用

11th International Conference on Information Technology and Quantitative Management, ITQM 2024

作者： Liu, Junjie Wang, Boya Xue, Jiayu Qu, Yi Shi, Yong Sino-Danish College University of Chinese Academy of Sciences Beijing100049 China Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China Faculty of Science and Engineering University of Nottingham Ningbo China Zhejiang Ningbo315100 China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing101408 China School of Economics and Management University of Chinese Academy of Sciences Beijing100190 China College of Information Science and Technology University of Nebraska at Omaha OmahaNE68182 United States

Recently, digital economy in social science has become increasingly significant. A well-constructed evaluation structure could generally and promptly describe and reveal its overall social digitalization development. Building on existent researches, this paper improves the evaluation system, which comprises four first-level indicators and thirty-one second-level indicators. Notably, this paper innovatively incorporates higher education into digital innovation of the evaluation. The Entropy method is utilized to assign weights to various indicators in an objective way, with employing the TOPSIS approach to prioritize the development of digital economy in places based on the closeness to the ideal solution. By analysing related data related from 31 provinces in China between 2017 to 2021, this paper greatly finds: Firstly, the development of digital economy vary significantly across provinces, with most provinces at a relatively poor level, indicating considerable potential for overall growth;Secondly, Guangdong, Jiangsu, Zhejiang, and Shandong consistently ranked in the top four from 2017 to 2021, reflecting their specific development attributes and their emphasis on digital economy;Thirdly, significant disparities exist both between regions and among provinces. Consequently, this paper suggests establishing a comprehensive national digital economy development plan, formulating region-specific digital economy policies tailored to local conditions, and encouraging leading provinces to actively share experiences with other provinces. © 2024 The Authors.

关键词： Digital economy Evaluation Multi-source information TOPSIS

来源：评论

学校读者我要写书评

暂无评论

DRAG: Dynamic Region-Aware GCN for Privacy-Leaking Image Detection

arXiv

引用

arXiv 2022年

作者： Yang, Guang Cao, Juan Sheng, Qiang Qi, Peng Li, Xirong Li, Jintao Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China China

The daily practice of sharing images on social media raises a severe issue about privacy leakage. To address the issue, privacy-leaking image detection is studied recently, with the goal to automatically identify images that may leak privacy. Recent advance on this task benefits from focusing on crucial objects via pretrained object detectors and modeling their correlation. However, these methods have two limitations: 1) they neglect other important elements like scenes, textures, and objects beyond the capacity of pretrained object detectors;2) the correlation among objects is fixed, but a fixed correlation is not appropriate for all the images. To overcome the limitations, we propose the Dynamic Region-Aware Graph Convolutional Network (DRAG) that dynamically finds out crucial regions including objects and other important elements, and models their correlation adaptively for each input image. To find out crucial regions, we cluster spatially-correlated feature channels into several region-aware feature maps. Further, we dynamically model the correlation with the self-attention mechanism and explore the interaction among the regions with a graph convolutional network. The DRAG achieved an accuracy of 87% on the largest dataset for privacy-leaking image detection, which is 10 percentage points higher than the state of the art. The further case study demonstrates that it found out crucial regions containing not only objects but other important elements like textures. The code and more details are in https://***/guang-yanng/DRAG. © 2022, CC BY.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Delving Globally into Texture and Structure for Image Inpainting

arXiv

引用

arXiv 2022年

作者： Liu, Haipeng Wang, Yang Wang, Meng Rui, Yong School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Hefei China Lenovo Research Beijing China

Image inpainting has achieved remarkable progress and inspired abundant methods, where the critical bottleneck is identified as how to fulfill the high-frequency structure and low-frequency texture information on the masked regions with semantics. To this end, deep models exhibit powerful superiority to capture them, yet constrained on the local spatial regions. In this paper, we delve globally into texture and structure information to well capture the semantics for image inpainting. As opposed to the existing arts trapped on the independent local patches, the texture information of each patch is reconstructed from all other patches across the whole image, to match the coarsely filled information, especially the structure information over the masked regions. Unlike the current decoder-only transformer within the pixel level for image inpainting, our model adopts the transformer pipeline paired with both encoder and decoder. On one hand, the encoder captures the texture semantic correlations of all patches across image via self-attention module. On the other hand, an adaptive patch vocabulary is dynamically established in the decoder for the filled patches over the masked regions. Building on this, a structure-texture matching attention module anchored on the known regions comes up to marry the best of these two worlds for progressive inpainting via a probabilistic diffusion process. Our model is orthogonal to the fashionable arts, such as Convolutional Neural Networks (CNNs), Attention and Transformer model, from the perspective of texture and structure information for image inpainting. The extensive experiments over the benchmarks validate its superiority. Our code is available here. Copyright © 2022, The Authors. All rights reserved.

关键词： Textures

来源：评论

学校读者我要写书评

暂无评论

SHLE: Devices Tracking and Depth Filtering for Stereo-based Height Limit Estimation

arXiv

引用

arXiv 2022年

作者： Fan, Zhaoxin Yang, Kaixing Zhang, Min Song, Zhenbo Liu, Hongyan He, Jun Key Laboratory of Data Engineering and Knowledge Engineering of MOE School of Information Renmin University of China Beijing100872 China School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Department of Management Science and Engineering Tsinghua University Beijing100084 China

Recently, over-height vehicle strike frequently occurs, causing great economic cost and serious safety problems. Hence, an alert system which can accurately discover any possible height limiting devices in advance is necessary to be employed in modern large or medium sized cars, such as touring cars. Detecting and estimating the height limiting devices act as the key point of a successful height limit alert system. Though there are some works research height limit estimation, existing methods are either too computational expensive or not accurate enough. In this paper, we propose a novel stereo-based pipeline named SHLE for height limit estimation. Our SHLE pipeline consists of two stages. In stage 1, a novel devices detection and tracking scheme is introduced, which accurately locate the height limit devices in the left or right image. Then, in stage 2, the depth is temporally measured, extracted and filtered to calculate the height limit device. To benchmark the height limit estimation task, we build a large-scale dataset named "Disparity Height", where stereo images, pre-computed disparities and ground-truth height limit annotations are provided. We conducted extensive experiments on "Disparity Height" and the results show that SHLE achieves an average error below than 10cm though the car is 70m away from the devices. Our method also outperforms all compared baselines and achieves state-of-the-art performance. Code is available at https://***/Yang-Kaixing/SHLE. Copyright © 2022, The Authors. All rights reserved.

关键词： Pipelines

来源：评论

学校读者我要写书评

暂无评论

SoAy: A Solution-based LLM API-using Methodology for Academic Information Seeking 25

SoAy: A Solution-based LLM API-using Methodology for Academi...

引用

Proceedings of the 31st ACM SIGKDD Conference on knowledge Discovery and data Mining V.1

作者： Yuanchun Wang Jifan Yu Zijun Yao Jing Zhang Yuyang Xie Shangqing Tu Yiyang Fu Youhe Feng Jinkai Zhang Jingyao Zhang Bowen Huang Yuanyao Li Huihui Yuan Lei Hou Juanzi Li Jie Tang School of Information Renmin University of China Beijing China & Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing China Institute of Education Tsinghua University Beijing China Department of Computer Science and Technology Tsinghua University Beijing China School of Information Renmin University of China Beijing China & Engineering Research Center of Database and Business Intelligence MOE Beijing China School of Information Renmin University of China Beijing China Zhipu AI Beijing China

ISBN: (纸本)9798400712456

Applying large language models (LLMs) to academic API usage shows promise in reducing researchers' efforts to seek academic information. However, current LLM methods for using APIs struggle with the complex API coupling commonly encountered in academic queries. To address this, we introduce SoAy, a solution-based LLM methodology for academic information seeking. SoAy enables LLMs to generate code for invoking APIs, guided by a pre-constructed API calling sequence referred to as a solution. This solution simplifies the model's understanding of complex API relationships, while the generated code enhances reasoning efficiency. LLMs are aligned with this solution-oriented, code-based reasoning method by automatically enumerating valid API coupling sequences and transforming them into queries and executable *** evaluate SoAy, we introduce SoAyBench, an evaluation benchmark accompanied by SoAyEval, built upon a cloned environment of APIs from AMiner. Experimental results demonstrate a 34.58-75.99% performance improvement compared to state-of-the-art LLM API-based baselines. All datasets, codes, tuned models, and deployed online services are publicly accessible at https://***/RUCKBReasoning/SoAy.

关键词： academic information seeking

来源：评论

学校读者我要写书评

暂无评论

Joint-Motion Mutual Learning for Pose Estimation in Videos

arXiv

引用

arXiv 2024年

作者： Wu, Sifan Chen, Haipeng Yin, Yifang Hu, Sihao Feng, Runyang Jiao, Yingying Yang, Ziqi Liu, Zhenguang College of Computer Science and Technology Jilin University Changchun China A*STAR Singapore Georgia Institute of Technology Atlanta United States School of Artificial Intelligence Jilin University Changchun China The State Key Laboratory of Blockchain and Data Security Zhejiang University Hangzhou China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China Institute of Blockchain and Data Security Hangzhou China

Human pose estimation in videos has long been a compelling yet challenging task within the realm of computer vision. Nevertheless, this task remains difficult because of the complex video scenes, such as video defocus and self-occlusion. Recent methods strive to integrate multi-frame visual features generated by a backbone network for pose estimation. However, they often ignore the useful joint information encoded in the initial heatmap, which is a byproduct of the backbone generation. Comparatively, methods that attempt to refine the initial heatmap fail to consider any spatiotemporal motion features. As a result, the performance of existing methods for pose estimation falls short due to the lack of ability to leverage both local joint (heatmap) information and global motion (feature) dynamics. To address this problem, we propose a novel joint-motion mutual learning framework for pose estimation, which effectively concentrates on both local joint dependency and global pixel-level motion dynamics. Specifically, we introduce a context-aware joint learner that adaptively leverages initial heatmaps and motion flow to retrieve robust local joint feature. Given that local joint feature and global motion flow are complementary, we further propose a progressive joint-motion mutual learning that synergistically exchanges information and interactively learns between joint feature and motion flow to improve the capability of the model. More importantly, to capture more diverse joint and motion cues, we theoretically analyze and propose an information orthogonality objective to avoid learning redundant information from multi-cues. Empirical experiments show our method outperforms prior arts on three challenging benchmarks. Copyright © 2024, The Authors. All rights reserved.

关键词： Motion estimation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：