A carregar...
A New Fast Algorithm for Library Circulation Data Mining Based on FUP
As the first incremental association mining algorithm, FUP can well solve the problem, but the algorithm also has the deficiencies to produce a large set of candidates and multiple iterating the database, leading to the algorithm’s low execution efficiency when dealing with some large transactions w...
Na minha lista:
Main Authors: | , , , , |
---|---|
Formato: | Artigo |
Idioma: | Inglês |
Publicado em: |
Hindawi Limited
2022-01-01
|
Colecção: | Scientific Programming |
Acesso em linha: | http://dx.doi.org/10.1155/2022/1683099 |
Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|