In this paper, we proposed a new solution to the reconstruction of image in order to solve the oversegmentation problem of watershed transformation which is widely used as an image segmentation method. The process for reconstruction of image consists of consolidation of edges and removal of local minima. The former(consolidation of edges) enhances the edge between the object in image background...

In this year’s Semantic Textual Similarity evaluation, we explore the contribution of models that provide soft similarity scores across spans of multiple words, over the previous year’s system. To this end, we explored the use of neural probabilistic language models and a TF-IDF weighted variant of Explicit Semantic Analysis. The neural language model systems used vector representations of indi...

This paper proposes a new fuzzy similarity measure to calculate the degree of similarity of generalized fuzzy numbers (GFN’s).The fuzzy similarity measure is developed by integrating the concept of centre of gravity (COG) points and fuzzy difference of distance of points of fuzzy numbers. A fuzzy description for difference of distances between fuzzy numbers in its turn exploits appropriate simi...

Data Cleaning is an important process that has been at the center of research interest in recent years. Poor data quality is the result of a variety of reasons, including data entry errors and multiple conventions for recording database fields, and has a significant impact on a variety of business issues. Hence, there is a pressing need for technologies that enable flexible (fuzzy) matching of ...

We present a novel approach to shape similarity estimation based on distance transformation and ordinal correlation. The proposed method operates in three steps: object alignment, contour to multilevel image transformation, and similarity evaluation. This approach is suitable for use in shape classification, content-based image retrieval, and performance evaluation of segmentation algorithms. T...

In Peer Data Management Systems (PDMS), each peer is an autonomous source that makes available a local schema. Information exchange occurs through the establishment of schema mappings between local schemas. To help matters, ontologies have been considered as uniform representation of local schemas (i.e., peer ontologies). Consequently, ontology matching techniques have been used to determine sc...

Deep Web database clustering is a key operation in organizing Deep Web resources. Cosine similarity in Vector Space Model (VSM) is used as the similarity computation in traditional ways. However it cannot denote the semantic similarity between the contents of two databases. In this paper how to cluster Deep Web databases semantically is discussed. Firstly, a fuzzy semantic measure, which integr...

Minimum spanning tree finds its huge application in network designing, approximation algorithms for NP-hard problems, clustering problems and many more. Many research works have been done to find minimum spanning tree due to its various applications. But, till date very few research works are available in finding minimum spanning tree in neutrosophic environment. This paper contributes signific...

Ratings are essentially important for collaborative filtering to identify similar users based on which recommendations are generated. However, traditional similarity measures (cosine similarity, Pearson correlation coefficient) suffer from issues: • Flat-value problem: COS=1, PCC non-computable • Opposite-value problem: PCC=-1 • Single-value problem: COS=1, PCC non-computable • Cross-value prob...

This paper describes a query-focused multi-document summarizer based on two distinct but complementary concepts: a) how much the sentence is related to the user query and b) how much the sentence is salient to the overall concept. Keeping these in focus we consider 6 important features: (1)Cosine Similarity (2)Lexical chain (3)BE overlaps (4)Question Focus overlap (5) Previous Sentence overlaps...