37,966 research outputs found
Class-based Rough Approximation with Dominance Principle
Dominance-based Rough Set Approach (DRSA), as the extension of Pawlak's Rough
Set theory, is effective and fundamentally important in Multiple Criteria
Decision Analysis (MCDA). In previous DRSA models, the definitions of the upper
and lower approximations are preserving the class unions rather than the
singleton class. In this paper, we propose a new Class-based Rough
Approximation with respect to a series of previous DRSA models, including
Classical DRSA model, VC-DRSA model and VP-DRSA model. In addition, the new
class-based reducts are investigated.Comment: Submitted to IEEE-GrC201
Generating Preview Tables for Entity Graphs
Users are tapping into massive, heterogeneous entity graphs for many
applications. It is challenging to select entity graphs for a particular need,
given abundant datasets from many sources and the oftentimes scarce information
for them. We propose methods to produce preview tables for compact presentation
of important entity types and relationships in entity graphs. The preview
tables assist users in attaining a quick and rough preview of the data. They
can be shown in a limited display space for a user to browse and explore,
before she decides to spend time and resources to fetch and investigate the
complete dataset. We formulate several optimization problems that look for
previews with the highest scores according to intuitive goodness measures,
under various constraints on preview size and distance between preview tables.
The optimization problem under distance constraint is NP-hard. We design a
dynamic-programming algorithm and an Apriori-style algorithm for finding
optimal previews. Results from experiments, comparison with related work and
user studies demonstrated the scoring measures' accuracy and the discovery
algorithms' efficiency.Comment: This is the camera-ready version of a SIGMOD16 paper. There might be
tiny differences in layout, spacing and linebreaking, compared with the
version in the SIGMOD16 proceedings, since we must submit TeX files and use
arXiv to compile the file
Automatic Verification of Transactions on an Object-Oriented Database
In the context of the object-oriented data model, a compiletime approach is given that provides for a significant reduction of the amount of run-time transaction overhead due to integrity constraint checking. The higher-order logic Isabelle theorem prover is used to automatically prove which constraints might, or might not be violated by a given transaction in a manner analogous to the one used by Sheard and Stemple (1989) for the relational data model. A prototype transaction verification tool has been implemented, which automates the semantic mappings and generates proof goals for Isabelle. Test results are discussed to illustrate the effectiveness of our approach
Efficient schemes on solving fractional integro-differential equations
Fractional integro-differential equation (FIDE) emerges in various modelling of
physical phenomena. In most cases, finding the exact analytical solution for FIDE is
difficult or not possible. Hence, the methods producing highly accurate numerical
solution in efficient ways are often sought after. This research has designed some
methods to find the approximate solution of FIDE. The analytical expression of
Genocchi polynomial operational matrix for left-sided and right-sided Caputo’s
derivative and kernel matrix has been derived. Linear independence of Genocchi
polynomials has been proved by deriving the expression for Genocchi polynomial
Gram determinant. Genocchi polynomial method with collocation has been
introduced and applied in solving both linear and system of linear FIDE. The
numerical results of solving linear FIDE by Genocchi polynomial are compared with
certain existing methods. The analytical expression of Bernoulli polynomial
operational matrix of right-sided Caputo’s fractional derivative and the Bernoulli
expansion coefficient for a two-variable function is derived. Linear FIDE with mixed
left and right-sided Caputo’s derivative is first considered and solved by applying the
Bernoulli polynomial with spectral-tau method. Numerical results obtained show that
the method proposed achieves very high accuracy. The upper bounds for th
Logical Analysis of Inconsistent Data (LAID) for a paremiologic study
15th Portuguese Conference on Artificial Inteligence - EPIA 2011. Lisboa, Faculdade de Ciências da Universidade de LisboaA paremiologic (study of proverbs) case is presented as a part of a wider project, based on data collected by thousands of interviews made to people from Azores, and involving a set of twenty-two thousand Portuguese proverbs, where we searched for the minimum information needed to identify
the birthplace island of an interviewee. The concept of birthplace was extended for all respondents that have lived in any locations more than 5 years,unintentionally introducing inconsistencies in the data classification task. The rough sets differ from classical sets by their ability to deal with inconsistent data. A parallel approach to data reduction is given by the logical analysis of data (LAD). LAD handicaps, like the inability to cope with the contradiction
and the limited number of classification classes, will be overcome in this version of Logical Analysis of Inconsistent Data (LAID)
Rule sets based bilevel decision model
Bilevel decision addresses the problem in which two levels of decision makers, each tries to optimize their individual objectives under constraints, act and react in an uncooperative, sequential manner. Such a bilevel optimization structure appears naturally in many aspects of planning, management and policy making. However, bilevel decision making may involve many uncertain factors in a real world problem. Therefore it is hard to determine the objective functions and constraints of the leader and the follower when build a bilevel decision model. To deal with this issue, this study explores the use of rule sets to format a bilevel decision problem by establishing a rule sets based model. After develop a method to construct a rule sets based bilevel model of a real-world problem, an example to illustrate the construction process is presented. Copyright © 2006, Australian Computer Society, Inc
- …