More Like this

1. A Large-Scale Evaluation Of Shape-Aware Neighborhood Weights And Neighborhood Sizes

   https://doi.org/10.1016/j.cad.2021.103107  

   Skrodzki, Martin; Zimmermann, Eric (December 2021, Computer-Aided Design)
2. Smooth neighborhood recommender systems.

   Dai, B.; Wang, J.; Shen, X.; Qu, A. (February 2019, Journal of machine learning research)

   Recommender systems predict users’ preferences over a large number of items by pooling similar information from other users and/or items in the presence of sparse observations. One major challenge is how to utilize user-item specific covariates and networks describing user-item interactions in a high-dimensional situation, for accurate personalized prediction. In this article, we propose a smooth neighborhood recommender in the framework of the latent factor models. A similarity kernel is utilized to borrow neighborhood information from continuous covariates over a user-item specific network, such as a user’s social network, where the grouping information defined by discrete covariates is also integrated through the network. Consequently, user-item specific information is built into the recommender to battle the ‘cold-start” issue in the absence of observations in collaborative and content- based filtering. Moreover, we utilize a “divide-and-conquer” version of the alternating least squares algorithm to achieve scalable computation, and establish asymptotic results for the proposed method, demonstrating that it achieves superior prediction accuracy. Finally, we illustrate that the proposed method improves substantially over its competitors in simulated examples and real benchmark data–Last.fm music data. 

   more » « less
3. Smooth neighborhood recommender systems

   Ben Dai, Junhui Wang (February 2019, Journal of machine learning research)

   Recommender systems predict users’ preferences over a large number of items by pooling similar information from other users and/or items in the presence of sparse observations. One major challenge is how to utilize user-item specific covariates and networks describing user-item interactions in a high-dimensional situation, for accurate personalized prediction. In this article, we propose a smooth neighborhood recommender in the framework of the latent factor models. A similarity kernel is utilized to borrow neighborhood information from continuous covariates over a user-item specific network, such as a user’s social network, where the grouping information defined by discrete covariates is also integrated through the network. Consequently, user-item specific information is built into the recommender to battle the ‘cold-start” issue in the absence of observations in collaborative and contentbased filtering. Moreover, we utilize a “divide-and-conquer” version of the alternating least squares algorithm to achieve scalable computation, and establish asymptotic results for the proposed method, demonstrating that it achieves superior prediction accuracy. Finally, we illustrate that the proposed method improves substantially over its competitors in simulated examples and real benchmark data–Last.fm music data. 

   more » « less
4. Uneven Neighborhood Recovery: Hurricane Damage and Neighborhood Change in the Houston–Galveston Region Since 1970

   https://doi.org/10.1111/cico.12390  

   Wyczalkowski, Christopher K.; Esnard, Ann‐Margaret; Lai, Betty S.; Holm, Eric J. (May 2019, City & Community)
5. Neighborhood disadvantage, residents' distress, and online social communication: Harnessing Twitter data to examine neighborhood effects

   https://doi.org/10.1002/jcop.21975  

   Booth, Jaime M.; Lin, Yu-Ru; Wei, Kai (March 2018, Journal of Community Psychology)