Sciweavers

680 search results - page 121 / 136
» Mining Frequent Itemsets Using Genetic Algorithm
Sort
View
TCS
2008
14 years 9 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
109
Voted
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
15 years 3 months ago
Observing the swarm behaviour during its evolutionary design
Evolutionary Algorithms (EAs) can be used for designing Particle Swarm Optimization (PSO) algorithms that work, in some cases, considerably better than the human-designed ones. By...
Laura Diosan, Mihai Oltean
ECML
2005
Springer
14 years 11 months ago
Clustering and Metaclustering with Nonnegative Matrix Decompositions
Although very widely used in unsupervised data mining, most clustering methods are affected by the instability of the resulting clusters w.r.t. the initialization of the algorithm ...
Liviu Badea
103
Voted
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
15 years 10 months ago
Cleaning disguised missing data: a heuristic approach
In some applications such as filling in a customer information form on the web, some missing values may not be explicitly represented as such, but instead appear as potentially va...
Ming Hua, Jian Pei
WWW
2005
ACM
15 years 10 months ago
Popular web hot spots identification and visualization
This work aims a two-fold contribution: it presents a software to analyse logfiles and visualize popular web hot spots and, additionally, presents an algorithm to use this informa...
D. Avramouli, John D. Garofalakis, Dimitris J. Kav...