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

9th Web Information Systems and Applications Conference, WISA 2012

作者： Liu, Yue Yang, Nan Yang, Gang School of Information Renmin University of China Bejing China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Bejing China

ISBN: (纸本)9781467330541

Recently, social tagging systems become more and more popular in many Web 2.0 applications. In such systems, Users are allowed to annotate a particular resource with a freely chosen a set of tags. These user-generated tags can represent users' interests more concise and closer to human understanding. Interests will change over time. Thus, how to describe users' interests and interests transfer path become a big challenge for personalized recommendation systems. In this approach, we propose a variable-length time interval division algorithm and user interest model based on time interval. Then, in order to draw users' interests transfer path over a specific time period, we suggest interest transfer model. After that, we apply a classical community partition algorithm in our approach to separate users into communities. Finally, we raise a novel method to measure users' similarities based on interest transfer model and provide personalized tag recommendation according to similar users' interests in their next time intervals. Experimental results demonstrate the higher precision and recall with our approach than classical user-based collaborative filtering methods. © 2012 IEEE.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Representation learning: serial-autoencoder for personalized recommendation

引用

Frontiers of Computer Science 2024年第4期18卷 61-72页

作者： Yi ZHU Yishuai GENG Yun LI Jipeng QIANG Xindong WU School of Information Engineering Yangzhou UniversityYangzhou 225127China Key Laboratory of Knowledge Engineering with Big Data(Ministry of Education of the People’s Republic of China) Hefei University of TechnologyHefei 230009China School of Computer Science and Information Engineering Hefei University of TechnologyHefei 230009China

Nowadays,the personalized recommendation has become a research hotspot for addressing information *** this,generating effective recommendations from sparse data remains a ***,auxiliary information has been widely used to address data sparsity,but most models using auxiliary information are linear and have limited *** to the advantages of feature extraction and no-label requirements,autoencoder-based methods have become quite ***,most existing autoencoder-based methods discard the reconstruction of auxiliary information,which poses huge challenges for better representation learning and model *** address these problems,we propose Serial-Autoencoder for Personalized Recommendation(SAPR),which aims to reduce the loss of critical information and enhance the learning of feature ***,we first combine the original rating matrix and item attribute features and feed them into the first autoencoder for generating a higher-level representation of the ***,we use a second autoencoder to enhance the reconstruction of the data representation of the prediciton rating *** output rating information is used for recommendation *** experiments on the MovieTweetings and MovieLens datasets have verified the effectiveness of SAPR compared to state-of-the-art models.

关键词： personalized recommendation autoencoder representation learning collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Query-aware complex object buffer management in XML information retrieval

Query-aware complex object buffer management in XML informat...

引用

12th International Asia Pacific Web Conference, APWeb 2010

作者： Li, Qiushi Wang, Qiuyue Wang, Shan Key Laboratory of the Ministry of Education for Data Engineering and Knowledge Engineering China School of Information Renmin University of China Beijing 100872 China

ISBN: (纸本)9780769540122

in this paper, we analyse the data access characteristics of a typical XML information retrieval system and propose a new query aware buffer replacement algorithm based on prediction of Minimum Reuse Distance (MRD for short). The algorithm predicts an object's next reference distance according to the retrieval system's running status and replaces the objects that have maximum reuse distances. The factors considered in the replacement algorithm include the access frequency, creation cost, and size of objects, as well as the queries being executed. By taking into account the queries currently running or queuing in the system, MRD algorithm can predict more accurately the reuse distances of index data objects. © 2010 IEEE.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

Research on government information sharing model using blockchain technology 10

Research on government information sharing model using block...

引用

10th International Conference on Information Technology in Medicine and Education, ITME 2019

作者： Zhang, Yiwei Deng, Sanhong Zhang, Yue Kong, Jia School of Information Management Nanjing University Jiangsu Key Laboratory of Data Engineering and Knowledge Service. Nanjing China

ISBN: (纸本)9781728139173

Research Purpose: The distributed, traceable and security of blockchain technology are applicable to the construction of new government information resource models, which could eliminate the barn effect and trust in government information sharing, as well as promoting the transformation of government affairs from management to service, it is also of great significance to the sharing of government information and construction of service-oriented e-government. Propose Methods: By analyzing the current problems of government information sharing, combined with literature research, this paper proposes the theoretical framework and advantages of blockchain technology applied to government information management and sharing, expounds the blockchain-based solution, it also constructs a government information sharing model based on blockchain, and gives implementation strategies at the technical and management levels. Results and Conclusion: The government information sharing model based on the blockchain solution and the transparency of government information can be used as a research framework for information interaction analysis between the government and users. It can also promote the construction and development of information sharing for Chinese government, as well as providing unified information sharing solution at the departmental and regional levels for e-government. © 2019 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Face micro-expression recognition algorithm based on ResNet depth model 8

Face micro-expression recognition algorithm based on ResNet ...

引用

8th International Conference on Intelligent Computing and Signal Processing, ICSP 2023

作者： Wang, Liquan Zhan, Shu Hefei University of Technology Key Laboratory of Big Data Knowledge Engineering Ministry of Education School of Computer and Information Engineering Hefei China

ISBN: (纸本)9798350302455

Micro Expression (ME) is the subtle facial expressions that people show when they express their inner feelings. To address the problem that micro-expression recognition is difficult and less accurate due to the small number of samples and uneven distribution of different categories, we propose a model framework to improve the accuracy of micro-expression recognition. The peak frames containing more key expression information in the micro-expression video sequences are extracted;SE-ResNeXt-50, an improved residual network with SE module, is used to extract features from the peak frames of micro-expressions, where the SE module can better learn the key information in the features, and ResNeXt simplifies the structure by replacing the dense structure with the sparse structure through group convolution, which improves the recognition efficiency. The recognition efficiency is improved by replacing the dense structure with the sparse structure by group convolution. At the same time, the Focal Loss loss function can better solve the model performance problem caused by the imbalance of micro-expression data. Simulation experiments are conducted on the micro-expression dataset CASME, and it is found that the improved residual network and peak frame improve the accuracy and F1 value of micro-expression recognition. The improved residual network and peak frame can reduce the effect of small data set, make the model have good fitting effect, and improve the performance of different categories, improve the recognition accuracy of micro-expressions, and have better recognition performance for micro-expression recognition. © 2023 IEEE.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

I-mRMR: Incremental max-relevance, and min-redundancy feature selection 3rd

I-mRMR: Incremental max-relevance, and min-redundancy featur...

引用

3rd APWeb and WAIM Joint Conference on Web and Big data, APWeb-WAIM 2019

作者： Xiu, Yeliang Zhao, Suyun Chen, Hong Li, Cuiping Information of School Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education Beijing China

ISBN: (纸本)9783030260743

An incremental method of feature selection based on mutual information, called incremental Max-Relevance, and Min-Redundancy (I-mRMR), is presented. I-mRMR is an incremental version of Max-Relevance, and Min-Redundancy feature selection (mRMR), which is used to handle streaming data or large-scale data. First, Incremental key Instance Set is proposed which composes of the non-distinguished instances by the historical selected features. Second, an incremental feature selection algorithm is designed in which the incremental key instance set, replacing of all the seen instances so far, is used in the process of adding representative features. Since the Incremental key Instance Set is far less than the whole instances, the incremental feature selection by using this key set avoids redundant computation and save computation time and space. Finally, the experimental results show that I-mRMR could significantly or even dramatically reduce the time of feature selection with an acceptable classification accuracy. © 2019, Springer Nature Switzerland AG.

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

Publish me and protect me: Personalized and flexible location privacy protection in mobile social networks 23

Publish me and protect me: Personalized and flexible locatio...

引用

23rd IEEE International Symposium on Quality of Service, IWQoS 2015

作者： Wu, Yao Peng, Hui Zhang, Xiaoying Chen, Hong Li, Cuiping Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education Beijing China School of Information Renmin University of China Beijing China

ISBN: (纸本)9781467371131

With the increasing proliferation of the Mobile Social Networks (MSN) and the Location Based Service (LBS), location privacy has attracted broad attention in recent years. Most researches have been done with the assumption that the server is untrusted and a trusted third party is introduced to protect the user location privacy when a user sends queries for the location service. In this paper, we reconsider this assumption and propose a Personalized and Flexible location privacy protection Model (PFM) based on user relationship strength. We conduct researches in the situation that the server is trusted while malicious users in the MSN can disguise as a friend to break location privacy. We present an entropic TF-IDF based approach to measure the bi-directional relationship strength and propose probability distribution based cloaking model to protect user location privacy. We thoroughly evaluate our methods based on Quality of Privacy (QoP) via real and synthetic data. © 2015 IEEE.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

Efficient SPARQL query evaluation via automatic data partitioning

Efficient SPARQL query evaluation via automatic data partiti...

引用

18th International Conference on database Systems for Advanced Applications, DASFAA 2013

作者： Yang, Tao Chen, Jinchuan Wang, Xiaoyan Chen, Yueguo Du, Xiaoyong School of Information Renmin University of China China Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE China

ISBN: (纸本)9783642374494

The volume of RDF data increases very fast within the last five years, e.g. the Linked Open data cloud grows from 2 billions to 50 billions of RDF triples. With its wonderful scalability, cloud computing platform like Hadoop is a good choice for processing queries over large data sets. Previous works on evaluating SPARQL queries with Hadoop mainly focus on reducing the number of joins through careful split of HDFS files and algorithms for generating Map/Reduce jobs. However, the way of partitioning RDF data could also affect the performance. Specifically, a good partitioning will greatly reduce or even totally avoid cross-node joins and significantly reduce the cost of query evaluation. Based on HadoopDB, this work processes SPARQL queries in a hybrid architecture where Map/Reduce takes charge of the computing tasks and an RDF query engine, RDF-3X, stores the data and evaluates join operations over local data. Based on analysis of query work-loads, we propose a novel algorithm for automatically partitioning RDF data. We also present an approximate solution to physically place the partitions in order to reduce data redundancy. All the proposed approaches are evaluated by extensive experiments over large RDF data sets. © Springer-Verlag 2013.

关键词： Resource Description Framework (RDF)

来源：评论

学校读者我要写书评

暂无评论

Research on Visualization Algorithm of Association Rules Based on Concept Lattice

Research on Visualization Algorithm of Association Rules Bas...

引用

2020 International Conference on Cyberspace Innovation of Advanced Technologies, CIAT 2020

作者： Shen, Xiajiong Bao, Lijie Zhang, Lei Institute of Data and Knowledge Engineering Henan University Kaifeng China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng China

ISBN: (纸本)9781450387828

The traditional association rule representation method has no way to show the essential relationship between concepts and lacks understanding of the concept level. Concept lattice is a kind of data structure which can show the relationship between concepts, concept lattice also has unique advantages in the visualization and discovery of potential knowledge of association rules. In this paper, a visualization algorithm of association rules based on concept lattice is proposed. The algorithm visually displays the association rules extracted from concept lattice. Finally, this article combines the chronic disease record data of a certain hospital to analyze and visualize the association rules. The implementation results show that the visualization method has good effects in knowledge analysis and data display. © 2020 ACM.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Research on Penetration Strategy of UAV

Research on Penetration Strategy of UAV

引用

2020 International Conference on Cyberspace Innovation of Advanced Technologies, CIAT 2020

作者： Han, Daojun Xiang, Hongzhen Chen, Haolin Xie, Yi Institute of Data and Knowledge Engineering Henan University Kaifeng China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng China

ISBN: (纸本)9781450387828

Taking a military operation as an example, this paper makes an in-depth study of what tactics a single UAV should adopt when facing the interception of multiple enemy UAV groups. According to the analysis of the impact diagram, the aerial range of the UAV standoff defines a threat area, that is, when the UAV arrives at the threat area, it needs to adopt a strategy for penetration, or it will be intercepted. The strategy adopted by UAV in the threat area is analyzed, and the decision control method is made. © 2020 ACM.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：