Sciweavers

9849 search results - page 38 / 1970
» Algorithms and Experiments for the Webgraph
Sort
View
COLING
2010
14 years 8 months ago
Simple and Efficient Algorithm for Approximate Dictionary Matching
This paper presents a simple and efficient algorithm for approximate dictionary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. ...
Naoaki Okazaki, Jun-ichi Tsujii
EUSFLAT
2009
233views Fuzzy Logic» more  EUSFLAT 2009»
14 years 11 months ago
SaM: A Split and Merge Algorithm for Fuzzy Frequent Item Set Mining
This paper presents SaM, a split and merge algorithm for frequent item set mining. Its distinguishing qualities are an exceptionally simple algorithm and data structure, which not ...
Christian Borgelt, Xiaomeng Wang
135
Voted
ICASSP
2011
IEEE
14 years 5 months ago
Feature selection through gravitational search algorithm
In this paper we deal with the problem of feature selection by introducing a new approach based on Gravitational Search Algorithm (GSA). The proposed algorithm combines the optimi...
João Paulo Papa, Andre Pagnin, Silvana Arti...
110
Voted
ICASSP
2011
IEEE
14 years 5 months ago
Fast network querying algorithm for searching large-scale biological networks
Network querying aims to search a large network for subnetwork regions that are similar to a given query network. In this paper, we propose a novel algorithm for querying large sc...
Sayed Mohammad Ebrahim Sahraeian, Byung-Jun Yoon
SMC
2010
IEEE
158views Control Systems» more  SMC 2010»
14 years 11 months ago
A study of genetic algorithms for approximating the longest path in generic graphs
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
David Portugal, Carlos Henggeler Antunes, Rui Roch...