Academic literature on the topic 'Instance matching'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Instance matching.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Instance matching"

1

Xue, Xingsi, and Jianhua Liu. "A Compact Hybrid Evolutionary Algorithm for Large Scale Instance Matching in Linked Open Data Cloud." International Journal on Artificial Intelligence Tools 26, no. 04 (2017): 1750013. http://dx.doi.org/10.1142/s0218213017500130.

Full text
Abstract:
Establishing correct links among the coreference ontology instances is critical to the success of Linked Open Data (LOD) cloud. However, because of the high level heterogeneity and large scale instance set, matching the coreference instances in LOD cloud is an error prone and time consuming task. To this end, in this work, we present an asymmetrical profile-based similarity measure for instance matching task, construct new optimal models for schema-level and instance-level matching problems, and propose a compact hybrid evolutionary algorithm based ontology matching approach to solve the large
APA, Harvard, Vancouver, ISO, and other styles
2

LENNON, CRAIG, and BORIS PITTEL. "On the Likely Number of Solutions for the Stable Marriage Problem." Combinatorics, Probability and Computing 18, no. 3 (2009): 371–421. http://dx.doi.org/10.1017/s0963548308009607.

Full text
Abstract:
An instance of a size-n stable marriage problem involves n men and n women, each individually ranking all members of opposite sex in order of preference as a potential marriage partner. A complete matching, a set of n marriages, is called stable if no unmatched man and woman prefer each other to their partners in the matching. It is known that, for every instance of marriage partner preferences, there exists at least one stable matching, and that there are instances with exponentially many stable matchings. Our focus is on a random instance chosen uniformly from among all (n!)2n possible insta
APA, Harvard, Vancouver, ISO, and other styles
3

Schopman, Balthasar, Shenghui Wang, Antoine Isaac, and Stefan Schlobach. "Instance-Based Ontology Matching by Instance Enrichment." Journal on Data Semantics 1, no. 4 (2012): 219–36. http://dx.doi.org/10.1007/s13740-012-0011-z.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zhu, Hongming, Xiaowen Wang, Yizhi Jiang, Hongfei Fan, Bowen Du, and Qin Liu. "FTRLIM: Distributed Instance Matching Framework for Large-Scale Knowledge Graph Fusion." Entropy 23, no. 5 (2021): 602. http://dx.doi.org/10.3390/e23050602.

Full text
Abstract:
Instance matching is a key task in knowledge graph fusion, and it is critical to improving the efficiency of instance matching, given the increasing scale of knowledge graphs. Blocking algorithms selecting candidate instance pairs for comparison is one of the effective methods to achieve the goal. In this paper, we propose a novel blocking algorithm named MultiObJ, which constructs indexes for instances based on the Ordered Joint of Multiple Objects’ features to limit the number of candidate instance pairs. Based on MultiObJ, we further propose a distributed framework named Follow-the-Regular-
APA, Harvard, Vancouver, ISO, and other styles
5

Nguyen, Thành, and Rakesh Vohra. "Near-Feasible Stable Matchings with Couples." American Economic Review 108, no. 11 (2018): 3154–69. http://dx.doi.org/10.1257/aer.20141188.

Full text
Abstract:
The National Resident Matching program seeks a stable matching of medical students to teaching hospitals. With couples, stable matchings need not exist. Nevertheless, for any student preferences, we show that each instance of a matching problem has a “nearby” instance with a stable matching. The nearby instance is obtained by perturbing the capacities of the hospitals. In this perturbation, aggregate capacity is never reduced and can increase by at most four. The capacity of each hospital never changes by more than two. (JEL C78, D47, I11, J41, J44)
APA, Harvard, Vancouver, ISO, and other styles
6

Moreno-Scott, Jorge Humberto, José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, and Santiago Enrique Conant-Pablos. "Experimental Matching of Instances to Heuristics for Constraint Satisfaction Problems." Computational Intelligence and Neuroscience 2016 (2016): 1–15. http://dx.doi.org/10.1155/2016/7349070.

Full text
Abstract:
Constraint satisfaction problems are of special interest for the artificial intelligence and operations research community due to their many applications. Although heuristics involved in solving these problems have largely been studied in the past, little is known about the relation between instances and the respective performance of the heuristics used to solve them. This paper focuses on both the exploration of the instance space to identify relations between instances and good performing heuristics and how to use such relations to improve the search. Firstly, the document describes a method
APA, Harvard, Vancouver, ISO, and other styles
7

Mehdi, Osama A., Hamidah Ibrahim, and Lilly Suriani Affendey. "Instance based Matching using Regular Expression." Procedia Computer Science 10 (2012): 688–95. http://dx.doi.org/10.1016/j.procs.2012.06.088.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Dorneles, Carina Friedrich, Rodrigo Gonçalves, and Ronaldo dos Santos Mello. "Approximate data instance matching: a survey." Knowledge and Information Systems 27, no. 1 (2010): 1–21. http://dx.doi.org/10.1007/s10115-010-0285-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Araujo, Samur, Duc Thanh Tran, Arjen P. de Vries, and Daniel Schwabe. "SERIMI: Class-Based Matching for Instance Matching Across Heterogeneous Datasets." IEEE Transactions on Knowledge and Data Engineering 27, no. 5 (2015): 1397–440. http://dx.doi.org/10.1109/tkde.2014.2365779.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Nguyen, Khai, and Ryutaro Ichise. "Automatic Schema-Independent Linked Data Instance Matching System." International Journal on Semantic Web and Information Systems 13, no. 1 (2017): 82–103. http://dx.doi.org/10.4018/ijswis.2017010106.

Full text
Abstract:
The goal of linked data instance matching is to detect all instances that co-refer to the same objects in two linked data repositories, the source and the target. Since the amount of linked data is rapidly growing, it is important to automate this task. However, the difference between the schemata of source and target repositories remains a challenging barrier. This barrier reduces the portability, accuracy, and scalability of many proposed approaches. The authors present automatic schema-independent interlinking (ASL), which is a schema-independent system that performs instance matching on re
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Instance matching"

1

BRAUNER, DANIELA FRANCISCO. "INSTANCE-BASED SCHEMA MATCHING." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2008. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=12573@1.

Full text
Abstract:
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>Um mediador é um componente de software que auxilia o acesso a fontes de dados. Com o advento da Web, a construção de mediadores impõe desafios importantes, tais como a capacidade de fornecer acesso integrado a fontes de dados independentes e dinâmicas e a habilidade de resolver a heterogeneidade semântica entre os esquemas destas fontes. Para lidar com esses desafios, o alinhamento de esquemas é uma questão fundamental. Nesta tese são propostas abordagens de alinhamento de esquemas de classificação (tesauros) e esquemas c
APA, Harvard, Vancouver, ISO, and other styles
2

Ma, Yongtao [Verfasser], and R. [Akademischer Betreuer] Studer. "Effective Instance Matching for Heterogeneous Structured Data / Yongtao Ma. Betreuer: R. Studer." Karlsruhe : KIT-Bibliothek, 2014. http://d-nb.info/1064940080/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Riaz, Muhammad Atif, and Sameer Munir. "An Instance based Approach to Find the Types of Correspondence between the Attributes of Heterogeneous Datasets." Thesis, Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-1938.

Full text
Abstract:
Context: Determining attribute correspondence is the most important, time consuming and knowledge intensive part during databases integration. It is also used in other data manipulation applications such as data warehousing, data design, semantic web and e-commerce. Objectives: In this thesis the aim is to investigate how to find the types of correspondence between the attributes of heterogeneous datasets when schema design information of the data sets is unknown. Methods: A literature review was conducted to extract the knowledge related to the approaches that are used to find the corresponde
APA, Harvard, Vancouver, ISO, and other styles
4

Paris, Pierre-Henri. "Identity in RDF knowledge graphs : propagation of properties between contextually identical entities." Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS132.

Full text
Abstract:
En raison du grand nombre de graphes de connaissances et, surtout, de leurs interconnexions encore plus nombreuses à l'aide de la propriété owl:sameas, il est devenu de plus en plus évident que cette propriété est souvent mal utilisée. En effet, les entités liées par la propriété owl:sameas doivent être identiques dans tous les contextes possibles et imaginables. Dans les faits, ceci n'est pas toujours le cas et induit une détérioration de la qualité des données. L'identité doit être considérée comme étant dépendante d'un contexte. Nous avons donc proposé une étude à large échelle sur la prése
APA, Harvard, Vancouver, ISO, and other styles
5

Årling, Matts, and Erik Svensson. "Instant messaging : Matchning av IM-funktioner och kommunikationsbehov hos medarbetare på IT-företag." Thesis, Örebro University, Department of Business, Economics, Statistics and Informatics, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:oru:diva-1204.

Full text
Abstract:
<p>Vi ville med denna uppsats undersöka om instant messaging matchar de kommunikationsbehov som IT-anställda har. För att ta reda på detta använde vi oss av ett kvalitativt angreppssätt i form av intervjuer. Dessa intervjuer skapade även ytterligare kunskap vilken vi benämnt barriärer. En lista på IM-funktioner hämtades från Wikipedia och reviderades senare av oss. Kommunikationsbehoven identifierades under analysen av intervjuerna. Matchningen genererade en tabell som kan användas som karta över vilka IM-funktioner som tillgodoser några vanliga kommunikationsbehov som finns på datortäta arbet
APA, Harvard, Vancouver, ISO, and other styles
6

Tournaire, Rémi. "Découverte automatique de correspondances entre ontologies." Grenoble, 2010. http://www.theses.fr/2010GRENM072.

Full text
Abstract:
Dans cette thèse, nous adoptons une approche formelle pour définir et découvrir des mappings d'inclusion probabilistes entre deux taxonomies avec une sémantique claire, dans l'optique d'échange collaboratif de documents. Nous comparons deux façons de modéliser des mappings probabilistes tout en étant compatible avec les contraintes logiques déclarées dans chaque taxonomie selon une propriété de monotonie, puis nous montrons que ces modèles sont complémentaires pour distinguer les mappings pertinents. Nous fournissons un moyen d'estimer les probabilités d'un mapping par une technique bayésienne
APA, Harvard, Vancouver, ISO, and other styles
7

Lopes, André Filipe Agostinho. "A tool for ontology instance matching." Master's thesis, 2013. http://hdl.handle.net/10451/9966.

Full text
Abstract:
Tese de mestrado em Informática, apresentada à Universidade de Lisboa, através da Faculdade de Ciências, 2013<br>A Web Semântica pretende fornecer formatos comuns para caracterizar semanticamente os dados publicados na Web, melhorando a interoperabilidade e integração de dados. A iniciativa Linked Data visa ligar dados relacionados que não foram previamente ligados. As ontologias têm um papel fundamental nisso, pois, fornecem vocabulários controlados, para caracterizar semanticamente os dados de uma forma inequívoca. Conforme definido por Gruber, uma ontologia é uma especificação de uma concei
APA, Harvard, Vancouver, ISO, and other styles
8

Kirsten, Toralf, Andreas Thor, and Erhard Rahm. "Instance-Based Matching of Large Life Science Ontologies." 2007. https://ul.qucosa.de/id/qucosa%3A33094.

Full text
Abstract:
Ontologies are heavily used in life sciences so that there is increasing value to match different ontologies in order to determine related conceptual categories. We propose a simple yet powerful methodology for instance-based ontology matching which utilizes the associations between molecular-biological objects and ontologies. The approach can build on many existing ontology associations for instance objects like sequences and proteins and thus makes heavy use of available domain knowledge. Furthermore, the approach is flexible and extensible since each instance source with associations to the
APA, Harvard, Vancouver, ISO, and other styles
9

Zaiß, Katrin Simone [Verfasser]. "Instance-based ontology matching and the evaluation of matching systems / vorgelegt von Katrin Simone Zaiß." 2010. http://d-nb.info/101260554X/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Todorov, Konstantin. "Ontology Matching by Combining Instance-Based Concept Similarity Measures with Structure." Doctoral thesis, 2011. https://repositorium.ub.uni-osnabrueck.de/handle/urn:nbn:de:gbv:700-201104128024.

Full text
Abstract:
Ontologies describe the semantics of data and provide a uniform framework of understanding between different parties. The main common reference to an ontology definition describes them as knowledge bodies, which bring a formal representation of a shared conceptualization of a domain - the objects, concepts and other entities that are assumed to exist in a certain area of interest together with the relationships holding among them. However, in open and evolving systems with decentralized nature (as, for example, the Semantic Web), it is unlikely for different parties to adopt the same ontology.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Instance matching"

1

Ichikawa, Jonathan Jenkins. Justification. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780199682706.003.0005.

Full text
Abstract:
This chapter articulates a knowledge first theory of doxastic justification—a belief is justified just in case it is relevantly similar to a possible instance of knowledge. In the terminology of the chapter, justification is “potential knowledge”. Relevant similarity is a matter of a matching of basic evidence and cognitive processing. This needn't be assumed to be a matter of the intrinsic; on the externalist approach to basic evidence given in Chapter 3, for one's belief to be justified is for there to be a possible knower who shares the same basic evidence—including factive perceptual state
APA, Harvard, Vancouver, ISO, and other styles
2

Jappelli, Tullio, and Luigi Pistaferri. The Response of Consumption to Income Risk. Oxford University Press, 2017. http://dx.doi.org/10.1093/acprof:oso/9780199383146.003.0010.

Full text
Abstract:
Tests of the importance of precautionary saving follow several research strategies. One aims to find a variable (or set of variables) that can approximate the variance of the growth rate of consumption. A second strategy seeks to estimate a reduced form for the level of consumption and wealth with proxies for income risk. A third approach simulates the path of consumption and wealth in models with precautionary saving, matching simulations with the observed distribution of wealth and consumption. Other studies provide indirect evidence for or against the precautionary saving hypothesis. Finall
APA, Harvard, Vancouver, ISO, and other styles
3

Somers, Harold. Machine Translation: Latest Developments. Edited by Ruslan Mitkov. Oxford University Press, 2012. http://dx.doi.org/10.1093/oxfordhb/9780199276349.013.0028.

Full text
Abstract:
This article attempts to locate MT (machine translation) in the contemporary context, while identifying its recent trends and themes. The 1990s were marked by the growing clout of empirical approaches, using increasingly available amounts of raw data in the form of parallel corpora. An appropriate instance is statistical MT, depending on bilingual corpus, but wherein, the translation depends on statistical modeling of the word order of target language and of source-target word equivalences. Example-based MT involves matching inputs against actual databases and identifying close matches. Succes
APA, Harvard, Vancouver, ISO, and other styles
4

Green, Peter, Kanti Mardia, Vysaul Nyirongo, and Yann Ruffieux. Bayesian modelling for matching and alignment of biomolecules. Edited by Anthony O'Hagan and Mike West. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780198703174.013.2.

Full text
Abstract:
This article describes Bayesian modelling for matching and alignment of biomolecules. One particular task where statistical modelling and inference can be useful in scientific understanding of protein structure is that of matching and alignment of two or more proteins. In this regard, statistical shape analysis potentially has something to offer in solving biomolecule matching and alignment problems. The article discusses the use of Bayesian methods for shape analysis to assist with understanding the three-dimensional structure of protein molecules, with a focus on the problem of matching inst
APA, Harvard, Vancouver, ISO, and other styles
5

Hansmeyer, Ebba Abdon, Ramón Mendiola, and Jim Hagemann Snabe. Purpose-Driven Business for Sustainable Performance and Progress. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198825067.003.0009.

Full text
Abstract:
This chapter proposes and discusses how a “purpose-driven” approach can help business reinvent and sustain itself and serve society. It outlines and explains a “tesseract model” which has purpose at its core and four vertices corresponding to economic, human, social, and environmental values. To be effective, a company’s purpose has to be authentic, ambitious, and achievable. A company’s purpose can furnish meaning and status, and act as a matching/sorting device for attracting compatible employees, investors, and customers. Based on the authors’ first-hand experience, this chapter describes t
APA, Harvard, Vancouver, ISO, and other styles
6

Lofthouse, Nigel. The Pocket Guide to Wood Finishes: Instant, Practical, Visual Guidance on Mixing and Matching Stains and Other Wood Finishes. Popular Woodworking Books, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

The colored pencil artist's pocket palette: Instant, practical visual guidance on mixing and matching colored pencils to suit all subjects. North Light Books, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

The coloured pencil artist's pocket palette: Instant, practical visual guidance on mixing and matching coloured pencils to suit all subjects. Batsford, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Instance matching"

1

Castano, Silvana, Alfio Ferrara, Stefano Montanelli, and Gaia Varese. "Ontology and Instance Matching." In Knowledge-Driven Multimedia Information Extraction and Ontology Evolution. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20795-2_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Leme, Luiz André P. Paes, Marco A. Casanova, Karin K. Breitman, and Antonio L. Furtado. "Instance-Based OWL Schema Matching." In Enterprise Information Systems. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-01347-8_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Homoceanu, Silviu, Jan-Christoph Kalo, and Wolf-Tilo Balke. "Putting Instance Matching to the Test: Is Instance Matching Ready for Reliable Data Linking?" In Lecture Notes in Computer Science. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08326-1_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zaiß, Katrin, and Stefan Conrad. "Partial Ontology Matching Using Instance Features." In On the Move to Meaningful Internet Systems: OTM 2009. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-05151-7_32.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Daskalaki, Evangelia, and Dimitris Plexousakis. "OtO Matching System: A Multi-strategy Approach to Instance Matching." In Advanced Information Systems Engineering. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-31095-9_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kejriwal, Mayank, and Daniel P. Miranker. "Minimally Supervised Instance Matching: An Alternate Approach." In The Semantic Web: ESWC 2015 Satellite Events. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-25639-9_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zaiß, Katrin, Tim Schlüter, and Stefan Conrad. "Instance-Based Ontology Matching Using Regular Expressions." In On the Move to Meaningful Internet Systems: OTM 2008 Workshops. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-88875-8_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Abubakar, Mansir, Hazlina Hamdan, Norwati Mustapha, and Teh Noranis Mohd Aris. "Instance-Based Ontology Matching: A Literature Review." In Advances in Intelligent Systems and Computing. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-72550-5_44.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kejriwal, Mayank, and Daniel P. Miranker. "Semi-supervised Instance Matching Using Boosted Classifiers." In The Semantic Web. Latest Advances and New Domains. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-18818-8_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Li, Chiao-Yun, Anton Antonov, and Wil M. P. van der Aalst. "Activity Instance Identification Using Bipartite Graph Matching." In Lecture Notes in Computer Science. Springer Nature Singapore, 2025. https://doi.org/10.1007/978-981-96-7238-7_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Instance matching"

1

Sánchez, Andrés, Francisco Alvarez-Padilla, Ma Quezada, et al. "An automated system for chromosome instance segmentation and pair matching using YOLOv8-Seg." In International Conference on Intelligent Medicine and Image Processing (IMIP 2025), edited by Mohd Shafry Mohd Rahim. SPIE, 2025. https://doi.org/10.1117/12.3071659.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kundu, Soumya Snigdha, Aaron Kujawa, Marina Ivory, Theodore Barfoot, Jonathan Shapey, and Tom Vercauteren. "Cluster dice: a simple and fast approach for instance-based semantic segmentation evaluation via many-to-many matching." In Computer-Aided Diagnosis, edited by Susan M. Astley and Axel Wismüller. SPIE, 2025. https://doi.org/10.1117/12.3047296.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Seeger, D. M., and Th Boellinghaus. "Hydrogen Permeation in Supermartensitic Stainless Steel Weld Microstructures." In CORROSION 2004. NACE International, 2004. https://doi.org/10.5006/c2004-04142.

Full text
Abstract:
Abstract In completion of a series of NACE papers about hydrogen permeation in supermartensitic stainless steels, the present contribution highlights hydrogen uptake and diffusion in respective TIG weld microstructures. Three different weld zones, namely the weld metal center-line, the fusion line region and the heat affected zone have been studied and compared to the base material. Similar to previous studies, such investigations have been carried out with a high and a medium alloyed steel, both have been welded with same type of matching high alloyed supermartensitic filler wire. It turned o
APA, Harvard, Vancouver, ISO, and other styles
4

Lyu, Gengyu, Yanan Wu, and Songhe Feng. "Deep Graph Matching for Partial Label Learning." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/459.

Full text
Abstract:
Partial Label Learning (PLL) aims to learn from training data where each instance is associated with a set of candidate labels, among which only one is correct. In this paper, we formulate the task of PLL problem as an ``instance-label'' matching selection problem, and propose a DeepGNN-based graph matching PLL approach to solve it. Specifically, we first construct all instances and labels as graph nodes into two different graphs respectively, and then integrate them into a unified matching graph by connecting each instance to its candidate labels. Afterwards, the graph attention mechanism is
APA, Harvard, Vancouver, ISO, and other styles
5

Castano, S., A. Ferrara, D. Lorusso, and S. Montanelli. "On the Ontology Instance Matching Problem." In 2008 19th International Conference on Database and Expert Systems Applications (DEXA). IEEE, 2008. http://dx.doi.org/10.1109/dexa.2008.31.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Amrouch, Siham, and Sihem Mostefai. "Ascendant Hierarchical Clustering for Instance Matching." In 2021 22nd International Arab Conference on Information Technology (ACIT). IEEE, 2021. http://dx.doi.org/10.1109/acit53391.2021.9677377.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wu, Yanan, He Liu, Songhe Feng, Yi Jin, Gengyu Lyu, and Zizhang Wu. "GM-MLIC: Graph Matching based Multi-Label Image Classification." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/163.

Full text
Abstract:
Multi-Label Image Classification (MLIC) aims to predict a set of labels that present in an image. The key to deal with such problem is to mine the associations between image contents and labels, and further obtain the correct assignments between images and their labels. In this paper, we treat each image as a bag of instances, and reformulate the task of MLIC as a instance-label matching selection problem. To model such problem, we propose a novel deep learning framework named Graph Matching based Multi-Label Image Classification (GM-MLIC), where Graph Matching (GM) scheme is introduced owing
APA, Harvard, Vancouver, ISO, and other styles
8

"MULTIPLE KERNEL LEARNING FOR ONTOLOGY INSTANCE MATCHING." In International Conference on Knowledge Engineering and Ontology Development. SciTePress - Science and and Technology Publications, 2010. http://dx.doi.org/10.5220/0003117403110318.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Liang, Qianhui Althea, and Herman Lam. "Web Service Matching by Ontology Instance Categorization." In 2008 IEEE International Conference on Services Computing (SCC). IEEE, 2008. http://dx.doi.org/10.1109/scc.2008.133.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Saveta, Tzanina, Evangelia Daskalaki, Giorgos Flouris, Irini Fundulaki, Melanie Herschel, and Axel-Cyrille Ngonga Ngomo. "Pushing the Limits of Instance Matching Systems." In WWW '15: 24th International World Wide Web Conference. ACM, 2015. http://dx.doi.org/10.1145/2740908.2742729.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!