Abstract | ||
---|---|---|
•Incremental estimation of commute time in constant time using random walks.•The first method to estimate the commute time in an online fashion.•A design of an online anomaly detection application using the incremental commute time.•The proposed method is effective of in terms of accuracy and performance. |
Year | DOI | Venue |
---|---|---|
2019 | 10.1016/j.patcog.2018.11.012 | Pattern Recognition |
Keywords | Field | DocType |
Commute time,Random walks,Online learning,Anomaly detection,Manifold learning | Anomaly detection,Laplacian matrix,Personalized search,Collaborative filtering,Ranking,Theoretical computer science,Eigendecomposition of a matrix,Artificial intelligence,Cluster analysis,Nonlinear dimensionality reduction,Machine learning,Mathematics | Journal |
Volume | Issue | ISSN |
88 | 1 | 0031-3203 |
Citations | PageRank | References |
0 | 0.34 | 22 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Nguyen Lu Dang Khoa | 1 | 62 | 8.44 |
Yang Wang | 2 | 9 | 6.83 |
Sanjay Chawla | 3 | 1372 | 105.09 |