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

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

来源：评论

学校读者我要写书评

暂无评论

Short Text Topic Modeling Techniques, Applications, and Performance: A Survey

引用

IEEE Transactions on knowledge and data engineering 2022年第3期34卷 1427-1445页

作者： Qiang, Jipeng Qian, Zhenyu Li, Yun Yuan, Yunhao Wu, Xindong Department of Computer Science Yangzhou University Jiangsu225009 China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Hefei Anhui230026 China Mininglamp Academy of Sciences Minininglamp Beijing China

Analyzing short texts infers discriminative and coherent latent topics that is a critical and fundamental task since many real-world applications require semantic understanding of short texts. Traditional long text topic modeling algorithms (e.g., PLSA and LDA) based on word co-occurrences cannot solve this problem very well since only very limited word co-occurrence information is available in short texts. Therefore, short text topic modeling has already attracted much attention from the machine learning research community in recent years, which aims at overcoming the problem of sparseness in short texts. In this survey, we conduct a comprehensive review of various short text topic modeling techniques proposed in the literature. We present three categories of methods based on Dirichlet multinomial mixture, global word co-occurrences, and self-aggregation, with example of representative approaches in each category and analysis of their performance on various tasks. We develop the first comprehensive open-source library, called STTM, for use in Java that integrates all surveyed algorithms within a unified interface, benchmark datasets, to facilitate the expansion of new methods in this research field. Finally, we evaluate these state-of-the-art methods on many real-world datasets and compare their performance against one another and versus long text topic modeling algorithm. © 2020 IEEE.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Alignment-enhanced Adaptive Grounding Network for Generalized Referring Expression Comprehension 39

Hierarchical Alignment-enhanced Adaptive Grounding Network f...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Wang, Yaxian Ding, Henghui He, Shuting Jiang, Xudong Wei, Bifan Liu, Jun School of Computer Science and Technology Xi'an Jiaotong University China Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi'an Jiaotong University China Institute of Big Data Fudan University China Shanghai University of Finance and Economics China Nanyang Technological University Singapore School of Continuing Education Xi'an Jiaotong University China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University China

ISBN: (纸本)157735897X

In this work, we address the challenging task of Generalized Referring Expression Comprehension (GREC). Compared to the classic Referring Expression Comprehension (REC) that focuses on single-target expressions, GREC extends the scope to a more practical setting by further encompassing no-target and multi-target expressions. Existing REC methods face challenges in handling the complex cases encountered in GREC, primarily due to their fixed output and limitations in multi-modal representations. To address these issues, we propose a Hierarchical Alignment-enhanced Adaptive Grounding Network (HieA2G) for GREC, which can flexibly deal with various types of referring expressions. First, a Hierarchical Multi-modal Semantic Alignment (HMSA) module is proposed to incorporate three levels of alignments, including word-object, phrase-object, and text-image alignment. It enables hierarchical cross-modal interactions across multiple levels to achieve comprehensive and robust multi-modal understanding, greatly enhancing grounding ability for complex cases. Then, to address the varying number of target objects in GREC, we introduce an Adaptive Grounding Counter (AGC) to dynamically determine the number of output targets. Additionally, an auxiliary contrastive loss is employed in AGC to enhance object-counting ability by pulling in multi-modal features with the same counting and pushing away those with different counting. Extensive experimental results show that HieA2G achieves new state-of-the-art performance on the challenging GREC task and also the other 4 tasks, including REC, Phrase Grounding, Referring Expression Segmentation (RES), and Generalized Referring Expression Segmentation (GRES), demonstrating the remarkable superiority and generalizability of the proposed HieA2G. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Modal analysis

来源：评论

学校读者我要写书评

暂无评论

Stable Learning via Triplex Learning

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第10期5卷 5267-5276页

作者： Yang, Shuai Jiang, Tingting Dang, Qianlong Gu, Lichuan Wu, Xindong Anhui Agricultural University School of Information and Artificial Intelligence Hefei230036 China Anhui Provincial Engineering Research Center for Agricultural Information Perception and Intelligent Computing Hefei230036 China Northwest A & F University College of Science Yangling712100 China Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China Hefei230601 China Hefei University of Technology School of Computer Science and Information Engineering Hefei230601 China

Stable learning aims to learn a model that generalizes well to arbitrary unseen target domain by leveraging a single source domain. Recent advances in stable learning have focused on balancing the distribution of confounders for each feature to eliminate spurious correlations. However, previous studies treat all features equally without considering the difficulties of confounder balancing associated with different features, and regard irrelevant features as confounders, deteriorating generalization performance. To tackle these issues, this article proposes a novel triplex learning (TriL) based stable learning algorithm, which performs sample reweighting, causal feature selection, and representation learning to remove spurious correlations. Specifically, first, TriL adaptively assigns weights to the confounder balancing term of each feature in accordance with the difficulties of confounder balancing, and aligns the confounder distribution of each feature by learning a group of sample weights. Second, TriL integrates the sample weights into a weighted cross-entropy model to compute causal effects of features for excluding irrelevant features from the confounder set. Finally, TriL relearns a set of sample weights and uses them to guide a new supervised dual-autoencoder containing two classifiers to learn feature representations. TriL forces the results of two classifiers to remain consistent for removing spurious correlations by using a cross-classifier consistency regularization. Extensive experiments on synthetic and two real-world datasets show the superiority of TriL compared with seven methods. © 2024 IEEE.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

Gender Disparity in Expressed Emotions within Health-Related Online Support Groups

引用

Proceedings of the Association for Information Science and Technology 2021年第1期58卷 883-885页

作者： Zhao, Yuehua Wang, Hao Deng, Sanhong Chen, Ye Nanjing University Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing China Central China Normal University Wuhan China

Online support groups offer a new way to users to communicate with others regarding certain health issues. Taking autism-related support groups on Facebook as an example, we examine whether the expressed emotions differ between female and male users in online health-related support groups and whether such gender disparity varied based on the topics of the groups. Experimental results reveal a significant gender difference of expressed emotions in the groups. We find that female users tended to express more positive emotions in the group discussions than the male group members did. In addition, users appeared to express different sentiments within the groups focused on various topics. Male users tend to convey more negative emotions in the group that related to treatment, while female users were more positive when posted in the research-related group than male users were. This study is beneficial for tracking and moderating the emotional environment in online support groups. 84 Annual Meeting of the Association for Information Science & Technology | Oct. 29 – Nov. 3, 2021 | Salt Lake City, UT. Author(s) retain copyright, but ASIS&T receives an exclusive publication license.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

RPR-Net: A Point Cloud-Based Rotation-Aware Large Scale Place Recognition Network 1

引用

17th European Conference on Computer Vision, ECCV 2022

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

ISBN: (数字)9783031250569

ISBN: (纸本)9783031250552

Point cloud-based large scale place recognition is an important but challenging task for many applications such as Simultaneous Localization and Mapping (SLAM). Taking the task as a point cloud retrieval problem, previous methods have made delightful achievements. However, how to deal with catastrophic collapse caused by rotation problems is still under-explored. In this paper, to tackle the issue, we propose a novel Point Cloud-based Rotation-aware Large Scale Place Recognition Network (RPR-Net). In particular, to solve the problem, we propose to learn rotation-invariant features in three steps. First, we design three kinds of novel Rotation-Invariant Features (RIFs), which are low-level features that can hold the rotation-invariant property. Second, using these RIFs, we design an attentive module to learn rotation-invariant kernels. Third, we apply these kernels to previous point cloud features to generate new features, which is the well-known SO(3) mapping process. By doing so, high-level scene-specific rotation-invariant features can be learned. We call the above process an Attentive Rotation-Invariant Convolution (ARIConv). To achieve the place recognition goal, we build RPR-Net, which takes ARIConv as a basic unit to construct a dense network architecture. Then, powerful global descriptors used for retrieval-based place recognition can be sufficiently extracted from RPR-Net. Experimental results on prevalent datasets show that our method achieves comparable results to existing state-of-the-art place recognition models and significantly outperforms other rotation-invariant baseline models when solving rotation problems. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Joint-Motion Mutual Learning for Pose Estimation in Video 24

Joint-Motion Mutual Learning for Pose Estimation in Video

引用

32nd ACM International Conference on Multimedia, MM 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 Singapore Georgia Institute of Technology AtlantaGA 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 of Ministry of Education Jilin University Changchun China Institute of Blockchain and Data Security Hangzhou China

ISBN: (纸本)9798400706868

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 by-product of the backbone generation. Comparatively, methods that attempt to refine the initial heatmap fail to consider any spatio-temporal 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. © 2024 ACM.

关键词： Motion estimation

来源：评论

学校读者我要写书评

暂无评论

Segment-Adaptive Spread Spectrum Audio Watermarking Using NSGA-Ⅱ

引用

Chinese Journal of Electronics 2021年第4期30卷 727-735页

作者： SU Zhaopin ZHANG Guofu ZHOU Xianxian LI Wangwang Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei University of Technology

In the field of robust audio watermarking,how to seek a good trade-off between robustness and imperceptibility is challenging. The existing studies use the same embedding parameter for each part of the audio signal, which ignores that different parts may have different requirements for embedding parameters. In this work, the constraints on imperceptibility are first ***, we present a segment multi-objective optimization model of the scaling parameter under the constrained Signal-to-noise ratio(SNR) in Spread spectrum(SS)audio watermarking. Additionally, we adopt the Nondominated sorting genetic algorithm Ⅱ(NSGA-Ⅱ) to solve the proposed model. Finally, we compare our algorithm(called SS-SNR-NSGA-Ⅱ) with the existing methods. The experimental results show that the proposed SS-SNRNSGA-Ⅱ not only provides flexible choices for different application demands but also achieves more and better trade-offs between imperceptibility and robustness.

关键词： Spread spectrum audio watermarking Scaling parameter Segment Constrained SNR NSGA-Ⅱ

来源：评论

学校读者我要写书评

暂无评论

How to Mitigate Information Loss in knowledge Graphs for GraphRAG: Leveraging Triple Context Restoration and Query-Driven Feedback

arXiv

引用

arXiv 2025年

作者： Huang, Manzong Bu, Chenyang He, Yi Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data [Hefei University of Technology Ministry of Education China School of Data Science William & Mary WilliamsburgVA United States

knowledge Graph (KG)-augmented Large Language Models (LLMs) have recently propelled significant advances in complex reasoning tasks, thanks to their broad domain knowledge and contextual awareness. Unfortunately, current methods often assume KGs to be complete, which is impractical given the inherent limitations of KG construction and the potential loss of contextual cues when converting unstructured text into entity-relation triples. In response, this paper proposes the Triple Context Restoration and Query-driven Feedback (TCR-QF) framework, which reconstructs the textual context underlying each triple to mitigate information loss, while dynamically refining the KG structure by iteratively incorporating query-relevant missing knowledge. Experiments on five benchmark question-answering datasets substantiate the effectiveness of TCR-QF in KG and LLM integration, where it achieves a 29.1% improvement in Exact Match and a 15.5% improvement in F1 over its state-of-the-art GraphRAG competitors. © 2025, CC BY.

关键词： knowledge graph

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：