Sciweavers

23 search results - page 4 / 5
» Phoenix-based clone detection using suffix trees
Sort
View
ECIR
2006
Springer
13 years 6 months ago
Improving Quality of Search Results Clustering with Approximate Matrix Factorisations
Abstract. In this paper we show how approximate matrix factorisations can be used to organise document summaries returned by a search engine into meaningful thematic categories. We...
Stanislaw Osinski
LREC
2010
170views Education» more  LREC 2010»
13 years 6 months ago
Arabic Word Segmentation for Better Unit of Analysis
The Arabic language has a very rich morphology where a word is composed of zero or more prefixes, a stem and zero or more suffixes. This makes Arabic data sparse compared to other...
Yassine Benajiba, Imed Zitouni
BMCBI
2005
109views more  BMCBI 2005»
13 years 5 months ago
Genome comparison without alignment using shortest unique substrings
Background: Sequence comparison by alignment is a fundamental tool of molecular biology. In this paper we show how a number of sequence comparison tasks, including the detection o...
Bernhard Haubold, Nora Pierstorff, Friedrich M&oum...
JMLR
2008
148views more  JMLR 2008»
13 years 5 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
ICDE
2003
IEEE
247views Database» more  ICDE 2003»
14 years 6 months ago
CLUSEQ: Efficient and Effective Sequence Clustering
Analyzing sequence data has become increasingly important recently in the area of biological sequences, text documents, web access logs, etc. In this paper, we investigate the pro...
Jiong Yang, Wei Wang 0010