From post

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.

 

Другие публикации лиц с тем же именем

Improving Personalized Trip Recommendation by Avoiding Crowds., , , , и . CIKM, стр. 25-34. ACM, (2016)A Game Theoretical Approach to Defend Against Co-Resident Attacks in Cloud Computing: Preventing Co-Residence Using Semi-Supervised Learning., , , , и . IEEE Trans. Inf. Forensics Secur., 11 (3): 556-570 (2016)Approximating Dunn's Cluster Validity Indices for Partitions of Big Data., , , , и . IEEE Trans. Cybern., 49 (5): 1629-1641 (2019)An Online Unsupervised Dynamic Window Method to Track Repeating Patterns From Sensor Data., , , , и . IEEE Trans. Cybern., 52 (6): 5148-5160 (2022)Divide and Learn: A Divide and Conquer Approach for Predict+Optimize., , , , , и . CoRR, (2020)It's PageRank All The Way Down: Simplifying Deep Graph Networks., , , , и . SDM, стр. 172-180. SIAM, (2023)A Bayesian Classifier for Learning from Tensorial Data., , , , , и . ECML/PKDD (2), том 8189 из Lecture Notes in Computer Science, стр. 483-498. Springer, (2013)Urban Sensing for Anomalous Event Detection: - Distinguishing Between Legitimate Traffic Changes and Abnormal Traffic Variability., , , , , , и . ECML/PKDD (3), том 11053 из Lecture Notes in Computer Science, стр. 553-568. Springer, (2018)Wireless Network Simulation to Create Machine Learning Benchmark Data., , , , и . GLOBECOM, стр. 6378-6383. IEEE, (2022)A Divide and Conquer Algorithm for Predict+Optimize with Non-convex Problems., , , , , и . AAAI, стр. 3749-3757. AAAI Press, (2022)