Dynamic Sampling Procedure for Decomposable Random Networks
This research studies the problem of node ranking in a random network. Specifically, we consider a Markov chain with several ergodic classes and unknown transition probabilities which can be estimated by sampling. The objective is to select all of the best nodes in each ergodic class. A sampling pro...
Saved in:
Main Authors: | Li, Haidong, Peng, Yijie, Xu, Xiaoyun, Chen, Chun-Hung, Heidergott, Bernd F |
---|---|
Format: | text |
Published: |
Archīum Ateneo
2019
|
Subjects: | |
Online Access: | https://archium.ateneo.edu/gsb-pubs/65 https://ieeexplore.ieee.org/abstract/document/9004795 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Ateneo De Manila University |
Similar Items
-
Efficient Learning for Decomposing and Optimizing Random Networks
by: Li, Haidong, et al.
Published: (2022) -
Web page cleaning for web mining
by: YI LAN
Published: (2010) -
FADA: Find All Distinct Answers
by: Yang, H., et al.
Published: (2013) -
Effectiveness of Web page classification on finding list answers
by: Yang, H., et al.
Published: (2013) -
Stylistic and lexical co-training for Web block classification
by: Lee, C.H., et al.
Published: (2013)