A sample decreasing threshold greedy-based algorithm for big data summarisation

As the scale of datasets used for big data applications expands rapidly, there have been increased efforts to develop faster algorithms. This paper addresses big data summarisation problems using the submodular maximisation approach and proposes an efficient algorithm for maximising general non-nega...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of big data Ročník 8; číslo 1; s. 1 - 21
Hlavní autoři:	Li, Teng, Shin, Hyo-Sang, Tsourdos, Antonios
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Cham Springer International Publishing 09.02.2021 Springer Nature B.V SpringerOpen
Témata:	Algorithms Approximation Big Data Big data summarisation Communications Engineering Complexity Computational Science and Engineering Computer Science Data Mining and Knowledge Discovery Database Management Experiments Greedy algorithms Information Storage and Retrieval k-extendible system constraints Mathematical Applications in Computer Science Maximization Networks Optimization Personalised recommendation Random sampling Recommender systems Sampling Submodular maximisation Summarization Thresholds Personalised recommendation extendible system constraints Submodular maximisation Big data summarisation
ISSN:	2196-1115, 2196-1115
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!