相关论文: On the Lattice of Conceptual Measurements

Measurement is a fundamental building block of numerous scientific models and their creation. This is in particular true for data driven science. Due to the high complexity and size of modern data sets, the necessity for the development of…

Conceptual Scaling is a useful standard tool in Formal Concept Analysis and beyond. Its mathematical theory, as elaborated in the last chapter of the FCA monograph, still has room for improvement. As it stands, even some of the basic…

When considering perceptions, the observation scale and resolution are closely related properties. There is consensus in considering resolution as the density of elementary pieces of information in a specified information space.…

We show that the set of all measures on any measurable space is a complete lattice, i.e. every collection of measures has both a greatest lower bound and a least upper bound.

We present a new unified theory of critical finite-size scaling for lattice statistical mechanical models with periodic boundary conditions above the upper critical dimension. Our theory is based on recent mathematically rigorous results…

Lattices are a commonly used structure for the representation and analysis of relational and ontological knowledge. In particular, the analysis of these requires a decomposition of a large and high-dimensional lattice into a set of…

Lattices and their order diagrams are an essential tool for communicating knowledge and insights about data. This is in particular true when applying Formal Concept Analysis. Such representations, however, are difficult to comprehend by…

In this paper we investigate measures over bounded lattices, extending and giving a unifying treatment to previous works. In particular, we prove that the measures of an arbitrary bounded lattice can be represented as measures over a…

Starting from the operator algebra of the (1+1)D Ising model on a spatial lattice, this paper explicitly constructs a subalgebra of smooth operators that are natural candidates for continuum fields in the scaling limit. At the critical…

A lattice is a partially ordered set supporting a meet (or join) operation that returns the largest lower bound (smallest upper bound) of two elements. Just like graphs, lattices are a fundamental structure that occurs across domains…

In this paper we are concerned with understanding the nature of program metrics for calculi with higher-order types, seen as natural generalizations of program equivalences. Some of the metrics we are interested in are well-known, such as…

The notion of concept has been studied for centuries, by philosophers, linguists, cognitive scientists, and researchers in artificial intelligence (Margolis & Laurence, 1999). There is a large literature on formal, mathematical models of…

The model of semantic concept lattice for data mining of microblogs has been proposed in this work. It is shown that the use of this model is effective for the semantic relations analysis and for the detection of associative rules of key…

Via a family of monotone scalar functions, a preorder on a set is extended to its power set and then used to construct a hull operator and a corresponing complete lattice of sets. A function mappping into the preordered set is extended to a…

Measures of dependence among variables, and measures of information content and shared information have become valuable tools of multi-variable data analysis. Information measures, like marginal entropies, mutual and multi-information, have…

It is argued that every measurement is made in a certain scale. The scale in which present measuments are made is called present scale which gives present knowledge. Quantities at the limits to present measurement may be observables in…

It is well known by analysts that a concept lattice has an exponential size in the data. Thus, as soon as he works with real data, the size of the concept lattice is a fundamental problem. In this chapter, we propose to investigate factor…

Concept lattices are well-known conceptual structures that organise interesting patterns-the concepts-extracted from data. In some applications, such as software engineering or data mining, the size of the lattice can be a problem, as it is…

There is increasing focus on analyzing data represented as hypergraphs, which are better able to express complex relationships amongst entities than are graphs. Much of the critical information about hypergraph structure is available only…

We give an intuitive geometric explanation for the apparent breakdown of standard finite-size scaling in systems with periodic boundaries above the upper critical dimension. The Ising model and self-avoiding walk are simulated on…