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

International Conference on Web-Age Information Management Workshops (WAIM)

作者： Li Yu School of Information Key Laboratory of Data Engineering and Knowledge Engineerin Renmin University of China Beijing China

ISBN: (纸本)9781424432004;9780769531854

Collaborative filtering is an important personalized recommendation technique applied widely in E-commerce. It is not adapted to multi-interest or title recommendation for the 'general neighbourhood' problem which is analyzed in this paper. Based on it, collaborative filtering recommendation based on community is presented by introducing the concept 'community neighbourhood' in the paper. Unfortunately, it results into severer sparsity problem which makes heavy effect on its performance. In order to overcome it, an ontological A-priori score is used to infer user preference and to pre-fill null rating first. After pre-filling using the ontology method, then collaborative filtering based on community is executed based on a dense rating matrix. The experiment shows that collaborative filtering based on community makes generally better performance than traditional method when data is not very sparse, and ontology method can truly enhance collaborative filtering based on community since the sparsity is overcame.

关键词： Communities Ontologies Filtering Collaboration Motion pictures Filling Argon

来源：评论

学校读者我要写书评

暂无评论

Co-design of information systems with digital records management: A proposal for research 7

Co-design of information systems with digital records manage...

引用

7th International Joint Conference on knowledge Discovery, knowledge engineering and knowledge Management, IC3K 2015

作者： Xie, Sherry L. Key Laboratory of Data Enginerring and Knowledge Engineering Ministry of Education Beijing China Center for Electronic Records Management Research Beijing China School of Information Resource Management Renmin Univeristy of China 59 Zhonguancun Ave Beijing China

ISBN: (纸本)9789897581588

This position paper, via rationalizing the potentials of carrying out a carefully crafted research project, argues that the three fields of enterprise information system, business process management, and digital records management should join forces in serving the needs of organizations, regardless of their types. By preliminary findings uncovered during the conceiving process of the project, it advocates that the best point of convergence is the design phase, a basic step for all of the three fields and an increasingly critical one in today's digital environment. © 2015 by SCITEPRESS - Science and Technology Publications, Lda. All rights reserved.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

Design of Wireless data Center Network Structure Based on ExCCC-DCN 6th

Design of Wireless Data Center Network Structure Based on Ex...

引用

6th International Conference on data Science, ICDS 2019

作者： Jing, Yanhao Han, Zhijie Du, Xiaoyu Zhang, Qingfang School of Computer and Information Engineering Henan University KaifengHenan475004 China Institute of Data and Knowledge Engineering Henan University KaifengHenan475004 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Network NanjingJiangsu210003 China

ISBN: (纸本)9789811528095

A data center is a cluster of servers, which is typically an organic collection of tens of thousands of servers. The sheer number of servers determines how well its performance is related to how it is interconnected. Just like the topology of Ethernet determines its network capacity and communication characteristics, the network structure of the data center has a great impact on its performance and capacity. The research object ExCCC-DCN in this paper has excellent node capacity, and its construction cost and operating energy consumption are relatively low, which is very suitable for deploying large-scale data centers. However, ExCCC-DCN is deployed on a wired link, and a large number of wired links can make maintenance and upgrade of the data center more difficult. Therefore, this paper utilizes the advantages of high transmission rate, strong anti-interference and high security of 60 GHz millimeter wave to wirelessly transform ExCCC-DCN, making it more flexible in the case of maintaining communication efficiency. © Springer Nature Singapore Pte Ltd 2020.

关键词： Millimeter waves

来源：评论

学校读者我要写书评

暂无评论

knowledge Fragment Cleaning in a Genealogy knowledge Graph

Knowledge Fragment Cleaning in a Genealogy Knowledge Graph

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Guliu Liu Lei Li Key Laboratory of Knowledge Engineering with Big Data (Heifei Unversity of Technology) Ministry of Education Heifei China

ISBN: (数字)9781728181561

ISBN: (纸本)9781728181578

As an important topic of artificial intelligence, knowledge graphs have a wide range of applications such as semantic search, intelligent question answering, and visual decision support. Among them, the genealogy knowledge graph, as a kind of domain knowledge graph, has important application value in genetic disease analysis, population behavior analysis, etc. In the case of multiple data sources and multi-person collaboration, the construction of a genealogy knowledge graph involves the techniques of knowledge representation, knowledge acquisition, and knowledge fusion. In the knowledge fusion process, there are many situations such as the lack and chaos of a relationship, redundant entities, the isolation of some entities and knowledge fragments. How to effectively detect and process these problematic knowledge fragments is significant to the construction of a genealogy knowledge graph. In response to this problem, we propose a method for cleaning the problematic knowledge fragments in a genealogy knowledge graph. The method consists of three phases. In phase 1, we propose a method for detecting and analyzing the problematic knowledge fragments. In phase 2, we design a method for supplementing the entity-relationship of people for different error patterns and a method fusion method for the aligned entity. In phase 3, for the cleaning of isolated knowledge fragments, we propose an entity alignment method based on the father-son relationship and people's names and a connection method of isolated knowledge fragments. Finally, we conduct experiments on a family tree dataset of the Huapu System, and the experimental results indicate the effectiveness and practicality of the method.

关键词： Cleaning Big data knowledge acquisition Redundancy Organizations databases

来源：评论

学校读者我要写书评

暂无评论

Neural Collaborative Recommendation with knowledge Graph

Neural Collaborative Recommendation with Knowledge Graph

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Lei Sang Lei Li Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education Hefei China

ISBN: (数字)9781728181561

ISBN: (纸本)9781728181578

knowledge Graph (KG), which commonly consists of fruitful connected facts about items, presents an unprecedented opportunity to alleviate the sparsity problem in recommender system. However, existing KG based recommendation methods mainly rely on handcrafted meta-path features or simple triple-level entity embedding, which cannot automatically capture entities' long-term relational dependencies for the recommendation. In this paper, a two-channel neural interaction method named knowledge Graph enhanced Neural Collaborative Filtering with Residual Recurrent Network (KGNCF-RRN) is proposed, which leverages both long-term relational dependencies KG context and user-item interaction for recommendation. (1) For the KG context interaction channel, we propose a Residual Recurrent Network (RRN) to construct context-based path embedding, which incorporates residual learning into traditional recurrent neural networks (RNNs) to efficiently encode the long-term relational dependencies of KG. The self-attention network is then applied to the path embedding to capture the polysemy of various user interaction behaviours. (2) For the user-item interaction channel, the user and item embeddings are fed into a newly designed two-dimensional interaction map. (3) Finally, above the two-channel neural interaction matrix, we employ a convolutional neural network to learn complex correlations between user and item. Extensive experimental results on three benchmark datasets show that our proposed approach outperforms existing state-of-the-art approaches for knowledge graph based recommendation.

关键词： Collaboration Recurrent neural networks knowledge engineering Semantics Motion pictures Context modeling Filtering

来源：评论

学校读者我要写书评

暂无评论

Detecting the research diversity of researchers in library and information science:An exploratory study

引用

data Science and Informetrics 2022年第3期2卷 22-36页

作者： Yuehua Zhao Sicheng Zhu Jie Wu Hao Wang Sanhong Deng Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing UniversityNanjingChina School of Information Management Nanjing UniversityNanjingChina

Metrics have emerged as an important tool for quantitatively evaluating researchers from a variety of perspectives,including research impact,research quality,interdisciplinarity,and *** in the field of library and information science,many previous studies have highlighted the characteristics of researchers in this ***,only a minority of the studies address the aspect of diversity in research *** purpose of this study is to(1)evaluate the topic diversity of researchers in library and information science and(2)examine the relationships between the researcher topic diversity and research *** propose an indicator to quantify author topic diversity,which we refer to as author topic diversity(ATD).Latent Dirichlet Allocation(LDA)is used to detect topics in the field,while cosine similarity is used to calculate the diversity of research topics in a given researcher’s *** results show that topic diversity in the field of library and information science varies greatly from author to *** addition,weak positive correlations are found between the ATD and citation indicators,suggesting that engaging in diversified topics may lead to higher research impact.

关键词： Research diversity Research evaluation Library and information science

来源：评论

学校读者我要写书评

暂无评论

On Mutual Support of Modern and Traditional Access Control Models with UCON and BLP as Case Study

On Mutual Support of Modern and Traditional Access Control M...

引用

WRI International Conference on Communications and Mobile Computing, CMC

作者： Hui Feng Wenchang Shi Zhaohui Liang Bin Liang School of Information Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Renmin University of China Beijing China

Access control is essential to computer security, especially in an open, distributed, networked communication environment. Modern access control model such as UCON aims at accommodating general requirements. Traditional one such as BLP focuses on specific properties, e.g. confidentiality. Both of these two realms have their limitations. Taking UCON and BLP as case study, this paper explores mutual support of modern and traditional access control models. It investigates BLP's adaptable characteristic in the UCON perspective. First, it constructs properties in the UCON language to manifest the BLP adaptability, which shows that the BLP adaptability can be ensured to function correctly by the UCON framework. Further, it proposes a formal specification for the BLP adaptability under the UCON framework with the Temporal Logic of Actions, which demonstrates that the BLP adaptability is in good consistency with the UCON model. The significance of the paper is twofold. On the one hand, it exhibits that adaptable quality of the traditional BLP model may be ensured theoretically by the philosophy of modern access control. On the other hand, it enriches the real sense of modern access control models by strengthening the power of traditional access control models.

关键词： Adaptation model Sensitivity Authorization Permission Computational modeling

来源：评论

学校读者我要写书评

暂无评论

A New Type Wireless data Center of Comb Topology 6th

A New Type Wireless Data Center of Comb Topology

引用

6th International Conference on data Science, ICDS 2019

作者： Zhang, Qingfang Han, Zhijie Du, Xiaoyu School of Computer and Information Engineering Henan University KaifengHenan475004 China Institute of Data and Knowledge Engineering Henan University KaifengHenan475004 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Network NanjingJiangsu210003 China

ISBN: (纸本)9789811528095

In recent years, group communication has become more and more popular. In the current data center network, multicast plays an extremely important role in group communication. Traditional data center network is designed based on wires. Researchers have proposed Dcell, Bcube and other data center topologies successively. However, in the traditional data center network, the wired topology structure has the disadvantages of high overhead, complex deployment, high maintenance cost, slow heat dissipation and so on. Moreover, the existing wireless data center Flyways structure and Graphite structure have the problems of low connectivity and poor scalability. So this paper proposes and designs a new data center network topology Comb structure (Comb model is a multi-layer cellular structure model, which is a multi-layer structure composed of single-layer honeycomb-like structure interlaced with each other). The structure can effectively improve the connectivity of the data center, shorten the routing path, reduce the probability of node failure in the network, and ensure the smooth network. © Springer Nature Singapore Pte Ltd 2020.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Generative-Contrastive Graph Learning for Recommendation

arXiv

引用

arXiv 2023年

作者： Yang, Yonghui Wu, Zhengwei Wu, Le Zhang, Kun Hong, Richang Zhang, Zhiqiang Zhou, Jun Wang, Meng Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology China Ant Group China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Institute of Artificial Intelligence Hefei Comprehensive National Science Center China

By treating users’ interactions as a user-item graph, graph learning models have been widely deployed in Collaborative Filtering (CF) based recommendation. Recently, researchers have introduced Graph Contrastive Learning (GCL) techniques into CF to alleviate the sparse supervision issue, which first constructs contrastive views by data augmentations and then provides self-supervised signals by maximizing the mutual information between contrastive views. Despite the effectiveness, we argue that current GCL-based recommendation models are still limited as current data augmentation techniques, either structure augmentation or feature augmentation. First, structure augmentation randomly dropout nodes or edges, which is easy to destroy the intrinsic nature of the user-item graph. Second, feature augmentation imposes the same scale noise augmentation on each node, which neglects the unique characteristics of nodes on the graph. To tackle the above limitations, we propose a novel Variational Graph Generative-Contrastive Learning (VGCL) framework for recommendation. Specifically, we leverage variational graph reconstruction to estimate a Gaussian distribution of each node, then generate multiple contrastive views through multiple samplings from the estimated distributions, which builds a bridge between generative and contrastive learning. The generated contrastive views can well reconstruct the input graph without information distortion. Besides, the estimated variances are tailored to each node, which regulates the scale of contrastive loss for each node on optimization. Considering the similarity of the estimated distributions, we propose a cluster-aware twofold contrastive learning, a node-level to encourage consistency of a node’s contrastive views and a cluster-level to encourage consistency of nodes in a cluster. Finally, extensive experimental results on three public datasets clearly demonstrate the effectiveness of the proposed model. Copyright © 2023, The Authors.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Evolving Sequential Patterns Mining Model over Click Stream with Levenshtein-Automata

Evolving Sequential Patterns Mining Model over Click Stream ...

引用

International Conference on Innovative Computing, Information and Control (ICICIC)

作者： Haifeng Li Hong Chen School of Information Key Laboratory of Data Engineering and Knowledge Engineering MOEMOE Renmin University of China Beijing China

Sequential pattern mining is an important problem in continuous, fast, dynamic and unlimited stream mining. Recently approximate mining algorithms are proposed which spend too many system resources and can only obtain the partial feature of stream. In this paper, a multi-level evolving sequential pattern mining model ESPMM is presented to address this problem thus the mostly entire stream feature is obtained. Furthermore, because of the smaller support of sequential patterns in each level, a mining method BMLA based on Levenshtein-Automata is proposed which builds state conversion model to compute sequences' similarity in linear time. The experiment results show this model is effective and efficient.

关键词： Distance measurement data mining Runtime Automata Computational modeling Evolution (biology) data models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：