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

Ontology-based Categorization of Web Search Results Using YAGO

Ontology-based Categorization of Web Search Results Using YA...

The Second International Joint Conference on Computational Science and Optimization(CSO 2009)(2009 国际计算科学与优化会议)

作者： Anjian Ren Xiaoyong Du Puwei Wang Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China Beijing 100782 China

One of the major limitations of current search engines is that users could not quickly locate what they want if the input query is too general. Some existing techniques try to cluster web search results into groups so as to user's quick browsing. In this paper, we present a new approach to categorize the web search results by using YAGO ontology. It utilizes the YAGO ontology to automatically generate categories for the user's specific query and classify the search results into appropriate categories. Our experimental results indicate that our method is feasible and effectiveness.

关键词： Ontologies Web search Feedback Image retrieval Information retrieval Image databases Humans Set theory Information systems Radio frequency

来源：评论

学校读者我要写书评

暂无评论

Efficient Algorithm for Computing Link-Based Similarity in Real World Networks

Efficient Algorithm for Computing Link-Based Similarity in R...

引用

IEEE International Conference on data Mining (ICDM)

作者： Yuanzhe Cai Gao Cong Xu Jia Hongyan Liu Jun He Jiaheng Lu Xiaoyong Du Key Laboratories of Data Engineering and Knowledge Engineering Ministry of Education China Department of Computer Science Renmin University of China China Department of Computer Science University of Aalborg Denmark Department of Management Science and Engineering Tsinghua University China

Similarity calculation has many applications, such as information retrieval, and collaborative filtering, among many others. It has been shown that link-based similarity measure, such as SimRank, is very effective in characterizing the object similarities in networks, such as the Web, by exploiting the object-to-object relationship. Unfortunately, it is prohibitively expensive to compute the link-based similarity in a relatively large graph. In this paper, based on the observation that link-based similarity scores of real world graphs follow the power-law distribution, we propose a new approximate algorithm, namely Power-SimRank, with guaranteed error bound to efficiently compute link-based similarity measure. We also prove the convergence of the proposed algorithm. Extensive experiments conducted on real world datasets and synthetic datasets show that the proposed algorithm outperforms SimRank by four-five times in terms of efficiency while the error generated by the approximation is small.

关键词： Computer networks Collaboration data engineering knowledge engineering Computer science Iterative algorithms Filtering data mining Helium Computer science education

来源：评论

学校读者我要写书评

暂无评论

Incremental computation for MEDIAN cubes in what-if analysis

Incremental computation for MEDIAN cubes in what-if analysis

引用

Joint International Conference on Advances in data and Web Management, APWeb/WAIM 2009

作者： Xiao, Yanqin Zhang, Yansong Wang, Shan Chen, Hong Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China MOE Beijing 100872 China School of Information Renmin University of China Beijing 100872 China Computer Center Hebei University Baoding Hebei 071002 China Department of Computer Science Harbin Finance College Harbin 150030 China

ISBN: (纸本)9783642006715

What-if analysis is an important type of DSS analysis processing procedure. It analyzes hypothetical scenarios based on historical data. The data cube view must be updated when the what-if condition is changed. Since source data must be kept in order to compute the new aggregate value when new tuples are inserted or deleted, in what-if analysis, incrementally computing a data cube for holistic aggregation functions is a difficult problem. In this paper, we adopt delta cube strategy and work area technique to incrementally compute data cube for MEDIAN function. The size of work area has important influence on the efficiency of the incremental computing. This paper optimizes the size of work area based on the number and the cardinality of dimension attributes of the cuboid. Performance study shows that our algorithms are effective over large databases. © Springer-Verlag Berlin Heidelberg 2009.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Efficient incremental computation of CUBE in multiple versions what-if analysis

Efficient incremental computation of CUBE in multiple versio...

引用

Joint International Conference on Advances in data and Web Management, APWeb/WAIM 2009

ISBN: (纸本)9783642006715

What-if analysis is an important method to analyze the hypothetical scenarios based on the historical data. It provides useful information for the decision- maker. Multiple versions are critical to what-if analysis. In this paper, we analyze the problem of multiple versions data processing and the incremental computation of cubes in what-if analysis, proposing a strategy to process multiple versions of what-if data. Our solution can adopt different data processing methods according to the type of aggregate functions, the efficiency of multiple versions data processing is improved. Furthermore, we proposes an algorithm of incremental computation of CUBE for max(min) function to reduce the access time of fact table, and the experimental results showed that the performance is improved about 10%. © Springer-Verlag Berlin Heidelberg 2009.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Generating multi-page mirror site from ajax interfaces

引用

Journal of Information and Computational Science 2009年第2期6卷 985-991页

作者： Xia, Tian Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China Beijing 100872 China School of Information Resource Management Renmin University of China Beijing 100872 China

Ajax is an important approach for improving rich interactivity between web server and end users during Web 2.0 eras. At the same time, AJAX web pages can not be indexed by search engines due to its asynchronous loading. In this paper, we propose a technique for generating the traditional multi-page mirror site from the AJAX based web pages. Firstly, a page state structure to represent any dynamic state of Ajax page is defined, and a states repository is proposed to store the different states. Secondly, each state is fetched from repository and rendered by an embedded browser to get the dynamic DOM, and the click events of candidate clickable elements are fired, then new states are created and stored to repository. Finally, page states are linked and transformed into static HTML files. Experimental results show that mirroring Ajax sites is feasible, though there still have some limitations need to be improved later. Copyright ©2009 Binary Information Press.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

The tradeoff of delta table merging and re-writing algorithms in what-if analysis application

The tradeoff of delta table merging and re-writing algorithm...

引用

Joint International Conference on Advances in data and Web Management, APWeb/WAIM 2009

作者： Zhang, Yansong Zhang, Yu Xiao, Yanqin Wang, Shan Chen, Hong Key Laboratory of the Ministry of Education for Data Engineering and Knowledge Engineering Renmin University of China Beijing 100872 China School of Information Renmin University of China Beijing 100872 China Department of Computer Science Harbin Finance College Harbin 150030 China Computer Center Hebei University Baoding Hebei 071002 China

ISBN: (纸本)9783642006715

What-if analysis can provide more meaningful information than classical OLAP. Multi-scenario hypothesis based on historical data needs efficient what-if data view support. In general, delta table for what-if analysis is more general than other solutions such as query re-writing prototype of Sesame. Delta table is independent of base table and is more suitable to represent complex hypothetical updates and multi-version hypothetical updates. Due to low efficiency of traditional delta table merging algorithm which is based on set operation, there are few researches focus on delta table merging algorithm but on query re-writing algorithm. By analyzing the difference between what-if query and what-if analysis and improving the delta table merging algorithm, we propose novel algorithms without set operation of difference. Considering the feature of aggregate operations in OLAP analysis, pre-merge algorithm is presented without the generation of what if data view before group-bys in the scenario of SUM, AVERAGE and COUNT function OLAP queries. In our experiments, the pre-merge algorithm greatly improved the efficiency of delta table merging procedure which is close to base group-by statement and superior to the re-writing algorithm. A complete comparison between all candidate delta table merging algorithms and re-writing algorithm with different what-if update conditions of update, deletion, insertion and mixed what-if updates is exhibited in our experiments, the policy of what-if analysis among different types is also discussed. © Springer-Verlag Berlin Heidelberg 2009.

关键词： Merging

来源：评论

学校读者我要写书评

暂无评论

Predictable recovery for replication real-time main memory databases using request logs

引用

Journal of Information and Computational Science 2009年第3期6卷 1607-1614页

作者： Liao, Guoqiong Li, Jing School of Information Technology Jiangxi University of Finance and Economics Nanchang 330013 China Jiangxi Key Laboratory of Data and Knowledge Engineering Nanchang 330013 China

Reliable telecommunication applications in future need the supports from replication real-time main memory databases. In order to improve recovery performance and provide predictable recovery, this paper proposes a new recovery method using request logs for the databases. Firstly, the format and correctness of request logs are discussed. Then, a recovery model based on request logs is given. Thirdly, the recovery algorithms for local recovery and resynchronization are provided in details. At last, a formula to estimate denial-of-service time (DoS) is presented for predictable recovery. 1548-7741/ Copyright © 2009 Binary Information Press.

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

Managing data provenance in database

引用

Journal of Information and Computational Science 2009年第1期6卷 423-431页

作者： Liu, Xiping Wan, Changxuan Jiang, Tengjiao School of Information Technology Jiangxi University of Finance and Economics Nanchang 330013 China Jiangxi Key Laboratory of Data and Knowledge Engineering Nanchang 330013 China

The paper studies the management problem of data provenance. Firstly, two data models, which enhance the traditional relational model and tree model, are proposed to reveal the basic nature of data provenance. To answer the new challenges to data management posed by data provenance, DBPro, a new database with the ability of managing both data and provenance, is introduced. The storage of data provenance is a core problem in designing DBPro, which is coped with two storage schemes. The comparison between these two storage schemes is also conducted. © 2009 Binary Information Press.

关键词： database systems

来源：评论

学校读者我要写书评

暂无评论

Dynamic programming based top-k aggregate queries in uncertain database

引用

Journal of Information and Computational Science 2009年第3期6卷 1589-1596页

作者： Liu, Dexi School of Information Technology Jiangxi University of Finance and Economics Nanchang 330013 China Jiangxi Key Laboratory of Data and Knowledge Engineering Nanchang 330013 China

A Top-k aggregate query ranks groups of tuples by their aggregate values, sum or average for example, and returns k groups with the highest aggregate values. We propose a dynamic programming based method to process uncertain kRanks aggregate queries in uncertain database, where the number of retrieved tuples and group states generated on these tuples are minimized. Our method has two levels, group state generation and U-x-kRanks query processing. In the former level, group states, which satisfy the properties of x-tuple [13], are generated one after the other according to their aggregate values, while in the latter level, dynamic programming based uncertain x-tuple kRanks query processing [15] are employed to return the answers. Comprehensive experiments on different data sets demonstrate the effectiveness of the proposed solutions. 1548-7741/ Copyright © 2009 Binary Information Press.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Interference and power constrained Broadcasting and Multicasting in wireless ad hoc networks with directional antennas

Interference and power constrained Broadcasting and Multicas...

引用

IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems (MASS)

作者： Zheng Li Deying Li Ming Liu Key Laboratory of Data Engineering and Knowledge Engineering MOE School of Information Renmin University of China China School of Computer Science and Engineering University of Electronic Science and Technology Chengdu China

ISBN: (纸本)9781424451142

Broadcasting/Multicasting problems have been well studied in wireless ad hoc networks. However, only a few approaches take into account the low interference and energy efficiency as the optimization objective simultaneously. In this paper, we study the interference and power constrained broadcast/multicast and the delay-bounded interference and power constrained broadcast/multicast routing problems in wireless ad hoc networks using directional antennas. We propose an approximation and a heuristic algorithm for the two problems, respectively. Importantly, motivated by the study of above optimization problems, we propose approximation schemes for two multi-constrained directed Steiner tree problems, respectively. Broadcast/Multicast message by using the trees found by our algorithms tend to have less channel collisions and higher network throughput. The theoretical results are corroborated by simulation studies.

关键词： Interference constraints Broadcasting Mobile ad hoc networks Directional antennas Multicast algorithms Energy efficiency Routing Approximation algorithms Heuristic algorithms Throughput

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：