The volume and diversity of documents available in today's world is increasing daily. It is therefore difficult for a single classifier to efficiently handle multi-level categorization of such a varied document sp...
详细信息
The volume and diversity of documents available in today's world is increasing daily. It is therefore difficult for a single classifier to efficiently handle multi-level categorization of such a varied document space. In this paper we analyse methods to enhance the efficiency of a single classifier for two-level classification by combining it with classifiers of other types. We use the maximum significance value as an indicator for the subspace of a test document. We represent the documents using the conditional significance vector which increases the distinction between classes within a subspace. Our experiments show that dividing a document space into different semantic subspaces increases the efficiency of such hybrid classifier combinations. Applying different types of classifiers on different subspaces substantially improves overall learning.
In this study, we focus on the development of energy efficient and achievable load balancing mechanisms for wireless sensor networks. Due to resource constraint and tremendous amount of sensors, one possible way of ac...
详细信息
Despite of the various benefits obtainable from Formal Concept Analysis (FCA) in knowledge base construction, FCA-based approaches are not enough to help an expert enrich his knowledge. This is because they provide on...
详细信息
Despite of the various benefits obtainable from Formal Concept Analysis (FCA) in knowledge base construction, FCA-based approaches are not enough to help an expert enrich his knowledge. This is because they provide only the clusters constructed with user-defined knowledge and super-sub relation between the clusters. In this paper, we propose an approach that provides a user with a guideline by suggesting undiscovered knowledge in the form of predicates. This approach firstly generates a set of candidate predicates by analyzing a pre-defined predicate by users. Second, it discards unqualified ones from the set of candidate predicates using a filtering method dealing with two criteria, uniqueness and support. The qualified candidate predicates are suggested, and selected by the user, and finally, his knowledge is enriched by merging the selected predicates with pre-defined ones.
An important aspect of spectrum sharing is reliable protection of licensed, primary, users from interference by unlicensed, secondary, users. In this paper we investigate the reliability of the iterative power adjustm...
详细信息
An important aspect of spectrum sharing is reliable protection of licensed, primary, users from interference by unlicensed, secondary, users. In this paper we investigate the reliability of the iterative power adjustment algorithm proposed by Pollin, Adams and Bahai (2008). The goal of this transmission power control algorithm is to allow a static secondary transmitter to maximize its power without interfering with primary users. A distributed flooding algorithm is used to detect primary users and estimate the distance to the primary propagation contour. The secondary transmitter makes a local channel estimation with a moving least squares algorithm to average out noise. The metric used to estimate interference is the propagation contour-contour distance between the secondary and primary transmitters. In our first contribution we investigate the reliability of this metric by computing the location probability, a new FCC proposed metric for configuring Digital Terrestrial Television networks. We show that the propagation contour-contour distance is correlated with the location probability. In a second contribution we make the flooding algorithm more cost efficient by reducing communication. We then study the influence of the number of flooding messages on the performance of the iterative power adjustment algorithm in terms of location probability and number of iterations.
Political views frequently conflict in the coverage of contentious political issues, potentially causing serious social problems. We present a novel social annotation analysis approach for identification of news artic...
详细信息
ISBN:
(纸本)9781450305563
Political views frequently conflict in the coverage of contentious political issues, potentially causing serious social problems. We present a novel social annotation analysis approach for identification of news articles' political orientation. The approach focuses on the behavior of individual commenters. It uncovers commenters' sentiment patterns towards political news articles, and predicts the political orientation from the sentiments expressed in the comments. It takes advantage of commenters' participation as well as their knowledge and intelligence condensed in the sentiment of comments, thereby greatly reduces the high complexity of political view identification. We conduct extensive study on commenters' behaviors, and discover predictive commenters showing a high degree of regularity in their sentiment patterns. We develop and evaluate sentiment pattern-based methods for political view identification. Copyright 2011 ACM.
Running MapReduce programs in the public cloud introduces the important problem: how to optimize resource provisioning to minimize the financial charge for a specific job? In this paper, we study the whole process of ...
详细信息
Running MapReduce programs in the public cloud introduces the important problem: how to optimize resource provisioning to minimize the financial charge for a specific job? In this paper, we study the whole process of MapReduce processing and build up a cost function that explicitly models the relationship between the amount of input data, the available system resources (Map and Reduce slots), and the complexity of the Reduce function for the target MapReduce job. The model parameters can be learned from test runs with a small number of nodes. Based on this cost model, we can solve a number of decision problems, such as the optimal amount of resources that can minimize the financial cost with a time deadline or minimize the time under certain financial budget. Experimental results show that this cost model performs well on tested MapReduce programs.
lti-label learning aims at predicting a proper label set for each unseen *** instance in the dataset is associated with a set of predefined ***-label learning approaches frequently used choose identical feature set to...
lti-label learning aims at predicting a proper label set for each unseen *** instance in the dataset is associated with a set of predefined ***-label learning approaches frequently used choose identical feature set to determine the instance's membership of each label.
Federated policy systems are required to support the emergent complexity and organizational heterogeneity of modern Internet service delivery. This paper presents a distributed policy management approach which utilize...
详细信息
Federated policy systems are required to support the emergent complexity and organizational heterogeneity of modern Internet service delivery. This paper presents a distributed policy management approach which utilizes a flexible, tree-based capability authority model to partition and delegate federated capabilities or services. A trust management model and a delegation logic is defined which supports secure decentralized policy reasoning and addresses performance overheads due to distributed rule evaluation, threats from malformed or malicious federated principals and allows flexibility with respect to delegation chain reduction or capability authority re-partitioning. The system is evaluated through a security analysis and a prototype implementation of a federated policy engineering framework based on this logic is described. This framework is based on public key certificates and an extension to the Keynote Trust Management language. It provides practical management services such as key discovery and certificate revocation in addition to the core capability delegation function.
In this work, we use folksonomies for building user preference list (UPL) based on user's search history. A UPL is an indispensable source of knowledge which can be exploited by intelligent systems for query recom...
详细信息
In this work, we use folksonomies for building user preference list (UPL) based on user's search history. A UPL is an indispensable source of knowledge which can be exploited by intelligent systems for query recommendation, personalized search, and web search result ranking etc. A UPL consist of list of concepts, and their weights, clustered together using agglomerative clustering by employing Google Similarity Distance. We show how to design and implement such a system in practice and visualize the UPL which aids in finding interesting relationships between terms and detect outliers, if any. The experiment reveals that UPL not only captures user interests but also its context and results are very promising.
Nowadays PDF documents have become a dominating knowledge repository for both the academia and industry largely because they are very convenient to print and exchange. However, the methods of automated structure infor...
详细信息
暂无评论