Web Technologies and Applications 18th Asia-Pacific Web Conference, APWeb 2016, Suzhou, China, September 23-25, 2016. Proceedings, Part I

Saved in:
Bibliographic Details
Main Authors Li, Feifei, Shim, Kyuseok, Zheng, Kai, Liu, Guanfeng
Format eBook
LanguageEnglish
Published Cham Springer International Publishing AG 2016
Edition1
Subjects
Data mining-Congresses
Online AccessGet full text
ISBN3319458132
9783319458137

Cover

Table of Contents:
  • Intro -- Message from the General Chairs and Program Committee Chairs -- Organization -- Contents -- Part I -- Contents -- Part II -- Research Full Paper: Spatio-temporal, Textual and Multimedia Data Management -- Probabilistic Nearest Neighbor Query in Traffic-Aware Spatial Networks -- 1 Introduction -- 2 Preliminaries -- 2.1 Spatial Networks -- 2.2 Traffic-Aware Spatial Networks -- 3 Probabilistic TANN Query Processing -- 3.1 Time-Threshold TANN Query -- 3.2 Probability-Threshold TANN Query -- 4 Experimental Results -- 4.1 Effect of Time-Threshold .t -- 4.2 Effect of Congestion Probability Threshold .p -- 4.3 Effect of Spatial-Object Density -- 5 Related Work -- 6 Conclusions and Future Directions -- References -- NERank: Bringing Order to Named Entities from Texts -- 1 Introduction -- 2 Related Work -- 3 Entity Ranking Problem -- 4 Topical Tripartite Graph Modeling -- 5 Entity Ranking Algorithm -- 5.1 Prior Topic Rank Estimation -- 5.2 Meta-Path Constrained Random Walk Algorithm -- 6 Experiments -- 6.1 Datasets and Experimental Settings -- 6.2 Experimental Results and Analysis -- 7 Conclusion and Future Work -- References -- FTS: A Practical Model for Feature-Based Trajectory Synthesis -- 1 Introduction -- 2 Related Work -- 3 Problem Statement -- 3.1 Preliminary -- 3.2 Problem Definition -- 4 Gathering Features -- 5 Baseline Methods -- 5.1 Baseline 1: Random Generation -- 5.2 Baseline 2: Sub-trajectory Synthesis -- 6 Optimization -- 7 Experiment Result -- 7.1 Dataset -- 7.2 Performance Evaluation -- 8 Conclusions -- References -- Distributed Text Representation with Weighting Scheme Guidance for Sentiment Analysis -- 1 Introduction -- 2 Related Work -- 3 Weighted Paragraph Vector (WPV) -- 3.1 Weighted PV-DBOW -- 3.2 Weighted PV-DM -- 4 Weighting Schemes -- 4.1 IDF Weighting -- 4.2 Weighting with Class Preference -- 4.3 Credibility
  • 5.3 Evaluation of DGCNN -- 5.4 Comparison of Results -- 6 Conclusion -- References -- Efficient Evaluation of Shortest Travel-Time Path Queries in Road Networks by Optimizing Waypoints in Route Requests Through Spatial Mashups -- 1 Introduction -- 2 Related Work -- 3 System Model -- 4 Direction Sharing Optimization -- 5 Route Waypoint Optimization -- 5.1 Problem Modeling -- 5.2 Waypoint Selection -- 5.3 Algorithm -- 6 Performance Evaluation -- 6.1 Evaluation Model -- 6.2 Experimental Results -- 7 Conclusion -- References -- Discovering Companion Vehicles from Live Streaming Traffic Data -- Abstract -- 1 Introduction -- 2 Problem Analysis -- 3 Discovery of Traveling Companions -- 4 Experiment -- 5 Related Work -- 6 Conclusion -- Acknowledgment -- References -- Time-Constrained Sequenced Route Query in Indoor Spaces -- Abstract -- 1 Introduction -- 2 Related Work -- 3 Problem Statement -- 3.1 Indoor Space -- 3.2 Time-Constrained Sequenced Route(TCSR) Query -- 4 Evaluating TCSR Queries -- 4.1 Determining the Best Floor Sequence -- 4.2 Finding the Shortest Route within One Floor -- 4.3 Time Complexity -- 5 Performance Evaluation -- 6 Conclusions -- Acknowledgements -- References -- Near-Duplicate Web Video Retrieval and Localization Using Improved Edit Distance -- 1 Introduction -- 2 Related Work -- 3 The Proposed Method -- 3.1 Frame-Level Similarity Measurement -- 3.2 Sequence Matching -- 3.3 Results Ranking and Near-Duplicate Segments Localizing -- 4 Experiments and Results -- 4.1 Datasets and Evaluation Metrics -- 4.2 Experiment Settings -- 4.3 Results on NDVR -- 4.4 Results on NDVL -- 5 Conclusion -- References -- Efficient Group Top-k Spatial Keyword Query Processing -- 1 Introduction -- 2 Preliminaries -- 3 GLkT Query Algorithm -- 3.1 Baseline Algorithm -- 3.2 Threshold Algorithm -- 3.3 Unit-Based Alogorithm -- 4 Experiments -- 5 Related Work
  • 6 Conclusion -- References -- Research Full Paper: Social Media Data Analysis -- Learn to Recommend Local Event Using Heterogeneous Social Networks -- 1 Introduction -- 2 Related Works -- 2.1 Social Recommendation -- 2.2 Event Recommendation -- 3 Preliminaries -- 4 Proposed HSPF Model -- 5 Inference Algorithm -- 5.1 Auxiliary Variables -- 5.2 Mean-Field Variational Family -- 5.3 Coordinate Ascent Algorithm -- 5.4 Event Recommendation Using HSPF -- 6 Experiments -- 6.1 Dataset -- 6.2 Setup and Metrics -- 6.3 Comparison Methods -- 6.4 Performance Comparison -- 7 Conclusion -- References -- Top-k Temporal Keyword Query over Social Media Data -- 1 Introduction -- 2 Related Work -- 3 Problem Definition -- 4 Index Structure -- 4.1 Two-Tiers Structure -- 4.2 Managing Segmented Items -- 5 Query Processing -- 5.1 Querying the Index -- 5.2 Traversing in the Two-Tiers Posting List -- 5.3 The Piecewise Maximum Approximation Sketch -- 6 Experimental Results -- 6.1 Read-Life Weibo DataSet and Query Workload -- 6.2 Performance Under Different Query Setups -- 7 Conclusion and Discussion -- References -- When a Friend Online is More Than a Friend in Life: Intimate Relationship Prediction in Microblogs -- 1 Introduction -- 2 Related Work -- 2.1 Strong Tie -- 2.2 Intimate Relationships -- 3 Model -- 3.1 Profile-Based Model -- 3.2 Mention-Based Model -- 3.3 Integrated Model -- 4 Dataset -- 4.1 Weibo Mention Message -- 4.2 User Profile -- 5 Experiment -- 5.1 Experiment Setup -- 5.2 Experiment Result -- 5.3 Result Analysis -- 6 Conclusion -- References -- Community Inference with Bayesian Non-negative Matrix Factorization -- 1 Introduction -- 2 Related Works -- 3 Community Inference with Bayesian Symmetric NMF -- 3.1 Bayesian Symmetric NMF Model -- 3.2 Model Selection of BSNMF -- 3.3 Iteration Rules of BSNMF -- 3.4 Inference for Community Number KC
  • 5 Experiments -- 5.1 Experimental Setup -- 5.2 Effectiveness of Weighting Schemes -- 5.3 Comparison of State-of-the-art Models -- 6 Conclusion -- References -- A Real Time Wireless Interactive Multimedia System -- 1 Introduction -- 2 Preliminary -- 3 System Conceptual Overview -- 4 System Design -- 4.1 Primitive Signal Processing -- 4.2 Gesture Recognition -- 4.3 Gesture Mapping -- 5 Evaluation -- 5.1 Experimental Setup -- 5.2 Performance Evaluation -- 6 Related Work -- 7 Conclusion -- References -- Mining Co-locations from Continuously Distributed Uncertain Spatial Data -- 1 Introduction -- 2 Problem Definitions -- 2.1 Co-location Patterns in Deterministic Data -- 2.2 Co-location Patterns in Gaussian-Based Data -- 3 Probabilistic Participation Ratio Computation -- 4 Probabilistic Co-location Mining Framework -- 5 Finding Probabilistic Neighbors -- 5.1 Minimum Bounding Sphere -- 5.2 The Filtering -- 6 Performance Study -- 6.1 Experiment Setup -- 6.2 Comparisons with Other Methods -- 6.3 Effectiveness of Filtering -- 7 Conclusion -- References -- An Online Approach for Direction-Based Trajectory Compression with Error Bound Guarantee -- 1 Introduction -- 2 Related Work -- 2.1 Error Measurements for Trajectory Compression -- 2.2 Existing Trajectory Compression Methods -- 3 Preliminaries -- 4 Baseline Solutions -- 4.1 Direction-Based Buffered Douglas-Peucker -- 4.2 Direction-Based Buffered Greedy Deviation -- 5 Approximate Solution with Error Bound Guarantee -- 5.1 Definitions -- 5.2 Theoretical Property -- 5.3 Angular-Deviation Algorithm -- 6 Experiments -- 7 Conclusion and Future Work -- References -- A Data Grouping CNN Algorithm for Short-Term Traffic Flow Forecasting -- 1 Introduction -- 2 Related Work -- 3 Preliminaries -- 4 DGCNN Modeling -- 4.1 Grouping -- 4.2 Feature Matrix -- 4.3 Training -- 5 Experiment -- 5.1 Data -- 5.2 Evaluation Matrics
  • The Competition of User Attentions Among Social Network Services: A Social Evolutionary Game Approach
  • 3.5 Performance Comparisons in Email Network -- 4 Conclusions -- References -- Maximizing the Influence Ranking Under Limited Cost in Social Network -- 1 Introduction -- 2 Related Work -- 3 Model and Problem -- 3.1 CIC Model -- 3.2 Maximizing Influence Ranking Under Limited Cost Problem -- 4 Intelligent Greedy Algorithm -- 5 Cost-Effective Multi-step Influence Adjust Algorithm -- 6 Experiments -- 6.1 Experimental Setup -- 6.2 Experimental Results -- 7 Conclusion and Future Work -- References -- Towards Efficient Influence Maximization for Evolving Social Networks -- 1 Introduction -- 2 Preliminaries and Problem Statement -- 3 Observations of Social Network Evolution -- 3.1 Preferential Attachment Rule -- 3.2 Relation Between Influence and Degree -- 4 IncInf Design -- 4.1 Basic Operations of Topology Evolution -- 4.2 Influence Spread Changes -- 4.3 Potential Top-K Influential Users Identification -- 5 Experiments -- 5.1 Experimental Setup -- 5.2 Efficiency Study -- 5.3 Effectiveness Study -- 6 Related Work -- 7 Conclusion -- References -- Detecting Community Pacemakers of Burst Topic in Twitter -- 1 Introduction -- 2 Related Work -- 3 Framework of DCPBT -- 4 Methods -- 4.1 Burst Topic User Graph Model -- 4.2 Community Pacemakers Detection Algorithm -- 5 Experiments -- 5.1 Dataset -- 5.2 Influenced Followers Ratio -- 5.3 Promoting Early Diffusion in the Early Stages -- 6 Conclusions -- References -- Dynamic User Attribute Discovery on Social Media -- 1 Introduction -- 2 Related Work -- 3 The Proposed Approach -- 3.1 Biterm Topic Model -- 3.2 Inference Parameters -- 3.3 Dynamic User Attribute Model -- 4 Experiments -- 4.1 Experimental Dataset -- 4.2 Implementation Details -- 4.3 Evaluation Metric -- 4.4 Experimental Results -- 5 Conclusions and Future Work -- References