Matching and analysing conservation–restoration trajectories
نویسندگان
چکیده
The context of this work is an on-going project at the French National Library (BnF), which aims providing predictions documents physical state based on their conservation–restoration histories. A document can be either in a good and available to readers, or damaged unavailable them. As libraries may contain millions documents, manual monitoring analysis not realistic practice. We therefore propose analyse conservation histories order derive reliable state. To achieve goal, we introduce paper following contributions. First, representation history as trajectory, define its different types events. also trajectory matching process that computes similarity score between two trajectories considering terminological heterogeneity events, using ontological model represents domain experts knowledge. Second, provide identifies most representative sequences events deteriorated documents. Finally, prediction for process. present some experiments showing effectiveness well model.
منابع مشابه
Algorithms for Matching and Predicting Trajectories
We consider the following two problems: Map Matching: Given a sequence of (imprecise) location measurements from a mobile user moving on a road network, determine the most likely path in the network this user has travelled along. Prediction of Trajectories: Given the path of where a mobile user has moved along in a road network up to now, predict where he will travel along in the near future. O...
متن کاملAnalysing Character Shapes by String Matching Techniques
Characters are carefully designed shapes incorporating both the design ideas of a skilled character designer [1] and the rules related to visual appearance. The visual appearance of printed characters is the result of many interacting factors: the design intentions of the type designer, the artistic creation of the different character shapes as typeface masters, the font industrialization, rend...
متن کاملAnalysing co-articulation using frame-based feature trajectories
We investigate several approaches aimed at a more detailed understanding of co-articulation in spoken utterances. We find that the Euclidean difference between instantaneous frame-based feature values and the mean values of these features are most useful for these purposes, and that low-order polynomials are able to model the between-phone transitions accurately. Examples of typical transitions...
متن کاملKernelized Map Matching for noisy trajectories
Map matching is a fundamental operation in many applications such as traffic analysis and location-aware services, the killer apps for ubiquitous computing. In the past, several map matching approaches have been proposed. Roughly speaking they can be categorized into four groups: geometric, topological, probabilistic, and other advanced techniques. Surprisingly, kernel methods have not received...
متن کاملAnalysing top-level and domain ontology alignments from matching systems
Top-level ontologies play an important role in the construction and integration of domain ontologies, providing a well-founded reference model that can be shared across knowledge domains. While most efforts in ontology matching have been particularly dedicated to domain ontologies, the problem of matching domain and top-level ontologies has been addressed to a lesser extent. This is a challengi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Data and Knowledge Engineering
سال: 2022
ISSN: ['1872-6933', '0169-023X']
DOI: https://doi.org/10.1016/j.datak.2022.102015