Sciweavers

4085 search results - page 243 / 817
» Benchmarking Data Mining Algorithms
Sort
View
ADC
2003
Springer
182views Database» more  ADC 2003»
15 years 11 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
ICDIM
2008
IEEE
16 years 1 months ago
A fast approximate algorithm for large-scale Latent Semantic Indexing
Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining....
Dell Zhang, Zheng Zhu
IDA
2009
Springer
15 years 11 months ago
Distributed Algorithm for Computing Formal Concepts Using Map-Reduce Framework
Searching for interesting patterns in binary matrices plays an important role in data mining and, in particular, in formal concept analysis and related disciplines. Several algorit...
Petr Krajca, Vilém Vychodil
ICDM
2010
IEEE
164views Data Mining» more  ICDM 2010»
15 years 4 months ago
On Finding Similar Items in a Stream of Transactions
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
Andrea Campagna, Rasmus Pagh
EUROGP
2000
Springer
15 years 10 months ago
Seeding Genetic Programming Populations
We show genetic programming (GP) populations can evolve under the influence of a Pareto multi-objective fitness and program size selection scheme, from "perfect" programs...
William B. Langdon, Peter Nordin