skip to main content
10.1145/3340531.3412030acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
research-article

Collective Embedding with Feature Importance: A Unified Approach for Spatiotemporal Network Embedding

Published: 19 October 2020 Publication History

Abstract

In the last decade, there has been great progress in the field of machine learning and deep learning. These models have been instrumental in addressing a great number of problems. However, they have struggled when it comes to dealing with high dimensional data. In recent years, representation learning models have proven to be quite efficient in addressing this problem as they are capable of capturing effective lower-dimensional representations of the data. However, most of the existing models are quite ineffective when it comes to dealing with high dimensional spatiotemporal data as they encapsulate complex spatial and temporal relationships that exist among real-world objects. High-dimensional spatiotemporal data of cities represent urban communities. By learning their social structure we can better quantitatively depict them and understand factors influencing rapid growth, expansion, and changes.
In this paper, we propose a collective embedding framework that leverages the use of auto-encoders and Laplacian score to learn effective embeddings of spatiotemporal networks of urban communities. In addition, we also develop a weighted degree centrality measure for constructing spatiotemporal heterogeneous networks. To evaluate the performance of our proposed model, we implement it on real-world urban community data. Experimental results demonstrate the effectiveness of our model over state-of-the-art alternatives.

Supplementary Material

MP4 File (3340531.3412030.mp4)
We present a collective embedding framework that leverages the use of auto-encoders and Laplacian score to learn effective embeddings of spatiotemporal networks of urban communities. In addition, we also develop a weighted degree centrality measure for constructing spatiotemporal heterogeneous networks. To evaluate the performance of our proposed model, we implement it on real-world urban community data. Experimental results demonstrate the effectiveness of our model over state-of-the-art alternatives.

References

[1]
Alain Barrat, Marc Barthelemy, Romualdo Pastor-Satorras, and Alessandro Vespignani. 2004. The architecture of complex weighted networks. Proceedings of the national academy of sciences, Vol. 101, 11 (2004), 3747--3752.
[2]
Yoshua Bengio, Aaron Courville, and Pascal Vincent. 2013. Representation learning: A review and new perspectives. IEEE transactions on pattern analysis and machine intelligence, Vol. 35, 8 (2013), 1798--1828.
[3]
Christopher Burges, Tal Shaked, Erin Renshaw, Ari Lazier, Matt Deeds, Nicole Hamilton, and Gregory N Hullender. 2005. Learning to rank using gradient descent. In Proceedings of the 22nd International Conference on Machine learning (ICML-05). 89--96.
[4]
Christopher JC Burges. 2010. From ranknet to lambdarank to lambdamart: An overview. Learning, Vol. 11, 23--581 (2010), 81.
[5]
Shaosheng Cao, Wei Lu, and Qiongkai Xu. 2015. Grarep: Learning graph representations with global structural information. In Proceedings of the 24th ACM International on Conference on Information and Knowledge Management. ACM, 891--900.
[6]
Zhe Cao, Tao Qin, Tie-Yan Liu, Ming-Feng Tsai, and Hang Li. 2007. Learning to rank: from pairwise approach to listwise approach. In Proceedings of the 24th international conference on Machine learning. ACM, 129--136.
[7]
Dakshak Keerthi Chandra, Pengyang Wang, Jennifer Leopold, and Yanjie Fu. 2019. Collective Representation Learning on Spatiotemporal Heterogeneous Information Networks. In Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems 319--328.
[8]
Aaron Courville, James Bergstra, and Yoshua Bengio. 2011. Unsupervised models of images by spike-and-slab RBMs. ICML.
[9]
Linton C Freeman, Stephen P Borgatti, and Douglas R White. 1991. Centrality in valued graphs: A measure of betweenness based on network flow. Social networks, Vol. 13, 2 (1991), 141--154.
[10]
Yoav Freund, Raj Iyer, Robert E Schapire, and Yoram Singer. 2003. An efficient boosting algorithm for combining preferences. Journal of machine learning research, Vol. 4, Nov (2003), 933--969.
[11]
Jerome H Friedman. 2001. Greedy function approximation: a gradient boosting machine. Annals of statistics (2001), 1189--1232.
[12]
Yanjie Fu, Yong Ge, Yu Zheng, Zijun Yao, Yanchi Liu, Hui Xiong, and Jing Yuan. 2014a. Sparse real estate ranking with online user reviews and offline moving behaviors. In 2014 IEEE International Conference on Data Mining. IEEE, 120--129.
[13]
Yanjie Fu, Guannan Liu, Yong Ge, Pengyang Wang, Hengshu Zhu, Chunxiao Li, and Hui Xiong. 2018. Representing urban forms: A collective learning model with heterogeneous human mobility data. IEEE transactions on knowledge and data engineering, Vol. 31, 3 (2018), 535--548.
[14]
Yanjie Fu, Guannan Liu, Spiros Papadimitriou, Hui Xiong, Yong Ge, Hengshu Zhu, and Chen Zhu. 2015. Real estate ranking via mixed land-use latent models. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 299--308.
[15]
Yanjie Fu, Hui Xiong, Yong Ge, Zijun Yao, Yu Zheng, and Zhi-Hua Zhou. 2014b. Exploiting geographic dependencies for real estate appraisal: a mutual perspective of ranking and clustering. In Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 1047--1056.
[16]
Yanjie Fu, Hui Xiong, Yong Ge, Yu Zheng, Zijun Yao, and Zhi-Hua Zhou. 2016. Modeling of geographic dependencies for real estate ranking. ACM Transactions on Knowledge Discovery from Data (TKDD), Vol. 11, 1 (2016), 11.
[17]
Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 855--864.
[18]
Xiaofei He, Deng Cai, and Partha Niyogi. 2006. Laplacian score for feature selection. In Advances in neural information processing systems. 507--514.
[19]
Geoffrey E Hinton et almbox. 2010. Modeling pixel means and covariances using factorized third-order Boltzmann machines. In 2010 IEEE computer society conference on computer vision and pattern recognition. IEEE, 2551--2558.
[20]
Geoffrey E Hinton, Simon Osindero, and Yee-Whye Teh. 2006. A fast learning algorithm for deep belief nets. Neural computation, Vol. 18, 7 (2006), 1527--1554.
[21]
Hanjiang Lai, Yan Pan, Cong Liu, Liang Lin, and Jie Wu. 2012. Sparse learning-to-rank via an efficient primal-dual algorithm. IEEE Trans. Comput., Vol. 62, 6 (2012), 1221--1233.
[22]
Hang Li. 2011. A short introduction to learning to rank. IEICE TRANSACTIONS on Information and Systems, Vol. 94, 10 (2011), 1854--1862.
[23]
Andy Liaw, Matthew Wiener, et almbox. 2002. Classification and regression by randomForest. R news, Vol. 2, 3 (2002), 18--22.
[24]
Mark EJ Newman. 2004. Analysis of weighted networks. Physical review E, Vol. 70, 5 (2004), 056131.
[25]
Bryan Perozzi, Rami Al-Rfou, and Steven Skiena. 2014. Deepwalk: Online learning of social representations. In Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 701--710.
[26]
Sahar Sohangir and Dingding Wang. 2017. Improved sqrt-cosine similarity measurement. Journal of Big Data, Vol. 4, 1 (2017), 25.
[27]
Jian Tang, Meng Qu, Mingzhe Wang, Ming Zhang, Jun Yan, and Qiaozhu Mei. 2015. Line: Large-scale information network embedding. In Proceedings of the 24th International Conference on World Wide Web. International World Wide Web Conferences Steering Committee, 1067--1077.
[28]
Fen Xia, Tie-Yan Liu, Jue Wang, Wensheng Zhang, and Hang Li. 2008. Listwise approach to learning to rank: theory and algorithm. In Proceedings of the 25th international conference on Machine learning. ACM, 1192--1199.
[29]
Jun Xu and Hang Li. 2007. Adarank: a boosting algorithm for information retrieval. In Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval. ACM, 391--398.
[30]
Zijun Yao, Yanjie Fu, Bin Liu, Wangsu Hu, and Hui Xiong. 2018. Representing Urban Functions through Zone Embedding with Human Mobility Patterns. In IJCAI. 3919--3925.
[31]
Jiawei Zhang, Congying Xia, Chenwei Zhang, Limeng Cui, Yanjie Fu, and S Yu Philip. 2017. BL-MNE: emerging heterogeneous social network embedding through broad learning with aligned autoencoder. In 2017 IEEE International Conference on Data Mining (ICDM). IEEE, 605--614.

Cited By

View all
  • (2024)Deep learning for cross-domain data fusion in urban computingInformation Fusion10.1016/j.inffus.2024.102606113:COnline publication date: 21-Nov-2024
  • (2023)Self-Supervised Representation Learning for Geographical Data—A Systematic Literature ReviewISPRS International Journal of Geo-Information10.3390/ijgi1202006412:2(64)Online publication date: 12-Feb-2023

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
CIKM '20: Proceedings of the 29th ACM International Conference on Information & Knowledge Management
October 2020
3619 pages
ISBN:9781450368599
DOI:10.1145/3340531
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 October 2020

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. autoencoder
  2. laplacian score
  3. network embedding
  4. representation learning
  5. spatiotemporal heterogeneous network
  6. weighted degree centrality measure

Qualifiers

  • Research-article

Funding Sources

  • National Science Foun-dation (NSF)

Conference

CIKM '20
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

Upcoming Conference

CIKM '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)10
  • Downloads (Last 6 weeks)0
Reflects downloads up to 15 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Deep learning for cross-domain data fusion in urban computingInformation Fusion10.1016/j.inffus.2024.102606113:COnline publication date: 21-Nov-2024
  • (2023)Self-Supervised Representation Learning for Geographical Data—A Systematic Literature ReviewISPRS International Journal of Geo-Information10.3390/ijgi1202006412:2(64)Online publication date: 12-Feb-2023

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media