Language:
English
繁體中文
Help
回圖書館首頁
手機版館藏查詢
Login
Back
Switch To:
Labeled
|
MARC Mode
|
ISBD
Robust latent feature learning for i...
~
Wu, Di.
Linked to FindBook
Google Book
Amazon
博客來
Robust latent feature learning for incomplete big data
Record Type:
Electronic resources : Monograph/item
Title/Author:
Robust latent feature learning for incomplete big data/ by Di Wu.
Author:
Wu, Di.
Published:
Singapore :Springer Nature Singapore : : 2023.,
Description:
xiii, 112 p. :ill., digital ;24 cm.
[NT 15003449]:
Chapter 1. Introduction -- Chapter 2. Basis of Latent Feature Learning -- Chapter 3. Robust Latent Feature Learning based on Smooth L1-norm -- Chapter 4. Improving robustness of Latent Feature Learning Using L1-norm -- Chapter 5. Improve robustness of latent feature learning using double-space -- Chapter 6. Data-characteristic-aware latent feature learning -- Chapter 7. Posterior-neighborhood-regularized Latent Feature Learning -- Chapter 8. Generalized deep latent feature learning -- Chapter 9. Conclusion and Outlook.
Contained By:
Springer Nature eBook
Subject:
Big data. -
Online resource:
https://doi.org/10.1007/978-981-19-8140-1
ISBN:
9789811981401
Robust latent feature learning for incomplete big data
Wu, Di.
Robust latent feature learning for incomplete big data
[electronic resource] /by Di Wu. - Singapore :Springer Nature Singapore :2023. - xiii, 112 p. :ill., digital ;24 cm. - SpringerBriefs in computer science,2191-5776. - SpringerBriefs in computer science..
Chapter 1. Introduction -- Chapter 2. Basis of Latent Feature Learning -- Chapter 3. Robust Latent Feature Learning based on Smooth L1-norm -- Chapter 4. Improving robustness of Latent Feature Learning Using L1-norm -- Chapter 5. Improve robustness of latent feature learning using double-space -- Chapter 6. Data-characteristic-aware latent feature learning -- Chapter 7. Posterior-neighborhood-regularized Latent Feature Learning -- Chapter 8. Generalized deep latent feature learning -- Chapter 9. Conclusion and Outlook.
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. In this book, the author introduces several robust latent feature learning methods to address such uncertainty for effectively and efficiently analyzing incomplete big data, including robust latent feature learning based on smooth L1-norm, improving robustness of latent feature learning using L1-norm, improving robustness of latent feature learning using double-space, data-characteristic-aware latent feature learning, posterior-neighborhood-regularized latent feature learning, and generalized deep latent feature learning. Readers can obtain an overview of the challenges of analyzing incomplete big data and how to employ latent feature learning to build a robust model to analyze incomplete big data. In addition, this book provides several algorithms and real application cases, which can help students, researchers, and professionals easily build their models to analyze incomplete big data.
ISBN: 9789811981401
Standard No.: 10.1007/978-981-19-8140-1doiSubjects--Topical Terms:
2045508
Big data.
LC Class. No.: QA76.9.B45 / W8 2023
Dewey Class. No.: 005.7
Robust latent feature learning for incomplete big data
LDR
:03141nmm a2200337 a 4500
001
2314158
003
DE-He213
005
20221206200200.0
006
m d
007
cr nn 008mamaa
008
230902s2023 si s 0 eng d
020
$a
9789811981401
$q
(electronic bk.)
020
$a
9789811981395
$q
(paper)
024
7
$a
10.1007/978-981-19-8140-1
$2
doi
035
$a
978-981-19-8140-1
040
$a
GP
$c
GP
041
0
$a
eng
050
4
$a
QA76.9.B45
$b
W8 2023
072
7
$a
UN
$2
bicssc
072
7
$a
COM031000
$2
bisacsh
072
7
$a
UN
$2
thema
082
0 4
$a
005.7
$2
23
090
$a
QA76.9.B45
$b
W959 2023
100
1
$a
Wu, Di.
$3
1018601
245
1 0
$a
Robust latent feature learning for incomplete big data
$h
[electronic resource] /
$c
by Di Wu.
260
$a
Singapore :
$b
Springer Nature Singapore :
$b
Imprint: Springer,
$c
2023.
300
$a
xiii, 112 p. :
$b
ill., digital ;
$c
24 cm.
490
1
$a
SpringerBriefs in computer science,
$x
2191-5776
505
0
$a
Chapter 1. Introduction -- Chapter 2. Basis of Latent Feature Learning -- Chapter 3. Robust Latent Feature Learning based on Smooth L1-norm -- Chapter 4. Improving robustness of Latent Feature Learning Using L1-norm -- Chapter 5. Improve robustness of latent feature learning using double-space -- Chapter 6. Data-characteristic-aware latent feature learning -- Chapter 7. Posterior-neighborhood-regularized Latent Feature Learning -- Chapter 8. Generalized deep latent feature learning -- Chapter 9. Conclusion and Outlook.
520
$a
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. In this book, the author introduces several robust latent feature learning methods to address such uncertainty for effectively and efficiently analyzing incomplete big data, including robust latent feature learning based on smooth L1-norm, improving robustness of latent feature learning using L1-norm, improving robustness of latent feature learning using double-space, data-characteristic-aware latent feature learning, posterior-neighborhood-regularized latent feature learning, and generalized deep latent feature learning. Readers can obtain an overview of the challenges of analyzing incomplete big data and how to employ latent feature learning to build a robust model to analyze incomplete big data. In addition, this book provides several algorithms and real application cases, which can help students, researchers, and professionals easily build their models to analyze incomplete big data.
650
0
$a
Big data.
$3
2045508
650
1 4
$a
Data Science.
$3
3538937
650
2 4
$a
Data Analysis and Big Data.
$3
3538537
650
2 4
$a
Data Mining and Knowledge Discovery.
$3
898250
710
2
$a
SpringerLink (Online service)
$3
836513
773
0
$t
Springer Nature eBook
830
0
$a
SpringerBriefs in computer science.
$3
1567571
856
4 0
$u
https://doi.org/10.1007/978-981-19-8140-1
950
$a
Computer Science (SpringerNature-11645)
based on 0 review(s)
Location:
ALL
電子資源
Year:
Volume Number:
Items
1 records • Pages 1 •
1
Inventory Number
Location Name
Item Class
Material type
Call number
Usage Class
Loan Status
No. of reservations
Opac note
Attachments
W9450408
電子資源
11.線上閱覽_V
電子書
EB QA76.9.B45 W8 2023
一般使用(Normal)
On shelf
0
1 records • Pages 1 •
1
Multimedia
Reviews
Add a review
and share your thoughts with other readers
Export
pickup library
Processing
...
Change password
Login