๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[ACM Press the 1st International Workshop - Beijing, China (2012.08.12-2012.08.16)] Proceedings of the 1st International Workshop on Context Discovery and Data Mining - ContextDD '12 - A novel neighbor selection approach for KNN

โœ Scribed by Kaveh-Yazdy, Fatemeh; Zare-Mirakabad, Mohammad-Reza; Xia, Feng

Book ID
121201500
Publisher
ACM Press
Year
2012
Weight
306 KB
Category
Article
ISBN
1450315534

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

[ACM Press the 1st International Worksho
[ACM Press the 1st International Workshop - Beijing, China (2012.08.12-2012.08.12)] Proceedings of the 1st International Workshop on Big Data, Streams and Heterogeneous Source Mining Algorithms, Systems, Programming Models and Applications - BigMine '12 - A parallel graph partitioning algorithm to speed up the large-scale distributed graph mining
โœ Zeng, ZengFeng; Wu, Bin; Wang, Haoyu ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› ACM Press โš– 730 KB
[ACM Press the 1st International Worksho
[ACM Press the 1st International Workshop - Beijing, China (2012.08.12-2012.08.12)] Proceedings of the 1st International Workshop on Big Data, Streams and Heterogeneous Source Mining Algorithms, Systems, Programming Models and Applications - BigMine '12 - A parallel graph partitioning algorithm to speed up the large-scale distributed graph mining
โœ Zeng, ZengFeng; Wu, Bin; Wang, Haoyu ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› ACM Press โš– 730 KB

For the large-scale distributed graph mining, the graph is distributed over a cluster of nodes, thus performing computations on the distributed graph is expensive when large amount of data have to be moved between different computers. A good partitioning of distributed graph is needed to reduce the