science

Minimal mappings

Minimal mappings is a science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Minimal mappings rather than just read about it. In short: Minimal mappings are the result of an advanced technique of semantic matching, a technique used in computer science to identify information which is semantically related. Semantic matching has been proposed as a valid solution to the semantic heterogeneity problem, namely, supporting diversity in knowledge.

Key takeaways

Minimal mappings belongs to science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Minimal mappings to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Minimal mappings from memory before moving on to harder problems.

Reference excerpt

Minimal mappings are the result of an advanced technique of semantic matching, a technique used in computer science to identify information which is semantically related. Semantic matching has been proposed as a valid solution to the semantic heterogeneity problem, namely, supporting diversity in knowledge. Given any two graph-like structures, e.g. classifications, databases, or XML schemas and ontologies, matching is an operator which identifies those nodes in the two structures that semantically correspond to one another. For example, applied to file systems, it can identify that a folder labeled “car” is semantically equivalent to another folder “automobile” because they are synonyms in English. The proposed technique works on lightweight ontologies, namely, tree structures where each node is labeled by a natural language sentence, for example in English. These sentences are translated into a formal logical formula (according to an unambiguous, artificial language). The formula codifies the meaning of the node, accounting for its position in the graph. For example, in case the folder “car” is under another folder “red” we can say that the meaning of the folder “car” is “red car” in this case. This is translated into the logical formula “red AND car”. The output of matching is a mapping, namely a set of semantic correspondences between the two graphs. Each mapping element is attached with a semantic relation, for example equivalence. Among all possible mappings, the minimal mapping is such that all other mapping elements can be computed from the minimal set in an amount of time proportional to the size of the input graphs (linear time) and none of the elements in the minimal set can be dropped without preventing such a computation. The main advantage of minimal mappings is that they minimize the number of nodes for subsequent processing. Notice that this is a rather important feature because the number of possible mappings can reach n × m with n and m the size of the two input ontologies. In particular, minimal mappings become crucial with large ontologies, e.g. DMOZ, where even relatively small (non-minimal) subsets of the number of possible mapping elements, potentially millions of them, are unmanageable. Minimal mappings provide usability advantages. Many systems and corresponding interfaces, mostly graphical, have been provided for the management of mappings but all of them scale poorly with the number of nodes. Visualizations of large graphs are rather messy. Maintenance of smaller mappings is much easier, faster and less error prone.

See also Lightweight ontologies Ontology alignment Semantic matching Semantic equivalence Semantic integration

References

Worked examples

Example 1 — a first encounter with Minimal mappings

Start with the simplest possible case. Write down what Minimal mappings claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Minimal mappings before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Minimal mappings ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Minimal mappings

In research: Minimal mappings appears in science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Minimal mappings in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Minimal mappings is common in secondary-school and first-year university syllabi. It links to neighbouring topics Ontology (information science), Semantic Web, so understanding it makes those chapters shorter.
In everyday life: Look for Minimal mappings outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Minimal mappings in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Minimal mappings means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Minimal mappings out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Minimal mappings in simple terms?

Why does Minimal mappings matter?

Because it connects several science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Minimal mappings?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Minimal mappings.