Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleAugust 2023
Next POIs Prediction for Group Recommendations: Influence-Based Deep Learning Model
AbstractA significant amount of data are significantly available due to the dramatic proliferation of location-based social networks. This has led to the development of location-based recommendation tools that assist users in discovering attractive Points-...
- ArticleApril 2022
Influence-Based Deep Network for Next POIs Prediction
AbstractThe dramatic proliferation of location-based social networks have resulted in a significant amount of data. This has led to the development of location-based recommendation tools that assist users in discovering attractive Points-of-Interest (POIs)...
- research-articleDecember 2020
TopoX: Topology Refactorization for Minimizing Network Communication in Graph Computations
IEEE/ACM Transactions on Networking (TON), Volume 28, Issue 6Pages 2768–2782https://doi.org/10.1109/TNET.2020.3020813Efficient graph partitioning is vital for high-performance graph-parallel systems. Traditional graph partitioning methods attempt to both minimize communication cost and guarantee load balancing in computation. However, the skewed degree distribution of ...
- ArticleJuly 2014
WhereToGo: Personalized Travel Recommendation for Individuals and Groups
MDM '14: Proceedings of the 2014 IEEE 15th International Conference on Mobile Data Management - Volume 01Pages 49–58https://doi.org/10.1109/MDM.2014.12With the rapid development of GPS-enabled mobile devices, huge amounts of user-contributed data with location information can be collected from the Internet. With this kind of data, one promising application is travel recommendation, which has attracted ...
- bookOctober 2013
Data Dissemination in Wireless Computing Environments
In our increasingly mobile world the ability to access information on demand at any time and place can satisfy people's information needs as well as confer on them a competitive advantage. The emergence of battery-operated, low-cost and portable ...
- research-articleMay 2012
Towards ad-hoc circles in social networking sites
DBSocial '12: Proceedings of the 2nd ACM SIGMOD Workshop on Databases and Social NetworksPages 19–24https://doi.org/10.1145/2304536.2304540Social Networking Sites (SNSs) allow users to publish posts to certain user-defined circles (sets of users). However, existing SNS models are limited in several ways. First, it is not practical to predefine all circles a user will ever need for ...
- bookMarch 2012
Query Answer Authentication
In data publishing, the owner delegates the role of satisfying user queries to a third-party publisher. As the servers of the publisher may be untrusted or susceptible to attacks, we cannot assume that they would always process queries correctly, hence ...
- ArticleSeptember 2011
S3: An Efficient Shared Scan Scheduler on MapReduce Framework
ICPP '11: Proceedings of the 2011 International Conference on Parallel ProcessingPages 325–334https://doi.org/10.1109/ICPP.2011.42Hadoop, an open-source implementation of Map-Reduce, has been widely used for data-intensive computing. In order to improve performance, multiple jobs operating on a common data file can be processed as a batch to eliminate redundant scanning. However, ...
- ArticleSeptember 2008
CYBER: A CommunitY-Based sEaRch engine
P2P '08: Proceedings of the 2008 Eighth International Conference on Peer-to-Peer ComputingPages 215–224https://doi.org/10.1109/P2P.2008.24In this paper, we propose CYBER, a CommunitY Based sEaRch engine, for information retrieval utilizing community feedback information in a DHT network. In CYBER, each user is associated with a set of user profiles that capture his/her interests. Likewise,...
- research-articleSeptember 2007
Compressed Hierarchical Mining of Frequent Closed Patterns from Dense Data Sets
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 19, Issue 9Pages 1175–1187https://doi.org/10.1109/TKDE.2007.1047This paper addresses the problem of finding frequent closed patterns (FCPs) from very dense datasets. We introduce two compressed hierarchical FCP mining algorithms C-Miner and B-Miner. The two algorithms compress the original mining space, ...
- research-articleJuly 2003
Data management in Peer-to-Peer environment: A perspective of BestPeer
Journal of Computer Science and Technology (JCST), Volume 18, Issue 4Pages 452–461https://doi.org/10.1007/BF02948919AbstractPeer-to-Peer (P2P) systems have attracted much attention in academic community and industry circles due to their promising applications in various domains. This paper presents the authors' research efforts on introducing complex query capabilities ...