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

International Conference on data engineering

作者： Xiaokun Fang Feng Zhang Junxiang Nong Mingxing Zhang Puyun Hu Yunpeng Chai Xiaoyong Du Key Laboratory of Data Engineering and Knowledge Engineering (MOE) and School of Information Renmin University of China Department of Computer Science and Engineering Tsinghua University

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

Text analytics directly on compression (TADOC) is a promising technology designed for handling big data analytics. However, a substantial amount of DRAM is required for high performance, which limits its usage in many important scenarios where the capacity of DRAM is limited, such as memory-constrained systems. Non-volatile memory (NVM) is a novel storage technology that combines the advantage of reading per-formance and byte addressability of DRAM with the durability of traditional storage devices like SSD and HDD. Unfortunately, no research demonstrates how to use NVM to reduce DRAM utilization in compressed data analytics. In this paper, we propose N-TADOC, which substitutes DRAM with NVM while maintaining TADOC's analytics performance and space savings. Utilizing an NVM block device to reduce DRAM utilization presents two challenges, including poor data locality in traversing datasets and auxiliary data structure reconstruction on NVM. We develop novel designs to solve these challenges, including a pruning method with NVM pool management, bottom-up upper bound estimation, correspondent data structures, and persistence strategy at different levels of cost. Experimental results show that on four real-world datasets, N-TADOC achieves 2.04× performance speedup compared to the processing directly on the uncompressed data and 70.7% DRAM space saving compared to the original TADOC.

关键词： Performance evaluation Upper bound data analysis Costs Nonvolatile memory Random access memory Estimation

来源：评论

学校读者我要写书评

暂无评论

Dynamic Scaling of Unit Tests for Code Reward Modeling

arXiv

引用

arXiv 2025年

作者： Ma, Zeyao Zhang, Xiaokang Zhang, Jing Yu, Jifan Luo, Sijia Tang, Jie School of Information Renmin University of China China Tsinghua University China Key Laboratory of Data Engineering and Knowledge Engineering Beijing China

Current large language models (LLMs) often struggle to produce accurate solutions on the first attempt for code generation. Prior research tackles this challenge by generating multiple candidate solutions and validating them with LLM-generated unit tests. The execution results of unit tests serve as reward signals to identify correct solutions. As LLMs always confidently make mistakes, these unit tests are not reliable, thereby diminishing the quality of reward signals. Motivated by the observation that scaling the number of solutions improves LLM performance, we explore the impact of scaling unit tests to enhance reward signal quality. Our pioneer experiment reveals a positive correlation between the number of unit tests and reward signal quality, with greater benefits observed in more challenging problems. Based on these insights, we propose CodeRM-8B, a lightweight yet effective unit test generator that enables efficient and high-quality unit test scaling. Additionally, we implement a dynamic scaling mechanism that adapts the number of unit tests based on problem difficulty, further improving efficiency. Experimental results show that our approach significantly improves performance across various models on three benchmarks (e.g., with gains of 18.43% for Llama3-8B and 3.42% for GPT-4o-mini on HumanEval Plus). © 2025, CC BY-SA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fair Personalized Learner Modeling Without Sensitive Attributes 25

Fair Personalized Learner Modeling Without Sensitive Attribu...

引用

34th ACM Web Conference, WWW 2025

作者： Xu, Hefei Hou, Min Wu, Le Liu, Fei Yang, Yonghui Bai, Haoyue Hong, Richang Wang, Meng Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Anhui Hefei China Institute of Dataspace Hefei Comprehensive National Science Center Anhui Hefei China

ISBN: (纸本)9798400712746

Personalized learner modeling uses learners’ historical behavior data to diagnose their cognitive abilities, a process known as Cognitive Diagnosis (CD). This is essential for web-based learning services such as learning resource recommendation and adaptive testing. However, prior studies have shown that CD models may unfairly correlate learners’ abilities with sensitive attributes (e.g., gender, region), leading to biased outcomes. While existing approaches mitigate this issue by decorrelating sensitive attributes from the modeling process, privacy concerns make collecting such attributes impractical. Furthermore, the presence of multiple sensitive attributes complicates fairness improvements. In this paper, we explore how to achieve fair personalized learner modeling without relying on any sensitive attribute input. We introduce a novel fairness objective tailored for personalized learner modeling and design a max-min strategy to facilitate both sensitive information inference and fair CD modeling. In the max step, we infer pseudo-labels by maximizing the fairness objective, while in the min step, we retrain the CD model by minimizing it. Additionally, we provide a theoretical guarantee that our framework reduces the upper bound of fairness generalization error. Extensive experiments demonstrate that the proposed framework significantly outperforms existing methods. © 2025 Copyright held by the owner/author(s).

关键词： Supervised learning

来源：评论

学校读者我要写书评

暂无评论

CITE: Compact Interactive TransformEr for Multilingual Image Captioning 23

CITE: Compact Interactive TransformEr for Multilingual Image...

引用

6th International Conference on Image and Graphics Processing, ICIGP 2023

作者： Xu, Yueyuan Hu, Zhenzhen Zhou, Yuanen Hao, Shijie Hong, Richang Key Laboratory of Knowledge Engineering with Big Data School of Computer and Information Hefei University of Technology China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Hefei China

ISBN: (纸本)9781450398572

Current state-of-the-art image captioning models generate captions in a single language, requiring a combination of multiple language specific models to build a multilingual image captioning system. However, as the number of supported languages increases, it leads to the parameters of the multilingual image captioning system grow linearly. To tackle this issue, we propose a single Compact Interactive TransformEr (CITE) model, which can describe an image in multiple languages simultaneously, making the captioning system more compact. Specifically, based on the standard Transformer model, we share the encoder and decoder backbone parameters and replace the self-attention sub-layer in the decoder with the interactive attention sub-layer. In addition, we extend the traditional monolingual reinforcement learning mechanism to a multilingual version to promote better description generation. Due to the wide use of Chinese and English, we evaluate the performance of our CITE model by simultaneously generating English and Chinese captions. We expand the image captions of the whole MSCOCO dataset and release a COCO-EN-CN dataset. Extensive experiments on the COCO-EN-CN dataset show that our single CITE model with more parameter-efficient can maintain the competitive performance or even better than the monolingual captioning models. © 2023 ACM.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Automatic Fusion for Multimodal Entity Alignment: A New Perspective from Automatic Architecture Search

Automatic Fusion for Multimodal Entity Alignment: A New Pers...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Chenyang Bu Yunpeng Hong Shiji Zang Guojie Chang Xindong Wu Key Laboratory of Knowledge Engineering With Big Data (the Ministry of Education of China) School of Computer Science and Engineering HeFei University of Technology

ISBN: (数字)9798350390155

ISBN: (纸本)9798350390162

Integrating multimodal data from diverse sources is crucial for enhancing various applications. Multimodal entity alignment (MMEA), which discovers equivalent entities across different sources and modalities, aims to eliminate data silos for comprehensive integration. A key challenge in MMEA is effectively fusing vector representations from different modalities of the same entity for optimal entity matching. Existing fusion methods involve individual fusion operators (e.g., concatenation and summation) or the manual design of complex network structures, incurring significant human resource costs. In this paper, for the first time, we introduce the research question of automatic fusion for MMEA and propose an efficient approach from the perspective of automated architecture search. Experimental comparisons with state-of-the-art methods on real-world datasets demonstrate the effectiveness of the proposed approach.

关键词： Costs Search methods Complex networks Vectors

来源：评论

学校读者我要写书评

暂无评论

A Symbolic Rule Integration Framework with Logic Transformer for Inductive Relation Prediction 24

A Symbolic Rule Integration Framework with Logic Transformer...

引用

33rd ACM Web Conference, WWW 2024

作者： Pan, Yudai Liu, Jun Zhao, Tianzhe Zhang, Lingling Lin, Yun Dong, Jin Song School of Computer Science and Technology Xi'an Jiaotong University Shaanxi Xi'an China National Engineering Lab for Big Data Analytics Xi'an Jiaotong University Shaanxi Xi'an China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Shaanxi Xi'an China Shanghai Jiao Tong University Shanghai China National University of Singapore Singapore Singapore

ISBN: (纸本)9798400701719

Relation prediction in knowledge graphs (KGs) aims at predicting missing relations in incomplete triples, whereas the dominant paradigm by KG embeddings has a limitation to predict the relation between unseen entities. This situation is called an inductive setting, which is more common in the real-world scenario. To handle this issue, implicit symbolic rules have shown great potential in capturing the inductive capability. However, it is still challenging to obtain precise representations of logic rules from KGs. The argument variability and predicate non-commutativity in symbolic rule integration make the modeling of component symbols difficult. To this end, we propose a novel inductive relation prediction model named SymRITa with a logic transformer integrating rules. SymRITa firstly extracts the subgraph, whose embeddings are captured by a graph network. Meanwhile, symbolic rule graphs in the subgraph can be generated. Then, the symbolic rules are modeled by a proposed logic transformer. Specifically, the input format based on the subgraph-based embeddings is to focus on the argument variability in symbolic rules. In addition, a conjunction attention mechanism in the logic transformer can resolve predicate non-commutativity in the symbolic rule integration process. Finally, the subgraph-based and symbol-based embeddings obtained from the previous steps are combined for the training regime, and prediction results as well as rules explaining the reasoning process are explicitly output. Extensive experiments on twelve inductive datasets show that SymRITa achieves outstanding effectiveness compared to state-of-the-art inductive baselines. Moreover, the logic rules with corresponding confidences provide an interpretable paradigm. © 2024 ACM.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Context-Aware Semantic Type Identification for Relational Attributes

引用

Journal of Computer Science & Technology 2023年第4期38卷 927-946页

作者：丁玥郭雨荷卢卫李海翔张美慧李晖潘安群杜小勇 Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education Renmin University of China Beijing 100872China School of Information Renmin University of ChinaBeijing 100872China Tencent(Beijing)Technology Company Limited Beijing 100080China School of Computer Science and Technology Beijing Institute of TechnologyBeijing 100081China College of Computer Science and Technology Guizhou UniversityGuiyang 550025China Tencent(Shenzhen)Technology Company Limited Shenzhen 518057China

Identifying semantic types for attributes in relations,known as attribute semantic type(AST)identification,plays an important role in many data analysis tasks,such as data cleaning,schema matching,and keyword search in ***,due to a lack of unified naming standards across prevalent information systems(*** islands),AST identification still remains as an open *** tackle this problem,we propose a context-aware method to figure out the ASTs for relations in this *** transform the AST identification into a multi-class classification problem and propose a schema context aware(SCA)model to learn the representation from a collection of relations associated with attribute values and schema *** on the learned representation,we predict the AST for a given attribute from an underlying relation,wherein the predicted AST is mapped to one of the labeled *** improve the performance for AST identification,especially for the case that the predicted semantic types of attributes are not included in the labeled ASTs,we then introduce knowledge base embeddings(***)to enhance the above representation and construct a schema context aware model with knowledge base enhanced(SCA-KB)to get a stable and robust *** experiments based on real datasets demonstrate that our context-aware method outperforms the state-of-the-art approaches by a large margin,up to 6.14%and 25.17%in terms of macro average F1 score,and up to 0.28%and 9.56%in terms of weighted F1 score over high-quality and low-quality datasets respectively.

关键词： attribute semantic type(AST)identification context-aware semantic embedding knowledge base embedding

来源：评论

学校读者我要写书评

暂无评论

Partial Label Feature Selection: An Adaptive Approach

引用

IEEE Transactions on knowledge and data engineering 2024年第8期36卷 4178-4191页

作者： Zan Zhang Jialu Yao Lin Liu Jiuyong Li Lei Li Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei Anhui China School of Computer Science and Information Engineering Hefei University of Technology Hefei Anhui China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei Anhui China UniSA STEM University of South Australia Adelaide SA Australia Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) School of Computer Science and Information Engineering Hefei University of Technology Hefei Anhui China Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology Hefei Anhui China

As an emerging weakly supervised learning framework, partial label learning aims to induce a multi-class classifier from ambiguous supervision information where each training example is associated with a set of candidate labels, among which only one is the true label. Traditional feature selection methods, either for single label and multiple label problems, are not applicable to partial label learning as the ambiguous information contained in the label space obfuscates the importance of features and misleads the selection process. This makes the selection of a proper feature subset from partial label examples particularly challenging, and therefore has rarely been investigated. In this paper, we propose a novel feature selection algorithm for partial label learning, named PLFS, which considers not only the relationships between features and labels, but also exploits the relationships between instances to select the most informative and important features to enhance the performance of partial label learning. PLFS constructs an adaptive weighted graph to exploit the similarity information among instances, differentiate the label space and weight the feature space, which leads to the selection of a proper feature subset. Extensive experiments over a broad range of benchmark data sets clearly validate the effectiveness of our proposed feature selection approach.

关键词： Feature extraction Supervised learning Training knowledge engineering Labeling Classification algorithms Big data

来源：评论

学校读者我要写书评

暂无评论

Towards annotation-free evaluation of cross-lingual image captioning 2

Towards annotation-free evaluation of cross-lingual image ca...

引用

2nd ACM International Conference on Multimedia in Asia, MMAsia 2020

作者： Chen, Aozhu Huang, Xinyi Lin, Hailan Li, Xirong Moe Key Lab of Data Engineering and Knowledge Engineering Renmin University of China Beijing China

ISBN: (纸本)9781450383080

Cross-lingual image captioning, with its ability to caption an unlabeled image in a target language other than English, is an emerging topic in the multimedia field. In order to save the precious human resource from re-writing reference sentences per target language, in this paper we make a brave attempt towards annotation-free evaluation of cross-lingual image captioning. Depending on whether we assume the availability of English references, two scenarios are investigated. For the first scenario with the references available, we propose two metrics, i.e., WMDRel and CLinRel. WMDRel measures the semantic relevance between a model-generated caption and machine translation of an English reference using their Word Mover's Distance. By projecting both captions into a deep visual feature space, CLinRel is a visual-oriented cross-lingual relevance measure. As for the second scenario, which has zero reference and is thus more challenging, we propose CMedRel to compute a cross-media relevance between the generated caption and the image content, in the same visual feature space as used by CLinRel. We have conducted a number of experiments to evaluate the effectiveness of the three proposed metrics. The combination of WMDRel, CLinRel and CMedRel has a Spearman's rank correlation of 0.952 with the sum of BLEU-4, METEOR, ROUGE-L and CIDEr, four standard metrics computed using references in the target language. CMedRel alone has a Spearman's rank correlation of 0.786 with the standard metrics. The promising results show high potential of the new metrics for evaluation with no need of references in the target language. © 2021 ACM.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Mining Bytecode Features of Smart Contracts to Detect PonziScheme on Blockchain

引用

Computer Modeling in engineering & Sciences 2021年第6期127卷 1069-1085页

作者： Xiajiong Shen Shuaimin Jiang Lei Zhang Henan Key Laboratory of Big Data Analysis and Processing Henan UniversityKaifeng47500China Institute of Data and Knowledge Engineering Henan UniversityKaifeng47500China School of Computer and Information Engineering Henan UniversityKaifeng47500China

The emergence of smart contracts has increased the attention of industry and academia to blockchain technology,which is tamper-proofing,decentralized,autonomous,and enables decentralized applications to operate in untrustworthy ***,these features of this technology are also easily exploited by unscrupulous individuals,a typical example of which is the Ponzi scheme in *** negative effect of unscrupulous individuals writing Ponzi scheme-type smart contracts in Ethereum and then using these contracts to scam large amounts of money has been *** solve this problem,we propose a detection model for detecting Ponzi schemes in smart contracts using *** this model,our innovation is shown in two aspects:We first propose to use two bytes as one characteristic,which can quickly transform the bytecode into a high-dimensional matrix,and this matrix contains all the implied characteristics in the ***,We innovatively transformed the Ponzi schemes detection into an anomaly detection ***,an anomaly detection algorithm is used to identify Ponzi schemes in smart *** results show that the proposed detection model can greatly improve the accuracy of the detection of the Ponzi scheme ***,the F1-score of this model can reach 0.88,which is far better than those of other traditional detection models.

关键词： Ponzi scheme blockchain security smart contracts anomaly detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：