Results 221 to 230 of about 499,671 (260)
Some of the next articles are maybe not open access.
Two-dimensional pattern matching by sampling
Information Processing Letters, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Crochemore, Maxime +2 more
openaire +2 more sources
Distance functions for matching in small samples
Computational Statistics & Data Analysis, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
E. Dettmann, C. Becker, C. Schmeißer
openaire +1 more source
Sample Evaluation of Ontology-Matching Systems. [PDF]
, 2007 Ontology matching exists to solve practical problems. Hence, methodologies to find and evaluate solutions for ontology matching should be centered on practical problems. In this paper we propose two statistically-founded evaluation techniques to assess ontology-matching performance that are based on the application of the alignment.
Hage, W.R. van +2 more
openaire +2 more sources
Active Sampling for Entity Matching with Guarantees
ACM Transactions on Knowledge Discovery from Data, 2013In entity matching, a fundamental issue while training a classifier to label pairs of entities as either duplicates or nonduplicates is the one of selecting informative training examples. Although active learning presents an attractive solution to this problem, previous approaches minimize the misclassification rate (0--1 loss) of ...
Kedar Bellare +3 more
openaire +2 more sources
Solving the Nonresponse Problem With Sample Matching?
Social Science Computer Review, 2015Over the years, it has become clear that probability sampling is a scientifically sound way to select a sample for a survey. With decreasing response rates, one may wonder, however, to what extent this paradigm still holds. Indeed, due to nonresponse, probability sampling surveys more and more resemble self-selection surveys.
openaire +2 more sources
Markov chains for sampling matchings.
2009Markov Chain Monte Carlo algorithms are often used to sample combinatorial structures such as matchings and independent sets in graphs. A Markov chain is defined whose state space includes the desired sample space, and which has an appropriate stationary distribution.
openaire +1 more source
Optimizing matching time interval and matching radius in on-demand ride-sourcing markets
Transportation Research Part B: Methodological, 2020Hai Yang, Qin Xiaoran, Jieping Ye
exaly