• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Robust Latent Feature Learning for Incomplete Big Data

Robust Latent Feature Learning for Incomplete Big Data

Paperback

Series: Springerbriefs in Computer Science

DatabasesGeneral ComputersProbability & Statistics

ISBN10: 9811981396
ISBN13: 9789811981395
Publisher: Springer Nature
Published: Dec 8 2022
Pages: 112
Weight: 0.42
Height: 0.27 Width: 6.14 Depth: 9.21
Language: English

Incomplete big data are frequently encountered in many industrial applications, such as recommender systems, the Internet of Things, intelligent transportation, cloud computing, and so on. It is of great significance to analyze them for mining rich and valuable knowledge and patterns. Latent feature analysis (LFA) is one of the most popular representation learning methods tailored for incomplete big data due to its high accuracy, computational efficiency, and ease of scalability. The crux of analyzing incomplete big data lies in addressing the uncertainty problem caused by their incomplete characteristics. However, existing LFA methods do not fully consider such uncertainty.

Also from

Wu, Di

Also in

Probability & Statistics