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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8933卷 213-226页

作者： Zou, Benyou Lan, Mengwei Li, Cuiping Tan, Liwen Chen, Hong Key Lab of Data Engineering and Knowledge Engineering of MOE Renmin University of China Beijing100872 China School of Information Renmin University of China Beijing100872 China

Recommender system plays an important role in many practical applications that help users to deal with information overload and provide personalized recommendations to them. The context in which a choice is made has been recognized as an important factor for recommendation systems. Recently, researchers extend the classical matrix factorization and allows for a generic integration of contextual information by modeling the data as a tensor. However, current tensor factorization methods suffer from the limitation that the computing cost can be very high in practice. In this paper, we propose GALS, a GPU based parallel tensor factorization algorithm, to accelerate the tensor factorization on large data sets to support the efficient context-aware recommendation. Experiments show that the proposed method can achieve 10 times faster than the current tensor factorization methods. © Springer International Publishing Switzerland 2014.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Location-based recommendation using incremental tensor factorization model

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8933卷 227-238页

作者： Zou, Benyou Zou, Benyou Li, Cuiping Tan, Liwen Tan, Liwen Chen, Hong Key Lab of Data Engineering and Knowledge Engineering of MOE Renmin University of China Beijing100872 China School of Information Renmin University of China Beijing100872 China

Newly emerging location-based online social services, such as Meetup and Douban, have experienced increased popularity and rapid growth. The classical Matrix Factorization methods usually only consider the user-item matrix. Recently, Researchers have extended the matrix adding location context as a tensor and used the Tensor Factorization methods for this scenario. However, in real scenario, the users and events are changing over time, the classical Tensor Factorization methods suffers the limitation that it can only be applied for static settings. In this paper, we propose a general Incremental Tensor Factorization model, which models the appearance changes of a tensor by adaptively updating its previous factorized components rather than recomputing them on the whole data every time the data changed. Experiments show that the proposed methods can offer more effective recommendations than baselines, and significantly improve the efficiency of providing location recommendations. © Springer International Publishing Switzerland 2014.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

Contrastive Coding for Active Learning under Class Distribution Mismatch

Contrastive Coding for Active Learning under Class Distribut...

引用

International Conference on Computer Vision (ICCV)

作者： Pan Du Suyun Zhao Hui Chen Shuwen Chai Hong Chen Cuiping Li Key Lab of Data Engineering and Knowledge Engineering of MOE Renmin University of China Beijing China Renmin University of China Beijing China

ISBN: (纸本)9781665428132

Active learning (AL) is successful based on the assumption that labeled and unlabeled data are obtained from the same class distribution. However, its performance deteriorates under class distribution mismatch, wherein the un-labeled data contain many samples out of the class distribution of labeled data. To effectively handle the problems under class distribution mismatch, we propose a contrastive coding based AL framework named CCAL. Unlike the existing AL methods that focus on selecting the most informative samples for annotating, CCAL extracts both semantic and distinctive features by contrastive learning and combines them in a query strategy to choose the most informative un-labeled samples with matched categories. Theoretically, we prove that the AL error of CCAL has a tight upper bound. Experimentally, we evaluate its performance on CIFAR10, CIFAR100, and an artificial cross-dataset that consists of five datasets; consequently, CCAL achieves state-of-the-art performance by a large margin with remarkably lower annotation cost. To the best of our knowledge, CCAL is the first work related to AL for class distribution mismatch.

关键词： Computer vision Costs Upper bound Annotations Semantics Text categorization Computer architecture

来源：评论

学校读者我要写书评

暂无评论

An Economic Semantic Web Platform

An Economic Semantic Web Platform

引用

International Conference on Grid and Cooperative Computing Workshops (GCCW)

作者： Xiaoyong Du He Hu Man Li Wenjuan Wu Guo Qin Key Laboratory of Data Engineering and Knowledge Engineering MOE School of Information Renmin University of China Beijing China

The paper describes an ongoing project which implements a subject-oriented semantic Web platform at Renmin Univ. of China. The economic semantic Web platform (ESWP) contains three components: collaborative ontology developing environment and repository system (CODERS); economic ontology annotation Web services (ConAnnotator); economic ontology and annotated resources. We describe each of these components in detail and illustrate some use cases of the ESWP

关键词： Semantic Web Ontologies Environmental economics Web services Collaboration Humans Software agents Application software Helium laboratories

来源：评论

学校读者我要写书评

暂无评论

Efficient approximation of the maximal preference scores by lightweight cubic views

Efficient approximation of the maximal preference scores by ...

引用

15th International Conference on Extending database Technology, EDBT 2012

作者： Chen, Yueguo Cui, Bin Du, Xiaoyong Tung, Anthony K. H. Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE China Department of Computer Science Peking University Beijing China School of Information Renmin University of China Beijing China School of Computing National University of Singapore Singapore Singapore

ISBN: (纸本)9781450307901

Given a multi-features data set, a best preference query (BPQ) computes the maximal preference score (MPS) that the tuples in the data set can achieve with respect to a preference function. BPQs are very useful in applications where users want to efficiently check whether many individual data sets contain tuples that are of interest to them. Although a BPQ can be naïvely answered by issuing a top-1 query and computing the score from the returned tuple, doing so might require to load a larger number of tuples externally. In this paper, we address the problem of efficient processing BPQs by using lightweight cubic (3-dimensional) views. With these in-memory views, the MPSs of BPQs can be efficiently estimated with an error bound guaranteed, by paying only a small number of I/Os. Extensive experimental results over real-life data sets show that our approximate solution can achieve the efficiency of up to three orders of magnitude compared to exact solutions, with certain accuracy guaranteed. © 2012 ACM.

关键词： best preference score materialized views preference query top-k query

来源：评论

学校读者我要写书评

暂无评论

Page Query Language Generation for Structural Extraction

Page Query Language Generation for Structural Extraction

引用

The 2014 10th International Conference on Natural Computation (ICNC 2014) and the 2014 11th International Conference on Fuzzy Systems and knowledge Discovery (FSKD 2014)(第十届自然计算和第十一届模糊系统与知识发现国际会议)

作者： He Hu Xiaoyong Du School of Information Renmin University of China Key Laboratory of Data Engineering and Knowledge EngineeringMOE BeijingChina

ISBN: (纸本)9781479951499

The information on the Web is usually fabricated to be understandable by human users rather than ***'s not easy to automatically catalogue and extract the Web information solely with a software *** on these observations,we present an approach that uses human guided operations to automatically generate a PQL query,a SQL like query language focusing on Web pages,to extract the interested information fragments on Web *** PQL query uses XPath expressions to locating the target HTML *** develop a K-Medoid clustering algorithm to process PQL queries to generate the structural *** extracted information is structured as a relational table(in CSV format)which can be manipulated smoothly with spreadsheet software or a relational DBMS system.

关键词： PQL Structural Extraction Browser Extension

来源：评论

学校读者我要写书评

暂无评论

Optimizing Random Access to Hierarchically-Compressed data on GPU

Optimizing Random Access to Hierarchically-Compressed Data o...

引用

Supercomputing Conference

作者： Feng Zhang Yihua Hu Haipeng Ding Zhiming Yao Zhewei Wei Xiao Zhang Xiaoyong Du Key Laboratory of Data Engineering and Knowledge Engineering (MOE) School of Information Renmin University of China Beijing China

ISBN: (纸本)9781665454452

GPU's powerful computational capacity holds great potentials for processing hierarchically-compressed data without decompression in data science domain. Unfortunately, existing GPU approaches offer only traversal-based data analytics; random access is extremely inefficient, substantially limiting their utility. To solve this problem, we develop a novel and broadly applicable optimization that enables efficient random access to hierarchically-compressed data without decompression in GPU memory. We address three major challenges for enabling efficient random access to compressed data on GPUs. The first challenge is designing GPU data structures that support random access. The second challenge is efficiently generating data structures on GPU. Generating data structures for random access is costly on the CPU, and the inefficiency increases dramatically when PCIe data transmission is incorporated. The third challenge is query processing on compressed data in GPU memory. Random accesses, including data updates, result in significant conflicts between massive threads. To solve the first challenge, we propose and modify a number of compressed data structures, including indexing within the complicated GPU memory hierarchy. To address the second challenge, we develop a two-phase process for generating these data structures on the GPU. To handle the third challenge, we propose a double-parsing design to avoid data conflicts. We evaluate our solution on two GPU platforms using five real-world datasets. Experiments show that the random access operations on GPU can achieve 65.04x average speedup compared to the state-of-the-art method.

关键词： Limiting Query processing Instruction sets High performance computing Memory management Graphics processing units data science

来源：评论

学校读者我要写书评

暂无评论

Ngram2vec: Learning improved word representations from ngram co-occurrence statistics

Ngram2vec: Learning improved word representations from ngram...

引用

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

作者： Zhao, Zhe Liu, Tao Li, Shen Li, Bofang Du, Xiaoyong School of Information Renmin University of China China Key Laboratory of Data Engineering and Knowledge Engineering MOE China Institute of Chinese Information Processing Beijing Normal University China UltraPower-BNU Joint Laboratory for Artificial Intelligence Beijing Normal University China

ISBN: (纸本)9781945626838

The existing word representation methods mostly limit their information source to word co-occurrence statistics. In this paper, we introduce ngrams into four representation methods: SGNS, GloVe, PPMI matrix, and its SVD factorization. Comprehensive experiments are conducted on word analogy and similarity tasks. The results show that improved word representations are learned from ngram co-occurrence statistics. We also demonstrate that the trained ngram representations are useful in many aspects such as finding antonyms and collocations. Besides, a novel approach of building co-occurrence matrix is proposed to alleviate the hardware burdens brought by ngrams. © 2017 Association for Computational Linguistics.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Computing Degree of Association Based on Different Semantic Relationships

Computing Degree of Association Based on Different Semantic ...

引用

International Workshop on database and Expert Systems Applications

作者： Xuan Tian Xiaoyong Du Haihua Li School of Information Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China Beijing China

In domain ontologies, there is usually no weight assigned to the link between two concepts. This has been considered as one of main obstacles in using ontologies. Semantic Association (SA) is to depict the correlation of two concepts, and can be measured as the weight of the link. In this paper, we defined Degree of Association (DOA) to measure SA from a concept to its direct-related concept in domain ontology, and proposed a Language-Model-Based Method (LMBM) to compute DOA. Our idea comes from the intuition that the semantic relationship between two concepts implies certain semantic association of them. We took probabilistic model for computing DOA, and used Maximum Likelihood Estimation to estimate parameters. We tested the proposed method on two different domain ontologies, and applied it in experiments of semantic query expansion. Experimental results show the benefit of our approach and demonstrate the promising effectiveness over semantic query expansion.

关键词： Ontologies Information retrieval Direction of arrival estimation Parameter estimation data mining databases Expert systems Computer applications laboratories data engineering

来源：评论

学校读者我要写书评

暂无评论

Geometric Routing Precluding Loops and Dead Ends in 3-D Wireless Sensor Networks

Geometric Routing Precluding Loops and Dead Ends in 3-D Wire...

引用

2010 IEEE Global Telecommunications Conference GLOBECOM 2010

作者： Jun Duan Deying Li Wenping Chen Key Laboratory of Data Engineering and Knowledge Engineering MOE School of Information Renmin University of China Beijing China

Numerous algorithms on geometric networks has been studied, and most of them were based on 2-dimensional networks. But 2-dimensional geometric routing algorithms cannot be directly adapted to the 3-dimensional networks. In this paper, we propose routing algorithms based on the iteration of specific angles on the networks of Delaunay Triangulation in 3D space, and prove the certainty of data transmission of our routing algorithms. In the algorithms, the messages only need to carry information of O(1) nodes and each node just keeps 1-hop neighbors' information.

关键词： Routing Peer to peer computing Three dimensional displays Algorithm design and analysis Compass Wireless sensor networks Relays

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：