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

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

来源：评论

学校读者我要写书评

暂无评论

Interval valued fuzzy rough classifier and its application on privacy protection

Interval valued fuzzy rough classifier and its application o...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Su-Yun Zhao Si Lin Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China Beijing China College of Science Beijing Forestry University Beijing China

Currently, most works on interval valued problems mainly focus on attribute reduction (i.e., feature selection) by using rough set technologies. However, less research work on classifier building on interval-valued problems has been conducted. It is promising to propose an approach to build classifier for interval-valued problems. In this paper, we propose a classification approach based on interval valued fuzzy rough sets. First, the concept of interval valued fuzzy granules are proposed, which is the crucial notion to build the reduction framework for the interval-valued databases. Second, the idea to keep the critical value invariant before and after reduction is selected. Third, the structure of reduction rule is completely studied by using the discernibility vector approach. After the description of rule inference system, a set of rules covering all the objects can be obtained, which is used as a rule based classifier for future classification. Finally, numerical examples are presented to illustrate feasibility and affectivity of the proposed method in the application of privacy protection.

关键词： Abstracts Diabetes Sonar Iris Accuracy

来源：评论

学校读者我要写书评

暂无评论

Generalized Unique Game Problem

Generalized Unique Game Problem

引用

2012年全国理论计算机科学学术年会(NCTCS2012)

作者： Peng Cui Key Laboratory of Data Engineering and Knowledge Engineering MOE School of Information Resource Management Renmin University of China Beijing 100872 P.R.China

this paper,the author defines Generalized Unique Game Problem (GUGP),where weights of the edges are allowed to be *** special types of GUGP are illuminated,GUGP-NWA,where the weights of all edges are negative,and GUGP-PWT(ρ),where the total weight of all edges are positive and the negative-positive ratio is at most ρ.

关键词：

来源：评论

学校读者我要写书评

暂无评论

引用

Journal of Convergence Information Technology 2012年第16期7卷 87-96页

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

With the increasing of XML data over the Internet, managing and analyzing huge amount of XML documents has played an important role for information management. Clustering as an intelligent technique has been utilized as an excellent way of grouping the documents by their content or structure. However, the key problem is how to measure similarity between XML documents. In this paper, we propose an extended vector space model and on this basis put forward an effective semantic similarity measurement method combining content and structure semantics, in which a variety of XML document features impacting similarity measurement, such as term element frequency, term inverse element frequency, semantic weight of tag and level information of the term, are analyzed. In addition, information gain, for clustering quality evaluation are introduced motivated by the fact that collection has no classification information in advance. Experiment results show that proposed similarity method (EVSM_SS) outperforms the content and structure integration measurement based on structure path (VSM_SP) as well as traditional document clustering measurement (CO) in information gain and produce better clustering quality.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

Combining term semantics with content and structure semantics for XML element search results clustering

引用

Journal of Convergence Information Technology 2012年第15期7卷 26-35页

The biggest characteristic of the XML retrieval is able to return the element node results. This paper studies XML element search results clustering and proposes one similarity measurement method based on term semantics, in which the "core" concept between terms is got through latent semantic indexing technology(LSI) and the same time the XML element node content and semantic structure properties(CASS) are combined. In addition, two new performance evaluation methodologies, namely R_ClusterRatio and R_DocuRatio are introduced to evaluate clustering quality. It is motivated by the observations of relevant documents distribution and the fact that the experiment data collection, IEEE CS corpus, do not provide classification information. Experiment results show that proposed similarity method combining term semantics with content and structure semantics integration(LSI-CASS) is feasible, and it produces better clustering quality than LSI-CAS and CASS.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Detecting Compromised Kernel Hooks with Support of Hardware Debugging Features

引用

China Communications 2012年第10期9卷 78-90页

作者： Shi Wenchang Zhou HongWei Yuan JinHui Liang Bin School of Information Renmin University of China Beijing 100872 P. R. China Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education Renmin University of China Beijing 100872 P. R. China Information Engineering University of China Zhengzhou 450004 P. R. China

Although there exist a few good schemes to protect the kernel hooks of operating systems, attackers are still able to circumvent existing defense mechanisms with spurious context infonmtion. To address this challenge, this paper proposes a framework, called HooklMA, to detect compromised kernel hooks by using hardware debugging features. The key contribution of the work is that context information is captured from hardware instead of from relatively vulnerable kernel data. Using commodity hardware, a proof-of-concept pro- totype system of HooklMA has been developed. This prototype handles 3 082 dynamic control-flow transfers with related hooks in the kernel space. Experiments show that HooklMA is capable of detecting compomised kernel hooks caused by kernel rootkits. Performance evaluations with UnixBench indicate that runtirre overhead introduced by HooklMA is about 21.5%.

关键词： operating system kernel hook integrity hardware control flow

来源：评论

学校读者我要写书评

暂无评论

An Approach for Personalized Tag Recommendation Based on Interest Transfer Model

An Approach for Personalized Tag Recommendation Based on Int...

引用

Web Information Systems and Applications Conference (WISA)

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

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.

关键词： Mathematical model Computational modeling Collaboration Educational institutions Tagging Filtering Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

LotusX: A Position-Aware XML Graphical Search System with Auto-Completion

LotusX: A Position-Aware XML Graphical Search System with Au...

引用

International Conference on data engineering

作者： Chunbin Lin Jiaheng Lu Tok Wang Ling Bogdan Cautis Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China China School of Computing National University of Singapore Singapore Télécom Paris Technology France

ISBN: (纸本)9781467300421

The existing query languages for XML (e.g., XQuery) require professional programming skills to be formulated, however, such complex query languages burden the query processing. In addition, when issuing an XML query, users are required to be familiar with the content (including the structural and textual information) of the hierarchical XML, which is diffcult for common users. The need for designing user friendly interfaces to reduce the burden of query formulation is fundamental to the spreading of XML community. We present a twig-based XML graphical search system, called LotusX, that provides a graphical interface to simplify the query processing without the need of learning query language and data schemas and the knowledge of the content of the XML document. The basic idea is that LotusX proposes "position-aware" and "auto-completion" features to help users to create tree-modeled queries (twig pattern) by providing the possible candidates on-the-fly. In addition, complex twig queries (including order sensitive queries) are supported in LotusX. Furthermore, a new ranking strategy and a query rewriting solution are implemented to rank and rewrite the query effectively. We provide an online demo for LotusX system: http://***:8080/LotusX.

关键词： XML database languages Indexes Books Query processing Programming keyword search

来源：评论

学校读者我要写书评

暂无评论

Optimizing parameters of algorithm trading strategies using MapReduce

Optimizing parameters of algorithm trading strategies using ...

引用

International Conference on Fuzzy Systems and knowledge Discovery (FSKD)

作者： Xiongpai Qin Huiju Wang Furong Li Jidong Chen Xuan Zhou Xiaoyong Du Shan Wang Key Laboratory of Data Engineering and Knowledge Engineering (RUC) Ministry of Education Beijing China School of Information Renmin University of China Beijing China EMC-Greenplum Research China China

In algorithm trading, computer algorithms are used to make the decision on the time, quantity, and direction of operations (buy, sell, or hold) automatically. To create a useful algorithm, the parameters of the algorithm should be optimized based on historical data. However, Parameter optimization is a time consuming task, due to the large search space. We propose to search the parameter combination space using the MapReduce framework, with the expectation that runtime of optimization be cut down by leveraging the parallel processing capability of MapReduce. This paper presents the details of our method and some experiment results to demonstrate its efficiency. We also show that a rule based strategy after being optimized performs better in terms of stability than the one whose parameters are arbitrarily preset, while making a comparable profit.

关键词： Optimization Measurement Computers Algorithm design and analysis Runtime Servers data processing

来源：评论

学校读者我要写书评

暂无评论

Single attribute Join Queries within latest sampling periods in sensor networks

Single attribute Join Queries within latest sampling periods...

引用

IEEE Symposium on Computers and Communications (ISCC)

作者： Shangfeng Mo Hong Chen Yinglong Li School of Math and Computing Science Hunan University of Science and Technology Xiangtan China Key Laboratory of Data Engineering and Knowledge Engineering of MOE School of Information Renmin University of China Beijing China

Join processing in wireless sensor networks is a challenging problem. Current solutions are not involved in the join operation among tuples of the latest sampling periods. In this article, we proposed a continuous Single attribute Join Queries within latest sampling Periods (SJQP) for wireless sensor networks. The main idea of our filter-based framework is to discard non-matching tuples, and our scheme can guarantee the result is correct independent of the filters. Experiments based on real-world sensor data show that our method performs close to a theoretical optimum and consistently outperforms the centralized join algorithm.

关键词： Base stations Wireless sensor networks Probes Filtering algorithms Temperature sensors Information filters

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：