Results 1 - 10 of 29,120

Detecting similar software applications

by Collin Mcmillan, Mark Grechanik, Denys Poshyvanyk - In ICSE , 2012
"... Abstract—Although popular text search engines allow users to retrieve similar web pages, source code search engines do not have this feature. Detecting similar applications is a notoriously difficult problem, since it implies that similar highlevel requirements and their low-level implementations ca ..."
Abstract - Cited by 18 (5 self) - Add to MetaCart
Abstract—Although popular text search engines allow users to retrieve similar web pages, source code search engines do not have this feature. Detecting similar applications is a notoriously difficult problem, since it implies that similar highlevel requirements and their low-level implementations

Finding community structure in networks using the eigenvectors of matrices

by M. E. J. Newman , 2006
"... We consider the problem of detecting communities or modules in networks, groups of vertices with a higher-than-average density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as “modularity ” over possible div ..."
Abstract - Cited by 502 (0 self) - Add to MetaCart
divisions of a network. Here we show that this maximization process can be written in terms of the eigenspectrum of a matrix we call the modularity matrix, which plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations. This result leads us to a

Duplicate Record Detection: A Survey

by Ahmed K. Elmagarmid, Panagiotis G. Ipeirotis, Vassilios S. Verykios , 2007
"... Often, in the real world, entities have two or more representations in databases. Duplicate records do not share a common key and/or they contain errors that make duplicate matching a difficult task. Errors are introduced as the result of transcription errors, incomplete information, lack of standa ..."
Abstract - Cited by 448 (11 self) - Add to MetaCart
of standard formats, or any combination of these factors. In this paper, we present a thorough analysis of the literature on duplicate record detection. We cover similarity metrics that are commonly used to detect similar field entries, and we present an extensive set of duplicate detection algorithms

Detecting similar applications with collaborative tagging

by Ferdian Thung, David Lo, Lingxiao Jiang - In ICSM , 2012
"... Abstract—Detecting similar applications are useful for var-ious purposes ranging from program comprehension, rapid prototyping, plagiarism detection, and many more. McMillan et al. have proposed a solution to detect similar applications based on common Java API usage patterns. Recently, collaborativ ..."
Abstract - Cited by 9 (2 self) - Add to MetaCart
Abstract—Detecting similar applications are useful for var-ious purposes ranging from program comprehension, rapid prototyping, plagiarism detection, and many more. McMillan et al. have proposed a solution to detect similar applications based on common Java API usage patterns. Recently

Detecting Long-Run Abnormal Stock Returns: The Empirical Power and Specification of Test Statistics

by Brad M. Barber, John D. Lyon - Journal of Financial Economics , 1997
"... We analyze the empirical power and specification of test statistics in event studies designed to detect long-run (one- to five-year) abnormal stock returns. We document that test statistics based on abnormal returns calculated using a reference portfolio, such as a market index, are misspecified (em ..."
Abstract - Cited by 548 (9 self) - Add to MetaCart
We analyze the empirical power and specification of test statistics in event studies designed to detect long-run (one- to five-year) abnormal stock returns. We document that test statistics based on abnormal returns calculated using a reference portfolio, such as a market index, are misspecified

Hidden Markov models for detecting remote protein homologies

by Kevin Karplus, Christian Barrett, Richard Hughey - Bioinformatics , 1998
"... A new hidden Markov model method (SAM-T98) for nding remote homologs of protein sequences is described and evaluated. The method begins with a single target sequence and iteratively builds a hidden Markov model (hmm) from the sequence and homologs found using the hmm for database search. SAM-T98 is ..."
Abstract - Cited by 462 (15 self) - Add to MetaCart
is also used to construct model libraries automatically from sequences in structural databases. We evaluate the SAM-T98 method with four datasets. Three of the test sets are fold-recognition tests, where the correct answers are determined by structural similarity. The fourth uses a curated database

Clustering by passing messages between data points

by Brendan J. Frey, Delbert Dueck - Science , 2007
"... Clustering data by identifying a subset of representative examples is important for processing sensory signals and detecting patterns in data. Such “exemplars ” can be found by randomly choosing an initial subset of data points and then iteratively refining it, but this works well only if that initi ..."
Abstract - Cited by 696 (8 self) - Add to MetaCart
Clustering data by identifying a subset of representative examples is important for processing sensory signals and detecting patterns in data. Such “exemplars ” can be found by randomly choosing an initial subset of data points and then iteratively refining it, but this works well only

Local grayvalue invariants for image retrieval

by Cordelia Schmid, Roger Mohr - IEEE Transactions on Pattern Analysis and Machine Intelligence , 1997
"... Abstract—This paper addresses the problem of retrieving images from large image databases. The method is based on local grayvalue invariants which are computed at automatically detected interest points. A voting algorithm and semilocal constraints make retrieval possible. Indexing allows for efficie ..."
Abstract - Cited by 548 (27 self) - Add to MetaCart
Abstract—This paper addresses the problem of retrieving images from large image databases. The method is based on local grayvalue invariants which are computed at automatically detected interest points. A voting algorithm and semilocal constraints make retrieval possible. Indexing allows

Preferred reporting items for systematic reviews and meta-analyses: the PRISMA statement. Br Med J.

by David Moher , Larissa Shamseer , Mike Clarke , Davina Ghersi , Alessandro Liberatiˆ , Mark Petticrew , Paul Shekelle , Lesley A Stewart , Prisma-P Group , 2009
"... Abstract Systematic reviews should build on a protocol that describes the rationale, hypothesis, and planned methods of the review; few reviews report whether a protocol exists. Detailed, well-described protocols can facilitate the understanding and appraisal of the review methods, as well as the d ..."
Abstract - Cited by 688 (3 self) - Add to MetaCart
as the detection of modifications to methods and selective reporting in completed reviews. We describe the development of a reporting guideline, the Preferred Reporting Items for Systematic reviews and Meta-Analyses for Protocols 2015 (PRISMA-P 2015). PRISMA-P consists of a 17-item checklist intended to facilitate

Object Recognition from Local Scale-Invariant Features

by David G. Lowe
"... An object recognition system has been developed that uses a new class of local image features. The features are invariant to image scaling, translation, and rotation, and partially invariant to illumination changes and affine or 3D projection. These features share similar properties with neurons in ..."
Abstract - Cited by 2739 (13 self) - Add to MetaCart
An object recognition system has been developed that uses a new class of local image features. The features are invariant to image scaling, translation, and rotation, and partially invariant to illumination changes and affine or 3D projection. These features share similar properties with neurons
Results 1 - 10 of 29,120