An index model for quality evaluation based on the formula of similarity membership functions in the fuzzy c-means (FCM) clustering algorithm is proposed. Summing up the weighted similarity degrees between an observation and designed specific quality-ordered levels develops an alternative overall index. Stretching the values of the controlling parameters in the formula of the similarity members...

in order to investigate the weed diversity and modeling light interception in sole and intercropping millet and bean an experiment was conducted as complete randomized block design with 4 treatments and 4 replications at the agricultural research station, ferdowsi university of mashhad, iran, during 2008. treatments included monocultures, intercropping of millet and bean and a control treatment...

Subjective expected relative similarity (SERS) is a descriptive theory that explains cooperation levels in single-step prisoner's dilemma (PD) games. SERS predicts that individuals cooperate whenever their subjectively perceived similarity with their opponent exceeds a situational index, namely the game's similarity threshold. A thought experiment and 2 experimental studies illustrate and explo...

Search engines do not provide speci c searches for Web forms related to the Deep Web, in particular, similarity search. To deal with this lack, we propose a query-by-similarity system called WF-Sim, and this paper presents the indexing strategy adopted by WF-Sim for querying-by-similarity Web forms. It is centered on suitable index structures to the main kinds of queries posed on Web forms, as ...

Nowadays digital image compression and decompression techniques are very much important. So our aim is to calculate the quality of face and other regions of the compressed image with respect to the original image. Image segmentation is typically used to locate objects and boundaries (lines, curves etc.)in images. After segmentation the image is changed into something which is more meaningful to...

Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, called the -kdB tree, for fast spatial similarity joins on high-dimensional points. This index structure reduces the number of neighboring leaf nodes that are considered for the join test, as well as the traversal cost of f...

Sets and sequences are commonly used to model complex entities. Attributes containing sets or sequences of elements appear in various application domains, e.g., in telecommunication and retail databases, web server log tools, bioinformatics, etc. However, the support for such attributes is usually limited to definition and storage in relational tables. Contemporary database systems don’t suppor...

This paper studies the estimation of the number of clusters using the so-called stability-based approach, where clusters obtained for two subsets of the data set are compared via a similarity index and the decision regarding the number of clusters is taken based on the statistics of the index over randomly selected subsets. We introduce a new similarity index , and analyze the consistency of th...

Abstract: This paper proposes a method for retrieving similar question articles from Web bulletin boards, which basically use the cosine similarity index derived from a user’s query sentence and article question sentences. Since these sentences are mostly short, it is difficult to distinguish whether article question sentences are similar to a user’s query sentence or not simply by applying the...

Lots of similarity-based algorithms have been designed to deal with the problem of link prediction in the past decade. In order to improve prediction accuracy, a novel cosine similarity index CD based on distance between nodes and cosine value between vectors is proposed in this paper. Firstly, node coordinate matrix can be obtained by node distances which are different from distance matrix and...