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

International Conference on Management of e-Commerce and e-Government, ICMECG

作者： Wu Rui Liao Guoqiong Di Guoqiang School of Information Technology Jiangxi University of Finance and Economics Nanchang China School of Information Technology Jiangxi Key Laboratory of Data and Knowledge Engineering Nanchang China

Filtering redundancy data is an important task of radio frequency identification (RFID) middleware. In order to ensure RFID middleware can effectively filter the time redundant data and identify tagged object location change timely, this paper proposed a Temporal-Spatial bloom filter based on the sliding window model. The filter extends the one-dimension array in the standard bloom filter to a two-dimension array. Meanwhile, in order to guarantee the false positive rate doesn't increase due to the reason that the storage unit of the filter becomes full, we proposed a random decay strategy for deleting the expiration elements. The experimental results show that TSBF algorithm can filter time redundant data effectively and had a good performance to deal with location movement.

关键词： Radiofrequency identification Filtering algorithms Information filters data models Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Automatic data distribution in large-scale OLTP applications

International Journal of Database Theory and Application

引用

International Journal of database Theory and Application 2014年第4期7卷 37-46页

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

With the dramatic increase of data volume, automatic data distribution has been one of the key techniques and intractable problem for distributed systems. This work summarizes the problem of data distribution and abstracts it as a general triangle model called DaWN. Based on data and workload analysis, it presents a novel strategy called ADDS for automatic data distribution in OLTP applications. According to the results of a series of experiments over TPC-C datasets and transactions, the proposed approach shows effective improvements.© 2014 SERSC.

关键词： data handling

来源：评论

学校读者我要写书评

暂无评论

Improved head-driven statistical models for natural language parsing

引用

Journal of Central South University 2013年第10期20卷 2747-2752页

作者：袁里驰 School of Information Technology Jiangxi University of Finance and Economics Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics

Head-driven statistical models for natural language parsing are the most representative lexicalized syntactic parsing models, but they only utilize semantic dependency between words, and do not incorporate other semantic information such as semantic collocation and semantic category. Some improvements on this distinctive parser are presented. Firstly, "valency" is an essential semantic feature of words. Once the valency of word is determined, the collocation of the word is clear, and the sentence structure can be directly derived. Thus, a syntactic parsing model combining valence structure with semantic dependency is purposed on the base of head-driven statistical syntactic parsing models. Secondly, semantic role labeling(SRL) is very necessary for deep natural language processing. An integrated parsing approach is proposed to integrate semantic parsing into the syntactic parsing process. Experiments are conducted for the refined statistical parser. The results show that 87.12% precision and 85.04% recall are obtained, and F measure is improved by 5.68% compared with the head-driven parsing model introduced by Collins.

关键词： valence structure semantic dependency head-driven statistical syntactic parsing semantic role labeling

来源：评论

学校读者我要写书评

暂无评论

Top-k neighborhood dominating query

Top-k neighborhood dominating query

引用

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

作者： Xie, Xike Lu, Hua Chen, Jinchuan Shang, Shuo Department of Computer Science Aalborg University Denmark Key Labs of Data Engineering and Knowledge Engineering MOE Renmin University of China China

ISBN: (纸本)9783642374869

In many real-life applications, spatial objects are associated with multiple non-spatial attributes. For example, a hotel may have price and rating in addition to its geographic location. In traditional spatial databases, spatial objects are often ranked solely based on their distance to a given query location, e.g., in a nearest neighbor search. In another line of research, domination based skyline queries are used to return best objects according to multi-criteria on non-spatial attributes. In this paper, we study how to rank spatial objects with respect to their non-spatial attributes within their spatial neighborhoods. To enable a general ranking, we design a ranking function that inherits the advantages of dominance relationship and integrates them with spatial proximity. Further, we propose an effective index structure, and a branch and bound solution that executes the ranking efficiently via the index. We conduct extensive empirical studies on real and synthetic datasets. The results demonstrate the high efficiency of our proposal compared to straightforward alternatives. © Springer-Verlag 2013.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

Analyzing Information Needs of Elderly People: A Survey in Chinese Rural Community

Analyzing Information Needs of Elderly People: A Survey in C...

引用

2014年管理与服务科学国际学术会议

作者： Chunfang Zou Ping Zhou School of business administration Jiangxi University of Finance and Economics School of Information Technology Jiangxi University of Finance and Economics Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economics

A survey about the information needs of elderly people could find out the information required to address the needs of the aged in a community. Analyzing data collected from 600 elderly people through

关键词：

来源：评论

学校读者我要写书评

暂无评论

Mining user interests from information sharing behaviors in social media

引用

17th Pacific-Asia Conference on knowledge Discovery and data Mining, PAKDD 2013

作者： Wang, Tingting Liu, Hongyan He, Jun Du, Xiaoyong Key Labs. of Data Engineering and Knowledge Engineering China School of Information Renmin University of China 100872 China Department of Management Science and Engineering Tsinghua University 100084 China

ISBN: (纸本)9783642374555

Mining user interests and preference plays an important role for many applications such as information retrieval and recommender systems. This paper intends to study how to infer interests for new users and inactive users from social media. Although some recently proposed methods can mine user interests efficiently, these works cannot make full use of relationship between users in their social network. In this paper, we propose a novel approach to infer interests of new users or inactive users based on social connections between users. A random-walk based mutual reinforcement model combining both text and link information is developed in the approach. More importantly, we compare the contribution of different social connections such as "follow", "retweet", "mention", and "comment" to interest sharing. Experiments conducted on real dataset show that our method is effective and outperforms existing algorithms, and different social connections have different impacts on mining user interests. © Springer-Verlag 2013.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Detecting event rumors on Sina Weibo automatically

Detecting event rumors on Sina Weibo automatically

引用

15th Asia-Pacific Web Conference on Web Technologies and Applications, APWeb 2013

作者： Sun, Shengyun Liu, Hongyan He, Jun Du, Xiaoyong Key Labs. of Data Engineering and Knowledge Engineering China School of Information Renmin University of China 100872 China Department of Management Science and Engineering Tsinghua University 100084 China

ISBN: (纸本)9783642374005

Sina Weibo has become one of the most popular social networks in China. In the meantime, it also becomes a good place to spread various spams. Unlike previous studies on detecting spams such as ads, pornographic messages and phishing, we focus on identifying event rumors (rumors about social events), which are more harmful than other kinds of spams especially in China. To detect event rumors from enormous posts, we studied the characteristics of event rumors and extracted features which can distinguish rumors from ordinary posts. The experiments conducted on real dataset show that the new features are effective to improve the rumor classifier. Further analysis of the event rumors reveals that they can be classified into 4 different types. We propose an approach for detecting one major type, text-picture unmatched event rumors. The experiment demonstrates that this approach is well-performed. © 2013 Springer-Verlag.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Cost-based join algorithm selection in Hadoop

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年 8787卷 246-261页

作者： Gu, Jun Peng, Shu Wang, X. Sean Rao, Weixiong Yang, Min Cao, Yu School of Computer Science Fudan University Shanghai China Shanghai Key Laboratory of Data Science Fudan University Shanghai China School of Software Engineering Tongji University Shanghai China EMC Labs Tsinghua Science Park Beijing China

In recent years, MapReduce has become a popular computing framework for big data analysis. Join is a major query type for data analysis and various algorithms have been designed to process join queries on top of Hadoop. Since the efficiency of different algorithms differs on the join tasks on hand, to achieve a good performance, users need to select an appropriate algorithm and use the algorithm with a proper configuration, which is rather difficult for many end users. This paper proposes a cost model to estimate the cost of four popular join algorithms. Based on the cost model, the system may automatically choose the join algorithm with the least cost, and then give the reasonable configuration values for the chosen algorithm. Experimental results with the TPC-H benchmark verify that the proposed method can correctly choose the best join algorithm, and the chosen algorithm can achieve a speedup of around 1.25 times over the default join algorithm. © Springer International Publishing Switzerland 2014.

关键词： data handling

来源：评论

学校读者我要写书评

暂无评论

Efficient compressed index for top-k spatial keyword query

引用

Ruan Jian Xue Bao/Journal of Software 2014年 25卷 157-168页

作者： Zhou, Xin Zhang, Xiao An, Run-Gong Xue, Zhong-Bin Wang, Shan Key Laboratory of Data Engineering and Knowledge Engineering of the Ministry of Education Renmin University of China Beijing100872 China School of Information Renmin University Beijing100872 China

Location-Based services guide a user to find the object which provides services located in a particular position or region (e.g., looking for a coffee shop near a university). Given a query location and multiple keywords, location-based services return the most relevant objects ranked according to location proximity and text relevancy. Various hybrid indexes have been proposed in recent years which combine R-tree and inverted index to improve query efficiency. Unfortunately, the state-of-the-art approaches require more space in order to reduce response time. Cache mechanism is inefficient due to huge storage overhead. In this paper, a novel index based on index compressed technology (CSTI) is proposed, to answer top-k SKQ. CSTI significantly reduces storage overhead (by at least 80%), while maintaining efficient query performance. Extensive experiments based on real dataset and simulated dataset confirm CSTI is effective and efficient. ©2014 ISCAS.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

Distance-based feature selection from probabilistic data

Distance-based feature selection from probabilistic data

引用

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

作者： Zhao, Tingting Pei, Bin Zhao, Suyun Chen, Hong Li, Cuiping Key Lab of Data Engineering and Knowledge Engineering Ministry of Education China Department of Computer Science Renmin University of China China

ISBN: (纸本)9783642385612

Feature selection is a powerful tool of dimension reduction from datasets. In the last decade, more and more researchers have paid attentions on feature selection. Further, some researchers begin to focus on feature selection from probabilistic datasets. However, in the existing method of feature selection from probabilistic data, the distance hidden in probabilistic data is neglected. In this paper, we design a new distance measure to select informative feature from probabilistic databases, in which both the distance and randomness in the data are considered. And then, we propose a feature selection algorithm based on the new distance and develop two accelerative algorithms to boost the computation. Furthermore, we introduce a parameter into the distance to reduce the sensitivity to noise. Finally, the experimental results verify the effectiveness of our algorithms. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Random processes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：