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

5th International Conference on Compute and data Analysis, ICCDA 2021

作者： Li, Lei Yue, Zhengxiang Wu, Gongqing Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

ISBN: (纸本)9781450389112

Electronic Medical Records (EMR) and other medical data contain important and sensitive privacy information of patients, which provide important basis and reference for their doctors to diagnose and treat them. With the continuous development of data sharing, big data applications and other technologies, new requirements are proposed for the storage of medical privacy data. At present, medical data have the characteristics of obstructed sharing and exchange, difficult data tracing and data sensitivity, which increases the cost and difficulty of each diagnosis. Moreover, patients lack the right to know and control their own medical data, which is easy to cause data fraud or data leakage. As a decentralized, tamper proof and traceable distributed ledger system, blockchain brings new solutions to these problems. This paper designs a medical data fusion and distributed privacy management system based on the Hyperledger Fabric blockchain development platform and InterPlanetary File System. It can not only solve the problem of mutual distrust in the traditional system, but also realize the safe data storage and the safe sharing of medical record data between medical organizations which is a beneficial attempt to overcome the disadvantages of traditional hospital data separation. At the same time, according to the requirements of different levels and types of medical users or groups for data security and personal privacy protection, the access control technology of users is studied to ensure personal privacy data. © 2021 ACM.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Location selection for utility maximization with capacity constraints 12

Location selection for utility maximization with capacity co...

引用

21st ACM International Conference on Information and knowledge Management, CIKM 2012

作者： Sun, Yu Huang, Jin Chen, Yueguo Zhang, Rui Du, Xiaoyong School of Information Renmin University of China Beijing China University of Melbourne Melbourne VIC Australia Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE China

ISBN: (纸本)9781450311564

Given a set of client locations, a set of facility locations where each facility has a service capacity, and the assumptions that: (i) a client seeks service from its nearest facility;(ii) a facility provides service to clients in the order of their proximity, we study the problem of selecting all possible locations such that setting up a new facility with a given capacity at these locations will maximize the number of served clients. This problem has wide applications in practice, such as setting up new distribution centers for online sales business and building additional base stations for mobile subscribers. We formulate the problem as location selection query for utility maximization. After applying three pruning rules to a baseline solution,we obtain an efficient algorithm to answer the query. Extensive experiments confirm the efficiency of our proposed algorithm. © 2012 ACM.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

An empirical investigation of the older adults' continuance intention towards SNSs

An empirical investigation of the older adults' continuance ...

引用

作者： Liu, Wei Jiangxi Key Laboratory of Data and Knowledge Engineering Institute of Information Resources Management School of Information Technology Jiangxi University of Finance and Economics Nanchang360013 China

Although Social Network Services (SNSs) continuance usage has recently emerged as an important issue in information systems adaption, the research into older adults' continuance intention towards SNS is still very low, and the acceptance-discontinuance anomaly phenomenon (i.e. users discontinue using e-learning after initially accepting it) is a common occurrence. This study joins the perceived risk and perceived enjoyment to our prior research model which integrated the Expectation-Confirmation Model (ECM), the Technology Acceptance Model (TAM) and the Theory of Planned Behaviour (TPB) to hypothesise a theoretical model to explain and predict the older adults' intentions to continue using SNSs. The hypothesised model is validated empirically using a sample collected from 320 older adults who had prior experience with SNSs and was tested against the proposed research model using structure equation modelling. The results demonstrate that satisfaction has the most significant effect on older adults' continuance intention, followed by perceived usefulness, perceived risk, subject norm and perceived behavioural control. The results of these findings for SNSs practitioners are discussed at the end of this work. © Copyright 2016 Inderscience Enterprises Ltd.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Few-Shot Partial Multi-View Learning

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2023年第10期45卷 11824-11841页

作者： Zhou, Yuan Guo, Yanrong Hao, Shijie Hong, Richang Luo, Jiebo Ministry of Education Hefei University of Technology The Key Laboratory of Knowledge Engineering with Big Data Hefei230009 China Hefei University of Technology The School of Computer Science and Information Engineering Hefei230009 China University of Rochester The Department of Computer Science RochesterNY14627 United States

It is often the case that data are with multiple views in real-world applications. Fully exploring the information of each view is significant for making data more representative. However, due to various limitations and failures in data collection and pre-processing, it is inevitable for real data to suffer from view missing and data scarcity. The coexistence of these two issues makes it more challenging to achieve the pattern classification task. Currently, to our best knowledge, few appropriate methods can well-handle these two issues simultaneously. Aiming to draw more attention from the community to this challenge, we propose a new task in this paper, called few-shot partial multi-view learning, which focuses on overcoming the negative impact of the view-missing issue in the low-data regime. The challenges of this task are twofold: (i) it is difficult to overcome the impact of data scarcity under the interference of missing views;(ii) the limited number of data exacerbates information scarcity, thus making it harder to address the view-missing issue in turn. To address these challenges, we propose a new unified Gaussian dense-anchoring method. The unified dense anchors are learned for the limited partial multi-view data, thereby anchoring them into a unified dense representation space where the influence of data scarcity and view missing can be alleviated. We conduct extensive experiments to evaluate our method. The results on Cub-googlenet-doc2vec, Handwritten, Caltech102, Scene15, Animal, ORL, tieredImagenet, and Birds-200-2011 datasets validate its effectiveness. The codes will be released at https://***/zhouyuan888888/UGDA. © 1979-2012 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Global Collaboration in Artificial Intelligence:Bibliometrics and Network Analysis from 1985 to 2019

引用

Journal of data and Information Science 2020年第4期5卷 86-115页

作者： Haotian Hu Dongbo Wang Sanhong Deng School of Information Management Nanjing UniversityNanjing 210023China College of Information and Technology Nanjing Agricultural UniversityNanjing 210095China Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing 210023China

Purpose:This study aims to explore the trend and status of international collaboration in the field of artificial intelligence(AI)and to understand the hot topics,core groups,and major collaboration patterns in global AI ***/methodology/approach:We selected 38,224 papers in the field of AI from 1985 to 2019 in the core collection database of Web of Science(WoS)and studied international collaboration from the perspectives of authors,institutions,and countries through bibliometric analysis and social network ***:The bibliometric results show that in the field of AI,the number of published papers is increasing every year,and 84.8%of them are cooperative *** with more than three authors,collaboration between two countries and collaboration within institutions are the three main levels of collaboration *** social network analysis,this study found that the US,the UK,France,and Spain led global collaboration research in the field of AI at the country level,while Vietnam,Saudi Arabia,and United Arab Emirates had a high degree of international *** at the institution level reflects obvious regional and economic *** are the Developing Countries Institution Collaboration Group led by Iran,China,and Vietnam,as well as the Developed Countries Institution Collaboration Group led by the US,Canada,the ***,the Chinese Academy of Sciences(China)plays an important,pivotal role in connecting the these institutional collaboration *** limitations:First,participant contributions in international collaboration may have varied,but in our research they are viewed equally when building collaboration ***,although the edge weight in the collaboration network is considered,it is only used to help reduce the network and does not reflect the strength of *** implications:The findings fill the current shortage of research on international collaboration in A

关键词： Artificial intelligence International collaboration Collaboration pattern Bibliometric analysis Social network analysis

来源：评论

学校读者我要写书评

暂无评论

Finding top-k min-cost connected trees in databases

Finding top-k min-cost connected trees in databases

引用

23rd International Conference on data engineering, ICDE 2007

作者： Ding, Bolin Yu, Jeffrey Xu Wang, Shan Qin, Lu Zhang, Xiao Lin, Xuemin Chinese University of Hong Kong Hong Kong Key Laboratory of Data Engineering and Knowledge Engineering MOE of China Renmin University of China China University of New South Wales NICTA Australia

ISBN: (纸本)1424408032

It widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study processing an l-keyword query, p1, p2, , p1, against a relational database which can be modeled as a weighted graph, G(V, E). Here V is a set of nodes (tuples) and E is a set of edges representing foreign key references between tuples. Let Vi⊆7 V be a set of nodes that contain the keyword pi. We study finding top-k minimum cost connected trees that contain at least one node in every subset Vi, and denote our problem as GST-k When k = 1, it is known as a minimum cost group Steiner tree problem which is NP-Complete. We observe that the number of keywords, l, is small, and propose a novel parameterized solution, with l as a parameter, to find the optimal GST-1, in time complexity O(3ln + 2l ((l + log n)n + m)), where n and m are the numbers of nodes and edges in graph G. Our solution can handle graphs with a large number of nodes. Our GST-1 solution can be easily extended to support GST-k, which outperforms the existing GST-k solutions over both weighted undirected/directed graphs. We conducted extensive experimental studies, and report our finding. © 2007 IEEE.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Rough Based Decision Tree Constructing

Fuzzy Rough Based Decision Tree Constructing

引用

第十二届中国Rough集与软计算学术会议、第六届中国Web智能学术研讨会及第六届中国粒计算学术研讨会联合学术会议

作者： CHEN Wei ZHAO Su-yun CHEN Hong LI Cui-ping Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of ChinaMOE Beijin Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of ChinaMOE Beijin

Decision tree and fuzzy rough set are two distinct but complementary *** tree is a simple and easy-understandable rule-based classifier,whereas the tool of fuzzy rough sets are effective on attribute and sample *** is promising to propose an approach to integrate these two rule based classification tools to construct a novel decision tree based on fuzzy rough *** this paper,based on the basic concept of fuzzy rough sets,i.e.,consistence degree,we propose a fuzzy rough decision tree which is completely different from the existing classification *** three key basic elements of decision tree,i.e.,node,branch and leaf,are designed in a new way by using the notions in fuzzy rough *** then one algorithm to build fuzzy rough tree classifier is ***,experimental results show that the proposed algorithm is readily comprehensible and effective.

关键词： Fuzzy rough sets Decision tree Consistence degree Rule-based classifier

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：