Software developers may write a number of similar source code fragments including the same mistake in software products. To remove such faulty fragments, inspect clones if they found bug their code. While various clone detection methods have been proposed to identify either blocks or functions, those tools do not always fit inspection task because fragment be much smaller than blocks, e.g. sing...

Similarity measures are essential to solve many pattern recognition problems such as classification, clustering, and retrieval problems. Various similarity measures are categorized in both syntactic and semantic relationships. In this paper we present a novel similarity, Unilateral Jaccard Similarity Coefficient (uJaccard), which doesn’t only take into consideration the space among two points b...

A common need in statistics is to assess whether two samples come from the same underlying population distribution. Existing two-sample tests often make limiting a priori assumptions, or cannot be easily generalized to multivariate data. We derive a new multivariate two-sample test that makes no a priori assumptions, has higher statistical power than previous tests, has better runtime performan...

This paper presents a new face detection method. We train a model that predicts the Jaccard distance between a sample sub-window and the ground truth face location. This model produces continuous outputs as opposite to the binary output produced by the widely used boosted cascade classifiers. To train this model we introduce a generalization of the binary classification boosting algorithms in w...

Random Amplified Polymorphic DNA (RAPD) markers was used to analyze the genetic structure of five Indigenous Egyptian’s chicken populations including Fayoumi, Dokki-4, Golden Montazah, Silver Montazah, and ElSalam, based on the taxa generated by the analysis of ten RAPD markers. The population genetic distances were estimated by using two cluster algorithms (UPGMA & NJ neighbor-joining) accompa...

<span lang="EN-US">The tremendous growth in the availability of enormous text data from a variety sources creates slew concerns and obstacles to discovering meaningful information. This advancement technology digital realm has resulted dispersion texts over millions web sites. Unstructured are densely packed with textual The discovery valuable intriguing relationships unstructured demands...

We initiate the study of finding the Jaccard center of a given collection N of sets. For two sets X,Y , the Jaccard index is defined as |X ∩ Y |/|X ∪ Y | and the corresponding distance is 1− |X ∩Y |/|X ∪Y |. The Jaccard center is a set C minimizing the maximum distance to any set of N . We show that the problem is NP-hard to solve exactly, and that it admits a PTAS while no FPTAS can exist unle...

We propose an approach for approximating the Jaccard similarity of two streams, J(A,B) = |A∩B| |A∪B| , for domains where this similarity is known to be high. Our method is based on a reduction from Jaccard similarity to F2 norm estimation, for which there exists a sketch that is efficient in terms of both size and compute time, which we augment by a sampling technique. Our approach offers an im...

Literature-based discovery (LBD) is focusing on automatically generating scientific hypotheses by uncovering hidden, previously unknown relations between existing knowledge. Co-occurrences between biomedical concepts can be represented by a network that consists of a set of nodes representing concepts and a set of edges representing their relationships. In this work we propose a method for link...