TR Dizin İndeksli Yayınlar Koleksiyonu / TR Dizin Indexed Publications Collection

Permanent URI for this collectionhttps://hdl.handle.net/20.500.14365/4

Browse

Search Results

Now showing 1 - 2 of 2
  • Article
    Certainty Factor Model in Paraphrase Detection
    (Pamukkale Univ, 2021) Metin, Senem Kumova; Karaoglan, Bahar; Kisla, Tarik; Soleymanzadeh, Katira
    In this paper, we address the problem of uncertainty management in identification of paraphrase sentence pairs. Paraphrase sentences are simply sets/pairs of sentences that express the same facts and/or opinions using different words or order of words. We propose the use of certainty factor (CF) model in paraphrase detection. A set of succeeding paraphrase detection features (generic and distance based features) is built by filtering and this set is used as evidences in CF model. The CF model is evaluated by F1 and accuracy measures on Microsoft Research Paraphrase corpus. The results are compared to the well-known Bayesian reasoning. The experimental results showed that CF model is an alternating paraphrase detection method to Bayes model.
  • Article
    Estimating the Difficulty of Tartarus Instances
    (Pamukkale Univ, 2021) Oguz, Kaya
    Tartarus is a commonly used benchmark problem for genetic programming. However, it has never been fully explored for its difficulty tuning property. Using the data from a previous study in which we have executed millions of Tartarus instances, we contribute to the literature with an equation to estimate their difficulty. Our approach uses four metrics that are embedded into the equation. These metrics are related to the number of clusters and clusters sizes, the distances of boxes to the edges of the board grid, the number of boxes around the agent, and the minimum number of actions for the agent to reach the largest cluster. The coefficients of these metrics have been fit to the data using the general linear model and a mean residual error of similar to 0.1 has been achieved. This is the first study that can estimate the difficulty of a Tartarus board without modifying the problem in any way.