Sciweavers

338 search results - page 1 / 68
» A Beam-Search Extraction Algorithm for Comparable Data
Sort
View
ACL
2009
13 years 2 months ago
A Beam-Search Extraction Algorithm for Comparable Data
This paper extends previous work on extracting parallel sentence pairs from comparable data (Munteanu and Marcu, 2005). For a given source sentence S, a maximum entropy (ME) class...
Christoph Tillmann
WABI
2007
Springer
122views Bioinformatics» more  WABI 2007»
13 years 10 months ago
Algorithms for the Extraction of Synteny Blocks from Comparative Maps
In comparing genomic maps, it is often difficult to distinguish mapping errors and incorrectly resolved paralogies from genuine rearrangements of the genomes. A solution to this ...
Vicky Choi, Chunfang Zheng, Qian Zhu, David Sankof...
KDD
2002
ACM
196views Data Mining» more  KDD 2002»
14 years 4 months ago
Comparing Two Recommender Algorithms with the Help of Recommendations by Peers
Abstract. Since more and more Web sites, especially sites of retailers, offer automatic recommendation services using Web usage mining, evaluation of recommender algorithms has bec...
Andreas Geyer-Schulz, Michael Hahsler
AAAI
2006
13 years 5 months ago
A Direct Evolutionary Feature Extraction Algorithm for Classifying High Dimensional Data
Among various feature extraction algorithms, those based on genetic algorithms are promising owing to their potential parallelizability and possible applications in large scale an...
Qijun Zhao, David Zhang, Hongtao Lu
BIS
2010
159views Business» more  BIS 2010»
12 years 11 months ago
Comparing Intended and Real Usage in Web Portal: Temporal Logic and Data Mining
Nowadays the software systems, including web portals, are developed from a priori assumptions about how the system will be used. However, frequently these assumptions hold only par...
Jérémy Besson, Ieva Mitasiunaite, Au...