A Modal Characterization of Indiscernibility and Similarity Relations in Pawlak’s Information Systems

2005 ◽  
pp. 12-22 ◽  
Author(s):  
Dimiter Vakarelov
Keyword(s):  
Information Systems ◽  
Similarity Relations

Common extension of Boolean informational systems

1979 ◽  
Vol 2 (1) ◽  
pp. 63-70
Author(s):  
Tadeusz Traczyk
Keyword(s):  
Information Systems ◽  
Boolean Algebras ◽  
Numerical Characterization ◽  
Common Extension

The notion of numerical characterization of Boolean algebras and coproducts are used to define information systems and to develop the theory of such systems.

Improving the Performance of an Associative Classifier by Gamma Rough Sets Based Instance Selection

2017 ◽  
Vol 32 (01) ◽  
pp. 1860009 ◽  
Author(s):  
Jarvin A. Antón-Vargas ◽  
Yenny Villuendas-Rey ◽  
Cornelio Yáñez-Márquez ◽  
Itzamá López-Yáñez ◽  
Oscar Camacho-Nieto
Keyword(s):  
Information Systems ◽  
Rough Sets ◽  
Nearest Neighbor ◽  
Management Information Systems ◽  
Computational Cost ◽  
Instance Selection ◽  
Management Information ◽  
Similarity Relations ◽  
The Universe ◽  
Selection Of

This paper introduces the Gamma Rough Sets for management information systems where the universe objects are represented by continuous attributes and are connected by similarity relations. Some properties of such sets are demonstrated in this paper. In addition, Gamma Rough Sets are used to improve the Gamma associative classifier, by selecting instances. The results indicate that the selection of instances significantly reduces the computational cost of the Gamma classifier without affecting its effectiveness. The results also suggest that the selection of instances using Gamma Rough Sets favors other lazy learners, such as Nearest Neighbor and ALVOT.

Impact of Information Systems Implementations on Vertical Mergers and Acquisitions: A Framework

10.28945/2492 ◽  
2002 ◽  
Author(s):  
Nikhil S Gurjar ◽  
Sharadchandra D. Jog ◽  
Manoj K Jha ◽  
S. Amanullah
Keyword(s):  
Information Systems ◽  
Mergers And Acquisitions ◽  
Technology Assessment ◽  
Analytical Framework ◽  
Strategic Options ◽  
Merger And Acquisitions ◽  
Vertical Mergers ◽  
The Impact ◽  
A Company

The present work is an attempt to develop a conceptual framework for evaluating the impact of information systems implementations on Mergers and Acquisitions (referred to as M&A). Although this work focuses on vertical M&A, the framework can easily be extended to horizontal and conglomerate mergers. We begin by attempting to understand what M&A really are. We then move on to understand information systems as we know them today. Thereafter, we classify the nature of businesses from an information perspective. Technology assessment is then carried out on the existing information systems that are implemented in a company. This gives us an understanding of the characterization of the merging entities. We then go about understanding what the strategic options for the companies post merger are. These options are then evaluated to study the impact on the merger. An analytical framework is then developed in two cases that have been considered. Keywords: Merger and Acquisitions (M&A), Information Systems, Information Strategy.

Uncertainty models in information and database systems

1985 ◽  
Vol 11 (2) ◽  
pp. 77-87 ◽  
Author(s):  
Billy P. Buckles ◽  
Frederick E. Petry
Keyword(s):  
Information System ◽  
Information Systems ◽  
Database Systems ◽  
Heterogeneous Data ◽  
Semantic Knowledge ◽  
Complex Data ◽  
Similarity Relations ◽  
Generalized Information ◽  
The Cost ◽  
Uncertainty Models

Information systems have evolved to the point where it is desirable to capture the vagueness and uncertainty of data that occurs in actuality. Approaches have been taken using various fuzzy set concepts such as degree of membership, similarity relations and possibility distributions. This leads to the concept of generalized information systems which are typically char acterized by heterogeneous data representations, weakly typed data domains and the requirement for semantic knowledge during query interpretation. A generalized information system is more likely to have a direct representation for larger classes of information at the cost of more complex data management and query processing. In general the various fuzzy database approaches that have been developed are overviewed in the paper and characterized with respect to the concept of a generalized information system.

scholarly journals Logicality and Invariance

2008 ◽  
Vol 14 (1) ◽  
pp. 29-68 ◽  
Author(s):  
Denis Bonnay
Keyword(s):  
Similarity Relation ◽  
Necessary Condition ◽  
General Notion ◽  
Sufficient Condition ◽  
Logical Constants ◽  
Similarity Relations ◽  
Definition Of

AbstractThis paper deals with the problem of giving a principled characterization of the class of logical constants. According to the so-called Tarski–Sher thesis, an operation is logical iff it is invariant under permutation. In the model-theoretic tradition, this criterion has been widely accepted as giving a necessary condition for an operation to be logical. But it has been also widely criticized on the account that it counts too many operations as logical, failing thus to provide a sufficient condition.Our aim is to solve this problem of overgeneration by modifying the invariance criterion. We introduce a general notion of invariance under a similarity relation and present the connection between similarity relations and classes of invariant operations. The next task is to isolate a similarity relation well-suited for a definition of logicality. We argue that the standard arguments in favor of invariance under permutation, which rely on the generality and the formality of logic, should be modified. The revised arguments are shown to support an alternative to Tarski's criterion, according to which an operation is logical iff it is invariant under potential isomorphism.

Sign in / Sign up

Export Citation Format

Share Document