Sciweavers

292 search results - page 2 / 59
» An Experimental Analysis of Robinson-Foulds Distance Matrix ...
Sort
View
IPL
2007
89views more  IPL 2007»
13 years 5 months ago
On the longest path algorithm for reconstructing trees from distance matrices
Culberson and Rudnicki [1] gave an algorithm that reconstructs a degree d restricted tree from its distance matrix. According to their analysis, it runs in time O(dn logd n) for t...
Lev Reyzin, Nikhil Srivastava
CLEF
2011
Springer
12 years 5 months ago
Intrinsic Plagiarism Detection Using Character Trigram Distance Scores - Notebook for PAN at CLEF 2011
Abstract In this paper, we describe a novel approach to intrinsic plagiarism detection. Each suspicious document is divided into a series of consecutive, potentially overlapping â€...
Mike Kestemont, Kim Luyckx, Walter Daelemans
SIAMMAX
2010
164views more  SIAMMAX 2010»
13 years 3 days ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
ICTAI
2010
IEEE
13 years 3 months ago
Discountings of a Belief Function Using a Confusion Matrix
In this paper, we present an analysis of different approaches relative to the correction of belief functions based on the results given by a confusion matrix. Three different mecha...
Zied Elouedi, Eric Lefevre, David Mercier
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
13 years 3 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu