2008 Eighth IEEE International Conference on Data Mining 2008
DOI: 10.1109/icdm.2008.52
|View full text |Cite
|
Sign up to set email alerts
|

Border Sampling through Coupling Markov Chain Monte Carlo

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2009
2009
2017
2017

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 11 publications
0
1
0
Order By: Relevance
“…However, PENN has a quadratic time complexity due to kNN is quadratic for classification [2] [20]. PEBS is also quadratic due to PENN and the original PBS [9] although PBS can be scaled up [10].…”
Section: Pebs Algorithm: a Hybrid Of Penn And Pbsmentioning
confidence: 99%
“…However, PENN has a quadratic time complexity due to kNN is quadratic for classification [2] [20]. PEBS is also quadratic due to PENN and the original PBS [9] although PBS can be scaled up [10].…”
Section: Pebs Algorithm: a Hybrid Of Penn And Pbsmentioning
confidence: 99%