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

10th IASTED International Conference on Web-Based Education, WBE 2013

作者： Wang, Xiaoyan Chen, Jinchuan Du, Xiaoyong School of Information Renmin University of China Beijing China School of Information and Electrical Engineering Ludong University Shandong China Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing China

ISBN: (纸本)9780889869431

Modern educational theories, such as collaborative learning, constructivism and inquiry learning, have achieved many successes in real-world applications. Especially, with the development of information technologies, there have been several online collaborative learning platforms in practice. Unfortunately, as these platforms are either too complicated or too expensive, none of them are suitable for us in the practice of STEM+. Moreover, most of these platforms are in English, while we are using Chinese as our teaching language. Using an online collaborative learning platform (OCLP) named Zask, this paper reported our practice in online collaborative learning on course Introduction to database System. According to the data collected from the first round of our practice, it shows that users' active participations in Zask could benefit for both teaching and learning, and then provide positive effects in education.

关键词： Teaching

来源：评论

学校读者我要写书评

暂无评论

Cross-codebook image classification

Cross-codebook image classification

引用

14th Pacific-Rim Conference on Multimedia, PCM 2013

作者： Liao, Shuai Li, Xirong Du, Xiaoyong Key Lab of Data Engineering and Knowledge Engineering MOE China School of Information Renmin University of China Beijing 100872 China State Key Lab of Software Development Environment Beijing 100191 China

ISBN: (纸本)9783319037301

Representing images by bag of visual codes (BoVC) features has been the cornerstone of state-of-the-art image classification system. Since the BoVC features depend on a precomputed codebook in use, when the codebook applied to test images differs from the codebook of an existing image classification system, the system becomes inapplicable. To resolve the codebook incompatibility problem, we propose in this paper cross-codebook image classification. This is achieved by transforming BoVC features derived from one codebook to make them compatible with another codebook. Two BoVC transform methods, i.e., code-reassignment and least squares, are studied. Experiments on a popular image classification benchmark set show that both methods are better than random guess when crossing the codebooks. In particular, when the BoVC features are transformed from a higher dimension to a relatively small dimension, cross-codebook image classification has a similar performance compared to within-codebook image classification, with a relative performance loss of 1.3% only. The results justify the feasibility of the proposed cross-codebook image classification. © Springer International Publishing Switzerland 2013.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Renmin University of China at ImageCLEF 2013 scalable concept image annotation

Renmin University of China at ImageCLEF 2013 scalable concep...

引用

2013 Cross Language Evaluation Forum Conference, CLEF 2013

作者： Li, Xirong Liao, Shuai Liu, Binbin Yang, Gang Jin, Qin Xu, Jieping Du, Xiaoyong Key Lab of Data Engineering and Knowledge Engineering MOE Japan Multimedia Computing Lab School of Information Renmin University of China Zhongguancun Street 59 Beijing100872 China

In this paper we describe our image annotation system par ticipated in the ImageCLEF 2013 scalable concept image annotation task. The system leverages multiple base classifiers, including single feature and multi-feature kNN classifiers and histogram intersection ker nel SVMs, all of which are learned from the provided 250K web images and provided features with no extra manual verification. These base clas sifiers are combined into a stacked model, with the combination weights optimized to maximize the geometric mean of F-samples, F-concepts, and AP-samples metrics on the provided development set. By varying the configuration of the system, we submitted five runs. Evaluation re sults show that for all of our runs, model stacking with optimized weights performs best. Our system can annotate diverse Internet images purely based on the visual content, at the following accuracy level: F-samples of 0.290, F-concepts of 0.304, and AP-samples of 0.380. What is more, a system-to-system comparison reveals that our system and the best sub mission this year are complementary with respect to the best annotated concepts, suggesting the potential for future improvement.

关键词： Image annotation

来源：评论

学校读者我要写书评

暂无评论

Efficient querying of correlated uncertain data with cached results

Efficient querying of correlated uncertain data with cached ...

引用

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

作者： Chen, Jinchuan Zhang, Min Xie, Xike Du, Xiaoyong Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE China School of Information Renmin University of China China Department of Computer Science Aalborg University Denmark

ISBN: (纸本)9783642374869

Although there have been many efforts for management of uncertain data, evaluating probabilistic inference queries, a known NP-hard problem, is still a big challenge, especially for querying data with highly correlations. The state-of-art exact algorithms for accelerating the evaluation of inference queries are based on special indices. Besides, with the observation of the existence of many frequent queries, some researchers try to improve efficiency by reusing previously queried results. Indexing depends on the static properties like data distributions, whereas caching is in favor of the dynamic features like query workload. In this paper we propose a new approach for speeding up the evaluation of inference queries by caching frequent results in a junction tree-based hierarchical index. To the best of our knowledge, this is the first effort on utilizing both the static (data) and dynamic (query workload) properties to efficiently evaluate probabilistic inference queries. Moreover, according to our experience, different caching strategies may significantly affect the query performance. Basically a good caching strategy needs to have high cache hit ratio with limited space *** on these considerations, we propose a novel caching approach, called FVEC, and present corresponding algorithms for efficiently querying correlated uncertain data. We further conduct a series of extensive experiments on large uncertain datasets in order to illustrate the effectiveness and efficiency of our proposed approaches. As illustrated by the results, compared with previous solutions, our method could greatly improve the query performance. © Springer-Verlag 2013.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Synonyms weighted LDA for product aspects extraction

引用

International Journal of Applied Mathematics and Statistics 2013年第24期51卷 283-291页

作者： Peng, Yun Wan, Changxuan School of Information and Technology Jiangxi University of Finance and Economics Nanchang 330013 Jiangxi China Computer and Information Engineering College Jiangxi Normal University Nanchang 330022 Jiangxi China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang 330013 Jiangxi China

It is important to extract the aspects from the comments of shoppers about certain products. Product aspect descriptions often contain words of same meaning, and discriminating these synonyms effectively can improve the efficiency of aspects extraction. Standard topic model in identifying those words, because of the absent introduction of priori knowledge, will largely ignore the relations of words meaning. An improved aspects extracting model of LDA by adding synonymous words constraint is proposed in this paper. In the process of words clustering analysis, words with high similarity are aggregated in the same cluster. In the stage of aspects extraction, we introduce words clustering and cluster membership weights as priori knowledge to strengthen the original LDA topic model for features clustering, which can improve the accuracy of product aspects extraction. Our experiments show that synonyms weighted LDA proposed in this paper outperforms the original LDA by a large margin. © 2013 by CESER Publications.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Sparse Topic Model for text classification

Sparse Topic Model for text classification

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Tao Liu Key Laboratory of Data Engineering and Knowledge Engineering (Renmin University of China) MOE

ISBN: (纸本)9781479902590

This paper addresses a new text classification method: Sparse Topic Model, which represents documents by the sparse coding of topics. Topics contain more semantic information than words, so it's more effective for feature representation of documents. Topics are extracted from documents by LDA in an unsupervised way. Based on these topics, sparse coding is applied to discover more high-level representation. We compare the Sparse Topic Model with the traditional methods, such as SVM, and the experimental result show that the proposed method achieves better performance, especially when the number of training examples is limited. The effect of topic number and word number per topic on the performance is also investigated. Due to the unsupervised characteristic of Sparse Topic Model, it's very useful for real application.

关键词： Support vector machines Text categorization Abstracts Semantics Petroleum

来源：评论

学校读者我要写书评

暂无评论

An effective XML identifying feedback documents method based on two-stage ranking model for pseudo-relevance feedback

引用

2013 3rd International Symposium on Chemical engineering and Material Properties, ISCEMP 2013

作者： Zhong, Min Juan School of Information Technology Jiangxi University of Finance and Economics Nanchang China JiangXi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics Nanchang China

ISBN: (纸本)9783037858363

Although pseudo relevant feedback is an effective query expansion method, query drift away from the topic has been occurred frequently. Therefore, the first important problem is how to identify relevant documents in the top retrieved set and form the good feedback source. In this paper, an effective XML identifying feedback documents method is proposed, in which a two-stage ranking model is presented and the relevant XML documents are found. The experiment results show that the proposed method is reasonable and the quality of feedback source is ensured. © (2013) Trans Tech Publications, Switzerland.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

TinyQP: A query processing system in wireless sensor networks

TinyQP: A query processing system in wireless sensor network...

引用

14th International Conference on Web-Age Information Management, WAIM 2013

作者： Mo, Shangfeng Chen, Hong Zhang, Xiaoying Li, Cuiping Key Laboratory of Data Engineering and Knowledge Engineering of MOE Renmin University of China Beijing 100872 China School of Information Renmin University of China Beijing 100872 China Hunan University of Science and Technology Xiangtan 411201 China

ISBN: (纸本)9783642385612

Wireless Sensor Networks (WSNs) can be viewed as a new type of distributed databases. data management technology is one of the core technologies of WSNs. In this demo we show a Query Processing system based on TinyOS in WSNs, which is called TinyQP. TinyQP provides the in-network processing of several complex queries including real time query, historical query, event detection, aggregate query, top-k query, etc. TinyQP displays the network topology in a graphical way. TinyQP allows the user to remotely execute query commands and browse query result. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

MapReduce-Based SimRank Computation and Its Application in Social Recommender System

MapReduce-Based SimRank Computation and Its Application in S...

引用

IEEE International Conference on Services Economics (SE)

作者： Lina Li Cuiping Li Hong Chen Xiaoyong Du Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China Beijing China

Recently there has been a lot of interest in graph-based analysis, with examples including social network analysis, recommendation systems, document classification and clustering, and so on. A graph is an abstraction that naturally captures data objects as well as relationships among those objects. Objects are represented as nodes and relationships are represented as edges in the graph. There are many cases in which similarities among nodes are required to compute. SimRank is one of the simple and intuitive algorithms for this purpose. It is rigidly based on the random walk theorem. Existing methods on SimRank computation suffer from one limitation: the computing cost can be very high in practice. In order to optimize the computation of SimRank, a few techniques have been proposed. However, the performance of these methods are still limited by the processing ability of the single computer. Ideally, we would like to develop new parallel solutions that can offer improved processing power to compute SimRank on large data set. In this paper, we propose parallel algorithms for SimRank computation on Map-Reduce framework, and more specifically its open source implementation, Hadoop. Two different parallel methods are proposed and their performances are evaluated and compared. Furthermore, we employ the proposed methods to do the similarity computation in order to recommend appropriate products to users in social recommender systems.

关键词： Computers Iterative methods Recommender systems Computational modeling Parallel processing Equations Sorting

来源：评论

学校读者我要写书评

暂无评论

A new BP algorithm for network marketing performance evaluation of agricultural products

引用

Journal of Applied Sciences 2013年第20期13卷 4332-4335页

作者： Zou, Chun-Fang Huang, Li-Juan School of of Business Administration Jiangxi University of Finance and Economics 330013 Nanchang Jiangxi China School of Information Technology Jiangxi University of Finance and Economics 330013 Nanchang Jiangxi China Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics 330013 Nanchang Jiangxi China

Network marketing performance evaluation can sum up and improve the network marketing activities for network enterprises. So, how to evaluate network marketing performance has become a matter of concern in the field related. The study mainly takes agricultural products for example and presents a new algorithm for evaluating network marketing performance based on improved BP neural network algorithm. First, a evaluation indicator system for evaluating network marketing performance of agricultural products is constructed;Second the study analyzes the reasons of the defects of BP neural network algorithm and then designs a new BP algorithm and improves it through changing its learning rate to speed up the calculation and simplify the structure of the original BP algorithm;Finally, the improved algorithm is realized with three e_commerce enterprises are taken for examples to evaluate the network marketing performance and verify the validity and feasibility of the model and the experimental results show that the model can evaluate the network marketing performance of different enterprises practically. © 2013 Asian Network for Scientific Information.

关键词： Agricultural products

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：