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

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Xing, Bowen Liao, Lizi Huang, Minlie Tsang, Ivor W. Beijing Key Laboratory of Knowledge Engineering for Materials Science School of Computer and Communication Engineering University of Science and Technology Beijing China Singapore Management University Singapore Group Tsinghua University China CFAR and IHPC Agency for Science Technology and Research Singapore College of Computing and Data Science Nanyang Technological University Singapore

ISBN: (纸本)9798891761643

In the realm of multi-intent spoken language understanding, recent advancements have leveraged the potential of prompt learning frameworks. However, critical gaps exist in these frameworks: the lack of explicit modeling of dual-task dependencies and the oversight of task-specific semantic differences among utterances. To address these shortcomings, we propose DC-Instruct, a novel generative framework based on Dual-task Inter-dependent Instructions (DII) and Supervised Contrastive Instructions (SCI). Specifically, DII guides large language models (LLMs) to generate labels for one task based on the other task's labels, thereby explicitly capturing dual-task inter-dependencies. Moreover, SCI leverages utterance semantics differences by guiding LLMs to determine whether a pair of utterances share the same or similar labels. This can improve LLMs on extracting and discriminating task-specific semantics, thus enhancing their SLU reasoning abilities. Extensive experiments on public benchmark datasets show that DC-Instruct markedly outperforms current generative models and state-of-the-art methods, demonstrating its effectiveness in enhancing dialogue language understanding and reasoning. © 2024 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

An effective scheme for top-k frequent itemset mining under differential privacy conditions

引用

Science China(Information Sciences) 2020年第5期63卷 200-202页

作者： Wenjuan LIANG Hong CHEN Jing ZHANG Dan ZHAO Cuiping LI Key Lab of Data Engineering and Knowledge Engineering of MOE Renmin University of China College of Computer and Information Engineering Henan University

Dear editor,Frequent itemset mining (FIM) is important in many data mining applications [1], such as web log mining and trend analysis. However, if the data are sensitive (e.g., web browsing history), directly releasing frequent itemsets and their support may breach user privacy. The protection of user privacy while obtaining statistical information is im-

关键词： An effective scheme for top-k frequent itemset mining under differential privacy conditions

来源：评论

学校读者我要写书评

暂无评论

Personalized Clustering via Targeted Representation Learning

arXiv

引用

arXiv 2024年

作者： Geng, Xiwen Zhao, Suyun Yu, Yixin Peng, Borui Du, Pan Chen, Hong Li, Cuiping Wang, Mengdie Key Lab of Data Engineering and Knowledge Engineering MOE Renmin University of China China School of Information Renmin University of China China School of Statistics Remin University of China China

Clustering traditionally aims to reveal a natural grouping structure within unlabeled data. However, this structure may not always align with users’ preferences. In this paper, we propose a personalized clustering method that explicitly performs targeted representation learning by interacting with users via modicum task information (e.g., must-link or cannot-link pairs) to guide the clustering direction. We query users with the most informative pairs, i.e., those pairs most hard to cluster and those most easy to miscluster, to facilitate the representation learning in terms of the clustering preference. Moreover, by exploiting attention mechanism, the targeted representation is learned and augmented. By leveraging the targeted representation and constrained contrastive loss as well, personalized clustering is obtained. Theoretically, we verify that the risk of personalized clustering is tightly bounded, guaranteeing that active queries to users do mitigate the clustering risk. Experimentally, extensive results show that our method performs well across different clustering tasks and datasets, even when only a limited number of queries are available. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

A Part-of-Speech Tagging Model Employing Word Clustering and Syntactic Parsing

引用

Chinese Journal of Electronics 2025年第1期23卷 109-114页

作者： Lichi Yuan School of Information Technology Jiangxi University of Finance and Economics Nanchang China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China

Part-Of-Speech tagging is a basic task in the field of natural language processing. This paper builds a POS tagger based on improved Hidden Markov model, by employing word clustering and syntactic parsing model. Firstly, In order to overcome the defects of the classical HMM, Markov family model (MFM), a new statistical model was introduced. Secondly, to solve the problem of data sparseness, we propose a bottom-to-up hierarchical word clustering algorithm. Then we combine syntactic parsing with part-of-speech tagging. The Part-of-Speech tagging experiments show that the improved Part-Of-Speech tagging model has higher performance than Hidden Markov models (HMMs) under the same testing conditions, the precision is enhanced from 94.642% to 97.235%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Three-dimensional diabetic macular edema thickness maps based on fluid segmentation and fovea detection using deep learning

引用

International Journal of Ophthalmology(English edition) 2022年第3期15卷 495-501页

作者： Jing-Jing Xu Yang Zhou Qi-Jie Wei Kang Li Zhen-Ping Li Tian Yu Jian-Chun Zhao Da-Yong Ding Xi-Rong Li Guang-Zhi Wang Hong Dai School of Medicine Tsinghua UniversityBeijing 100084China Visionary Intelligence Company Limited Beijing 100872China Department of Ophthalmology Beijing HospitalNational Center of GerontologyInstitute of Geriatric MedicineChinese Academy of Medical ScienciesBeijing 100730China Key Lab of Data Engineering and Knowledge Engineering Renmin University of ChinaBeijing 100872China

AIM: To explore a more accurate quantifying diagnosis method of diabetic macular edema(DME) by displaying detailed 3D morphometry beyond the gold-standard quantification indicator-central retinal thickness(CRT) and apply it in follow-up of DME ***: Optical coherence tomography(OCT) scans of 229 eyes from 160 patients were *** manually annotated cystoid macular edema(CME), subretinal fluid(SRF) and fovea as ground *** convolution neural networks(DCNNs) were constructed including U-Net, sASPP, HRNetV2-W48, and HRNetV2-W48+Object-Contextual Representation(OCR) for fluid(CME+SRF) segmentation and fovea detection respectively, based on which the thickness maps of CME, SRF and retina were generated and divided by Early Treatment Diabetic Retinopathy Study(ETDRS) ***: In fluid segmentation, with the best DCNN constructed and loss function, the dice similarity coefficients(DSC) of segmentation reached 0.78(CME), 0.82(SRF), and 0.95(retina).In fovea detection, the average deviation between the predicted fovea and the ground truth reached 145.7±117.8 μ*** generated macular edema thickness maps are able to discover center-involved DME by intuitive morphometry and fluid volume, which is ignored by the traditional definition of CRT>250 μ*** maps could also help to discover fluid above or below the fovea center ignored or underestimated by a single OCT ***: Compared to the traditional unidimensional indicator-CRT, 3D macular edema thickness maps are able to display more intuitive morphometry and detailed statistics of DME, supporting more accurate diagnoses and follow-up of DME patients.

关键词： diabetic macular edema fluid segmentation fovea detection 3D macular edema thickness maps deep learning

来源：评论

学校读者我要写书评

暂无评论

Phase spectrum based automatic ship detection in synthetic aperture radar images

引用

Journal of Ocean engineering and Science 2021年第2期6卷 185-195页

作者： Miaohui Zhang Baojun Qiao Ming Xin Bo Zhang Henan Key Laboratory of Big Data Analysis and Processing Henan UniversityKaifengChina Institute of Data and Knowledge Engineering Henan UniversityKaifengChina School of Computer Science and Engineering Beihang UniversityBeijingChina

This paper proposes an automatic ship detection approach in Synthetic Aperture Radar(SAR)Images using phase *** proposed method mainly contains two stages:Firstly,sea-land segmentation of SAR Images is one of the key stages for SAR image application such as sea-targets detection and recognition,which are easily detected only in sea *** order to eliminate the influence of land regions in SAR images,a novel land removing method is *** removing method employs a Harris corner detector to obtain some image patches belonging to land,and the probability density function(PDF)of land area can be estimated by these ***,an appropriate land segmentation threshold is accordingly ***,an automatic ship detector based on phase spectrum is *** proposed detector is free from various idealized assumptions and can accurately detect ships in SAR *** results demonstrate the efficiency of the proposed ship detection algorithm in diversified SAR images.

关键词： Ship detection saliency detection phase spectrum sea-land segmentation

来源：评论

学校读者我要写书评

暂无评论

A Query Optimization Method Utilizing Large Language Models

arXiv

引用

arXiv 2025年

作者： Yao, Zhiming Li, Haoyang Zhang, Jing Li, Cuiping Chen, Hong School of Information Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering MOE China Engineering Research Center of Database and Business Intelligence MOE China

Query optimization is a critical task in database systems, focused on determining the most efficient way to execute a query from an enormous set of possible strategies. Traditional approaches rely on heuristic search methods and cost predictions, but these often struggle with the complexity of the search space and inaccuracies in performance estimation, leading to suboptimal plan choices. This paper presents LLMOpt, a novel framework that leverages Large Language Models (LLMs) to address these challenges through two innovative components: (1) LLM for Plan Candidate Generation (LLMOpt(G)), which eliminates heuristic search by utilizing the reasoning abilities of LLMs to directly generate high-quality query plans, and (2) LLM for Plan Candidate Selection (LLMOpt(S)), a list-wise cost model that compares candidates globally to enhance selection accuracy. To adapt LLMs for query optimization, we propose fine-tuning pre-trained models using optimization data collected offline. Experimental results on the JOB, JOB-EXT, and Stack benchmarks show that LLMOpt(G) and LLMOpt(S) outperform state-of-the-art methods, including PostgreSQL, BAO, and HybridQO. Notably, LLMOpt(S) achieves the best practical performance, striking a balance between plan quality and inference efficiency. Copyright © 2025, The Authors. All rights reserved.

关键词： Structured Query Language

来源：评论

学校读者我要写书评

暂无评论

Cutting Learned Index into Pieces: An In-depth Inquiry into Updatable Learned Indexes

Cutting Learned Index into Pieces: An In-depth Inquiry into ...

引用

International Conference on data engineering

作者： Jiake Ge Boyu Shi Yanfeng Chai Yuanhui Luo Yunda Guo Yinxuan He Yunpeng Chai Key Laboratory of Data Engineering and Knowledge Engineering MOE China School of Information Renmin University of China China

Numerous high-performance updatable learned indexes have recently been designed to support the writing requirements in practical systems. Researchers have proposed various strategies to improve the availability of updatable learned indexes. However, it is unclear which strategy is more profitable. Therefore, we deconstruct the design of learned indexes into multiple dimensions and in-depth evaluate their impacts on the overall performance, respectively. Through the in-depth exploration of learned indexes, we reckon that the approximation algorithm is the most crucial design dimension for improving the performance of the learned indexes rather than the popular works that focus on the learned index structure. Moreover, this paper makes a comprehensive end-to-end evaluation based on a high-performance key-value store to answer people’s concerns about which learned index is better and whether learned indexes can outperform traditional ones. Finally, according to end-to-end and in-depth evaluation results, we give some constructive suggestions on designing a better learned index in these dimensions, especially how to design an excellent approximate algorithm to improve the lookup and insertion performance of learned indexes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On-Line System of Garbage Image-Orientated Intelligent Classification, Submission and Examination

On-Line System of Garbage Image-Orientated Intelligent Class...

引用

IEEE International Conference on e-Business engineering (ICEBE)

作者： Jiayin Tian Yaozhi Wang Jiaxin Liu Yan Chen School of Computer Science and Technology Xi'an Jiaotong University Xi'an Shaanxi China Shaanxi Key Lab of Big Data Knowledge Engineering Xi'an Jiaotong University Xi'an Shaanxi China Shaanxi Key Lab of Big Data Knowledge Engineering School of Computer Science and Technology Xi'an Jiaotong University Xi'an Jiaotong University Xi'an Shaanxi China

ISBN: (数字)9798350365856

ISBN: (纸本)9798350365863

In a world brimming with new products continually, novel waste types are ubiquitous. This makes current image-based garbage classification systems difficult to perform well due to the long-tailed effects of distribution of garbage types, and necessitates an urgent and efficient garbage classification with abilities of detecting new and rare wastes and class-incremental learning for environmental sustainability. Therefore, we propose a framework of Online System of Garbage Image-Oriented Intelligent Classification, Submission, and Examination, facilitating the incremental garbage classification efforts. In which, to identify novel garbage effectively, we also introduced few-shot object detection method with two key algorithms: Two-Stage Object Detection Learning Algorithm and Dynamic Query-based Incremental Few-shot Learning Algorithm. Our experiment results show that Both outperform the current existing ones in dataset, MS COCO. Then, a strategy of Class-Incremental learning based Residual Network is proposed to meet the need of new waste class-incremental learning. The experimental results support our strategy. Finally, a prototype system employed the above algorithms and the strategy is described.

关键词： Image recognition Heavily-tailed distribution Heuristic algorithms Green products Prototypes Object detection Classification algorithms Object recognition Few shot learning Residual neural networks

来源：评论

学校读者我要写书评

暂无评论

Robust Watermarking Algorithm for Medical Volume data Based on Polar Cosine Transform and 3D-DCT

引用

Computers, Materials & Continua 2023年第6期75卷 5853-5870页

作者： Pengju Zhang Jingbing Li Uzair Aslam Bhatti Jing Liu Yen-wei Chen Dekai Li Lei Cao School of Information and Communication Engineering Hainan UniversityHaikou570100China State Key Laboratory of Marine Resource Utilization in the South China Sea Hainan UniversityHaikou570100China Research Center for Healthcare Data Science Zhejiang LabHangzhou311121China Graduate School of Information Science and Engineering Ritsumeikan UniversityKyoto5258577Japan

The amount of 3D data stored and transmitted in the Internet of Medical Things(IoMT)is increasing,making protecting these medical data increasingly ***,there are relatively few researches on 3D data ***,due to the particularity of medical data,strict data quality should be considered while protecting data *** solve the problem,in the field of medical volume data,we proposed a robust watermarking algorithm based on Polar Cosine Transform and 3D-Discrete Cosine Transform(PCT and 3D-DCT).Each slice of the volume data was transformed by PCT to obtain feature row vector,and then the reshaped three-dimensional feature matrix was transformed by *** on the contour information of the volume data and the detail information of the inner slice,the visual feature vector was obtained by applying the per-ceptual *** addition,the watermark was encrypted by a multi-sensitive initial value Sine and Piecewise linear chaotic Mapping(SPM)system,and embedded as a zero *** key was stored in a third *** the same experimental conditions,when the volume data is rotated by 80 degrees,cut 25%along the Z axis,and the JPEG compression quality is 1%,the Normalized Correlation Coefficient(NC)of the extracted watermark is 0.80,0.89,and 1.00 respectively,which are significantly higher than the comparison algorithm.

关键词： Volume data watermark zero watermark SPM PCT and 3D-DCT

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：