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

IEEE Symposium on Computers and Communications

作者： Yuncheng Wu Juru Zeng Hong Chen Yao Wu Wenjuan Liang Hui Peng Cuiping Li Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China

ISBN: (纸本)9781509006809

Recently, listwise ranking-oriented collaborative filtering (CF) algorithms have gained great success in recommender systems. However, the ranked preference list may compromise the privacy of individuals. A notable paradigm for offering strong privacy guarantee is differential privacy. In this paper, we propose DPListCF, a differentially private algorithm based on ListCF (a state-of-art listwise CF algorithm). The main idea of DPListCF is to make both of the similarity calculation phase and rank prediction phase of ListCF satisfy differential privacy, by using input perturbation method and output perturbation method in the two phases respectively. Extensive experiments using two real datasets evaluate the performance of DPListCF, and demonstrate that the proposed algorithm outperforms state-of-art approaches.

关键词： Open area test sites Privacy collaborative filtering Recommender systems Perturbation methods Arts CONTAINMENT FAILURE

来源：评论

学校读者我要写书评

暂无评论

knowledge-augmented Self-training of A Question Rewriter for Conversational knowledge Base Question Answering

Knowledge-augmented Self-training of A Question Rewriter for...

引用

2022 Findings of the Association for Computational Linguistics: EMNLP 2022

作者： Ke, Xirui Zhang, Jing Lv, Xin Xu, Yiqi Cao, Shulin Li, Cuiping Chen, Hong Li, Juanzi School of Information Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education China Department of Computer Science and Technology Tsinghua University Beijing China

The recent rise of conversational applications such as online customer service systems and intelligent personal assistants has promoted the development of conversational knowledge base question answering (ConvKBQA). Different from the traditional single-turn KBQA, ConvKBQA usually explores multi-turn questions around a topic, where ellipsis and coreference pose great challenges to the single-turn KBQA systems which require self-contained questions. In this paper, we propose a rewrite- and-reason framework to first produce a full-fledged rewritten question based on the conversation history and then reason the answer by existing single-turn KBQA models. To overcome the absence of the rewritten supervision signals, we introduce a knowledge-augmented self-training mechanism to transfer the question rewriter from another dataset to adapt to the current knowledge base. Our question rewriter is decoupled from the subsequent QA process, which makes it easy to be united with either retrieval-based or semantic parsing-based KBQA models. Experiment results demonstrate the effectiveness of our method and a new state-of-the-art result is achieved. The code and dataset are available online now. © 2022 Association for Computational Linguistics.

关键词： knowledge based systems

来源：评论

学校读者我要写书评

暂无评论

Fuzzy associative classifier for probabilistic numerical data 7

Fuzzy associative classifier for probabilistic numerical dat...

引用

7th International Conference on Intelligent Systems and knowledge engineering, ISKE 2012 with 1st International Conference on Cognitive Systems and Information Processing, CSIP 2012

作者： Pei, Bin Zhao, Tingting Zhao, Suyun Chen, Hong Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing China School of Information Renmin University of China Beijing China New Star Research Institute of Applied Tech Hefei China

ISBN: (纸本)9783642378287

Recently, a number of advanced data collection and processing methodologies have led to the proliferation of uncertain data. When discovering from such uncertain data, we should handle these uncertainties with caution, because classical mining algorithms may not be appropriate for uncertain tasks. This paper proposes a generic framework of fuzzy associative classifier for probabilistic numerical data, which is prevalent in the real-world applications, such as sensor networks and GPS-based location. In this paper, we first introduce an Aprioribased algorithm for mining fuzzy association rules from a probabilistic numerical dataset based on novel support and confidence measures suitable for such dataset. Then, we give fuzzy rules redundancy pruning strategy and database coverage method to build a compact fuzzy associative classifier in removing redundant rules and thus improving the accuracy of the classifier. We also redefine multiple fuzzy rules classification method for classifying new instances. Extensive experimental results show the effectiveness and efficiency of our algorithm. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Fuzzy rules

来源：评论

学校读者我要写书评

暂无评论

Endurable SSD-Based Read Cache for Improving the Performance of Selective Restore from Deduplication Systems

引用

Journal of Computer Science & Technology 2018年第1期33卷 58-78页

作者： Jian Liu Yun-Peng Chai Xiao Qin Yao-Hong Liu Division of Computer Science and Engineering Louisiana State University Baton Rouge LA 70803 U.S.A. Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education of China Beijing 100872 China School of Information Renmin University of China Beijing 100872 China Shelby Center for Engineering Technology Department of Computer Science and Software Engineering Samuel Ginn College of Engineering Auburn University Auburn AL 368~9-53~7 U.S.A.

Deduplication has been commonly used in both enterprise storage systems and cloud storage. To overcome the performance challenge for the selective restore operations of deduplication systems, solid-state-drive-based （i.e., SSD-based） re^d cache cm, be deployed for speeding up by caching popular restore contents dynamically. Unfortunately, frequent data updates induced by classical cache schemes （e.g., LRU and LFU） significantly shorten SSDs＇ lifetime while slowing down I/O processes in SSDs. To address this problem, we propose a new solution -- LOP-Cache to greatly improve tile write durability of SSDs as well as I/O performance by enlarging the proportion of long-term popular （LOP） data among data written into SSD-based cache. LOP-Cache keeps LOP data in the SSD cache for a long time period to decrease the number of cache replacements. Furthermore, it prevents unpopular or unnecessary data in deduplication containers from being written into the SSD cache. We implemented LOP-Cache in a prototype deduplication system to evaluate its pertbrmance. Our experimental results indicate that LOP-Cache shortens the latency of selective restore by an average of 37.3% at the cost of a small SSD-based cache with only 5.56% capacity of the deduplicated data. Importantly, LOP-Cache improves SSDs＇ lifetime by a factor of 9.77. The evidence shows that LOP-Cache offers a cost-efficient SSD-based read cache solution to boost performance of selective restore for deduplication systems.

关键词： data deduplication solid state drive (SSD) flash cache endurance

来源：评论

学校读者我要写书评

暂无评论

Multicomponent Similarity Graphs for Cross-Network Node Classification

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第3期5卷 1411-1424页

作者： Zhang, Yuhong Shi, Congmei Li, Xinzheng Zhang, Zan Hu, Xuegang School of Computer Science and Information Engineering Hefei University of Technology Hefei230601 China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Hefei230088 China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei230009 China

Cross-network node classification aims to train a classifier for an unlabeled target network using a source network with rich labels. In applications, the degree of nodes mostly conforms to the long-tail distribution, i.e., most nodes in the network are tail nodes with sparse neighborhoods. The established methods focus on either the discrepancy cross network or the long tail in a single network. As for the cross-network node classification under long tail, the coexistence of sparsity of tail nodes and the discrepancy cross-network challenges existing methods for long tail or methods for the cross-network node classification. To this end, a multicomponent similarity graphs for cross-network node classification (MS-CNC) is proposed in this article. Specifically, in order to address the sparsity of the tail nodes, multiple component similarity graphs, including attribute and structure similarity graphs, are constructed for each network to enrich the neighborhoods of the tail nodes and alleviate the long-tail phenomenon. Then, multiple representations are learned from the multiple similarity graphs separately. Based on the multicomponent representations, a two-level adversarial model is designed to address the distribution difference across networks. One level is used to learn the invariant representations cross network in view of structure and attribute components separately, and the other level is used to learn the invariant representations in view of the fused structure and attribute graphs. Extensive experimental results show that the MS-CNC outperforms the state-of-the-art methods. Impact Statement-Node classification is an important task in graph mining. With the unavailability of labels, some researchers propose cross-network node classification, using one labeled network to assist the node classification of another unlabeled network. However, the long-tail of nodes leads to unsatisfactory performance and challenges the recent cross-network node classification m

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

DB Facade: A web cache with improved data freshness

DB Facade: A web cache with improved data freshness

引用

2nd International Symposium on Electronic Commerce and Security, ISECS 2009

作者： Xiongpai, Qin Zhou, Xiaoyun Key Laboratory of Data Engineering and Knowledge Engineering School of Information Renmin University of China Beijing 100872 China School of Information and Electrical Engineering China University of Mining Technology Xuzhou Jiangsu 221008 China

ISBN: (纸本)9780769536439

Traditional web database cache techniques have a major disadvantage, namely poor data freshness, because they employ an asynchronous data refresh strategy. A novel web database cache, DB Façade, is proposed in this paper. DB Facade uses a main memory database to cache result sets of previous queries for subsequent reusing. Updates on backend database system are managed by delta tables, and then propagated to web database cache in a near real-time manner, hence guarantee the freshness of data. DB Facade offloads query burden from backend database systems, and exploits the power of main memory database system to boost query performance. TPC-W testing result shows that the system's performance increases by about 17 percent. © 2009 IEEE.

关键词： Facades

来源：评论

学校读者我要写书评

暂无评论

MatchPrompt: Prompt-based Open Relation Extraction with Semantic Consistency Guided Clustering

MatchPrompt: Prompt-based Open Relation Extraction with Sema...

引用

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

作者： Wang, Jiaxin Zhang, Lingling Liu, Jun Liang, Xi Zhong, Yujie Wu, Yaqiang Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering School of Computer Science and Technology Xi'an Jiaotong University China National Engineering Lab for Big Data Analytics Xi'an Jiaotong University China Lenovo Research Beijing China

Relation clustering is a general approach for open relation extraction (OpenRE). Current methods have two major problems. One is that their good performance relies on large amounts of labeled and pre-defined relational instances for pre-training, which are costly to acquire in reality. The other is that they only focus on learning a high-dimensional metric space to measure the similarity of novel relations and ignore the specific relational representations of clusters. In this work, we propose a new prompt-based framework named MatchPrompt, which can realize OpenRE with efficient knowledge transfer from only a few predefined relational instances as well as mine the specific meanings for cluster interpretability. To our best knowledge, we are the first to introduce a prompt-based framework for unlabeled clustering. Experimental results on different datasets show that MatchPrompt achieves the new SOTA results for OpenRE. © 2022 Association for Computational Linguistics.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Randomly Sampling based Fuzzy Rough Reduction

Randomly Sampling based Fuzzy Rough Reduction

引用

IEEE International Conference on Systems, Man, and Cybernetics

作者： Yu Chen Suyun Zhao Hong Chen Key Laboratory of Data Engineering and Knowledge (Renmin University of China)

ISBN: (纸本)9781479938414

Now most methods of the existing fuzzy rough based attribute reduction can't be applied to large scale data sets because of high time and space consuming. To overcome this problem, we proposed a randomly sampling based method to decrease the computing consumption. First, we propose some pseudo concepts of fuzzy rough sets, such as the pseudo lower approximation and pseudo attribute reduction, which is not exactly, but approximately equal to classical concepts, and then it drastically accelerate computation and significantly reduce space consumption. The numerical experiments show that the random sampling algorithm is significantly efficient both in time and space with little loss of information.

关键词： Randomly sampling Fuzzy rough sets Attribute reduction Pesudo approximation operators

来源：评论

学校读者我要写书评

暂无评论

A Parallel Recovery Scheme for Update Intensive Main Memory database Systems

A Parallel Recovery Scheme for Update Intensive Main Memory ...

引用

IEEE International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)

作者： Xiongpai Qin Yanqin Xiao Wei Cao Shan Wang Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing China Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing P.R. China

In update intensive applications, main memory database systems produce large volume of log records, it is critical to write out the log records efficiently to speedup transaction processing. We propose a parallel recovery scheme based on XOR differential logging for main memory database systems in such environments. Some NVRAM is used to temporarily hold log records and decouple transaction committing from disk writes, inherited parallelism properties of differential logging are exploited to accelerate log flushing by using multiple log disks. During recovery, log records are loaded from multiple log disks and applied to data partition in time without the need of reordering according to serialization order, total recovery time is cut down. The scheme employs a data partition based consistent checkpointing method. The log records are classified according to IDs of data partitions accessed. data partitions are recovered according to loading priorities computed from update frequencies and transaction waiting times, data access demands of new transactions coming after failure recovery are given attention immediately, thus the scheme provides system availability during recovery, which is of importance for large scale main memory database systems.

关键词： database systems data engineering Large-scale systems Random access memory Checkpointing Communication industry Defense industry Distributed computing Laboratories knowledge engineering

来源：评论

学校读者我要写书评

暂无评论

Predicting Genotype Information Related to COVID-19 for Molecular Mechanism Based on Computational Methods

引用

Computer Modeling in engineering & Sciences 2021年第10期129卷 31-45页

作者： Lejun Gong Xingxing Zhang Li Zhang Zhihong Gao Jiangsu Key Laboratory of Big Data Security&Intelligent Processing School of Computer Science Nanjing University of Posts and TelecommunicationsNanjing210046China Smart Health Big Data Analysis and Location Services Engineering Laboratory of Jiangsu Province Nanjing210046China College of Computer Science and Technology Nanjing Forestry UniversityNanjing210037China Zhejiang Engineering Research Center of Intelligent Medicine Wenzhou325035China

Novel coronavirus disease 2019(COVID-19)is an ongoing health *** studies are related to ***,its molecular mechanism remains *** rapid publication of COVID-19 provides a new way to elucidate its mechanism through computational *** paper proposes a prediction method for mining genotype information related to COVID-19 from the perspective of molecular mechanisms based on machine *** method obtains seed genes based on prior *** genes are mined from biomedical *** candidate genes are scored by machine learning based on the similarities measured between the seed and candidate ***,the results of the scores are used to perform functional enrichment analyses,including KEGG,interaction network,and Gene Ontology,for exploring the molecular mechanism of *** results show that the method is promising for mining genotype information to explore the molecular mechanism related to COVID-19.

关键词： COVID-19 SARS-CoV-2 computational method bioinformatics genotype machine learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：