( en | de | ru )

 

Disambiguation of "Dai, Bi-Ru"

Author of the publication

copydeleteadd this publication to your clipboard
Power of Bosom Friends, POI Recommendation by Learning Preference of Close Friends and Similar Users.

, and . DaWaK, volume 9829 of Lecture Notes in Computer Science, page 179-192. Springer, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Zhen Ru Dai

Hongguang Bi

Bi Wu

Bi Yu

Shasha Bi

 

Other publications of authors with the same name

A Partial Demand Fulfilling Capacity Constrained Clustering Algorithm to Static Bike Rebalancing Problem., and . ICDM, volume 10933 of Lecture Notes in Computer Science, page 240-253. Springer, (2018)LF-CARS: A Loose Fragment-Based Consensus Clustering Algorithm with a Robust Similarity., and . Discovery Science, volume 7569 of Lecture Notes in Computer Science, page 154-168. Springer, (2012)A Framework of the Semi-supervised Multi-label Classification with Non-uniformly Distributed Incomplete Labels., and . DaWaK, volume 9829 of Lecture Notes in Computer Science, page 267-280. Springer, (2016)An Instance Selection Algorithm Based on Reverse Nearest Neighbor., and . PAKDD (1), volume 6634 of Lecture Notes in Computer Science, page 1-12. Springer, (2011)Predicting Locations of Mobile Users Based on Behavior Semantic Mining., , and . PAKDD Workshops, volume 8643 of Lecture Notes in Computer Science, page 168-180. Springer, (2014)Opinion Mining on Social Media Data., and . MDM (2), page 91-96. IEEE Computer Society, (2013)978-1-4673-6068-5.Multi-Laplacian GAN with Edge Enhancement for Face Super Resolution., and . ICPR, page 3505-3512. IEEE, (2020)A Framework of Recommendation System Based on Both Network Structure and Messages., , and . ASONAM, page 709-714. IEEE Computer Society, (2011)Accelerating K-Means by Grouping Points Automatically., and . DaWaK, volume 10440 of Lecture Notes in Computer Science, page 199-213. Springer, (2017)Twain: Two-end association miner with precise frequent exhibition periods., , and . ACM Trans. Knowl. Discov. Data, 1 (2): 8 (2007)