Web Information Systems Engineering - WISE 2017

Name: Web Information Systems Engineering - WISE 2017 | 18th International Conference, Puschino, Russia, October 7-11, 2017, Proceedings, Part I
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

18th International Conference, Puschino, Russia, October 7-11, 2017, Proceedings, Part I

Athman Bouguettaya Yunjun Gao Andrey Klimenko Lu Chen Xiangliang Zhang Fedor Dzerzhinskiy Weijia Jia Stanislav V. Klimenko Qing Li(Editor)

Springer (Publisher)

Published on 1. October 2017

XXI, 544 pages

E-Book

PDF with digital watermarking

System requirements

978-3-319-68783-4 (ISBN)

€53.49incl. 7% vat

System requirements

for PDF with digital watermarking

E-Book Single Licence

Available for download

Description

More details

Other editions

Content

Intro
Preface
Organization
Contents -- Part I
Contents -- Part II
Microblog Data Analysis
A Refined Method for Detecting Interpretable and Real-Time Bursty Topic in Microblog Stream
Abstract
1 Introduction
2 Related Work
3 Solution Overview
3.1 Problem Formulation
3.2 Solution Overview
4 Refined Sketch-Based Topic Model and Evaluation
4.1 Real-Time Detection
4.2 Topic Evaluation - Sketch-Based PMI
5 Experiments and Evaluation
5.1 Experiments Setting
5.2 Sketch-Based PMI Evaluation
5.3 Results Analysis
6 Conclusion
Acknowledgments
References
Connecting Targets to Tweets: Semantic Attention-Based Model for Target-Specific Stance Detection
1 Introduction
2 Neural Network Models for Target-Specific Stance Detection in Tweets
2.1 biGRU Model
2.2 biGRU-CNN Model
2.3 AT-biGRU Model
2.4 AS-biGRU-CNN Model
2.5 Target Embedding
2.6 Model Training
3 Experimental Results
3.1 Dataset Description
3.2 Comparison Models
3.3 Experimental Settings and Model Configuration
3.4 Using the biGRU Target Embedding
3.5 Using the Averaging Target Embedding
3.6 Using Combined Classifiers
4 Related Work
5 Conclusion
References
A Network Based Stratification Approach for Summarizing Relevant Comment Tweets of News Articles
1 Introduction
2 Related Works
3 Problem Definition and Preliminaries
3.1 Problem Definition
3.2 Outline of the Proposed Approach
3.3 Dataset
3.4 Preprocessing
4 Proposed Approach
4.1 Tweet Network Formation and Community Identification
4.2 Extracting Final Summary of Relevant and Diverse Tweets
5 Results and Discussion
5.1 Performance Metrics
5.2 Results
6 Conclusion
References
Interpreting Reputation Through Frequent Named Entities in Twitter
1 Introduction
2 Related Work
3 Approach
3.1 Weighted Sampling
3.2 Reputation of Frequent Named Entities
4 Experiments
4.1 The Datasets
4.2 The Richness of Weighted Sample
4.3 Frequent Named Entity Mining in Weighted Sample
4.4 Comparing the Ranking of the FNEs
4.5 Reputation Through Frequent Named Entities
5 Conclusions
References
Social Network Data Analysis
Discovering and Tracking Active Online Social Groups
1 Introduction
2 Related Work
3 Preliminary and Problem Definition
4 Fading Time Window for Evolving Social Groups
5 Baseline Solutions
6 Index-Based Method
6.1 Index Overview
6.2 Incremental Group Evolution
7 Experiments
7.1 Efficiency
7.2 Group Evolution
8 Conclusion
References
Dynamic Relationship Building: Exploitation Versus Exploration on a Social Network
1 Introduction
2 The Dynamic Network Building Problem
3 Exploratory and Exploitative Strategies
4 Contrasting Exploitative and Exploratory Strategies
4.1 Network Evolution Mechanisms
4.2 Real-World Evolving Networks
5 Balancing Exploitation with Exploration with UBC
6 Conclusion and Future Work
References
Social Personalized Ranking Embedding for Next POI Recommendation
1 Introduction
2 Related Work
3 Problem Definition and Notations
4 Preliminary Models
4.1 Metric Embedding Technology
4.2 Personalized Embedding Model
5 Social Personalized Ranking Embedding (SPRE)
5.1 Social Embedding Model
5.2 Social Personalized Ranking Embedding (SPRE) Model
5.3 Optimization Learn
6 Experiments
6.1 Experimental Settings
6.2 Experimental Results
6.3 Impact of Different Parameters
7 Conclusion
References
Assessment of Prediction Techniques: The Impact of Human Uncertainty
1 Introduction
2 Related Work
3 Modelling Human Uncertainty
4 User Study and Simulations
5 Discussion
6 Conclusion and Future Work
References
Data Mining
Incremental Structural Clustering for Dynamic Networks
1 Introduction
2 Preliminaries
3 Incremental Structure Clustering Algorithm
3.1 The ISCAN Algorithm
4 Performance Studies
5 Related Work
6 Conclusion
References
Extractive Summarization via Overlap-Based Optimized Picking
1 Introduction
2 Related Work
2.1 Citation-Based Summarization
2.2 Optimization-Based Approaches
3 Problem Formulation
4 Proposed Method
4.1 Overlap Discovery
4.2 Representativeness Metric
4.3 Overlap-Based Greedy Pick
5 Experiment
5.1 DataSets
5.2 Evaluation Method
5.3 Baseline Approaches
6 Results and Discussion
6.1 Overall Performance
6.2 Effectiveness of
7 Conclusion and Future Work
References
Spatial Information Recognition in Web Documents Using a Semi-supervised Machine Learning Method
Abstract
1 Introduction
2 The Proposed Method of Spatial Information Recognition
3 Empirical Analysis
3.1 Supervised Models Performance
3.2 Semi-supervised Models Performance
3.3 Benchmarking with Similar Methods
3.4 Ranking Result: Overall Performance of the Proposed System
4 Conclusion, Limitation and Future Work
References
When Will a Repost Cascade Settle Down?
1 Introduction
2 Related Work
3 Problem Definition
4 Modeling and Predicting
4.1 Modeling
4.2 Prediction
5 Experiment
5.1 Performance Analysis
5.2 Discussion
6 Conclusion
References
Pattern Mining
Mining Co-location Patterns with Dominant Features
Abstract
1 Introduction
2 Related Works
3 Preliminary and Problem Formulation
3.1 Basic Concept
3.2 Definitions
3.3 Problem Formulation
4 Algorithm
5 Experimental Study
5.1 Experiment on Synthetic Data
5.1.1 Synthetic Data Generation
5.1.2 Efficiency
5.1.3 The Mining Results of AMDFCP vs Join-Less
5.2 Experiments on Real Data
5.3 The Real Application of Significant Co-location Mining
6 Conclusions
Acknowledgments
References
Maximal Sub-prevalent Co-location Patterns and Efficient Mining Algorithms
Abstract
1 Introduction
2 Basic Concepts and Properties
3 A Prefix-Tree Based Algorithm
4 A Partition-Based Algorithm
4.1 PB Method
4.2 Comparison with the Prefix-Tree-Based Method
5 Experiments
5.1 Comparison of Computational Complexity Factors
5.2 Comparison on Expected Costs in Identifying Candidates
5.3 Scalability Tests
5.4 Evaluation with Real Data Sets
6 Conclusions
Acknowledgments
References
Overlapping Communities Meet Roles and Respective Behavioral Patterns in Networks with Node Attributes
1 Introduction
2 Preliminaries
2.1 Networks, Communities, Attributes, Roles
2.2 Latent Affiliations
2.3 Behavioral Role Patterns
2.4 Problem Statement
3 The CARBONARA Model
4 Posterior Inference
5 Tasks
5.1 Exploratory Network Analysis
5.2 Predictive Analysis
5.3 Descriptive Analysis
6 Experimental Evaluation
7 Conclusions
References
Efficient Approximate Entity Matching Using Jaro-Winkler Distance
1 Introduction
2 Related Work
3 Problem Definition
4 Lower Bound of Jaro-Winkler Distance
5 Index Construction for Jaro-Winkler Distance
6 Online Query Processing
6.1 Query Processing of Jaro Distance
6.2 Query Processing of Jaro-Winkler Distance
7 Experiments
7.1 Experimental Setup
7.2 Query Performance
7.3 Candidate Number
8 Conclusion
References
Cloud Computing
Long-Term Multi-objective Task Scheduling with Diff-Serv in Hybrid Clouds
1 Introduction
2 Problem Formulation
2.1 System Model
2.2 An SDP Problem
3 An ADP Algorithm
3.1 Stepping Forward Through Time
3.2 Introducing Concept of Post-Decision State Variable (PDSV)
3.3 Using Value Function Approximation
3.4 Making Decisions Approximately
3.5 Updating t by Stochastic Gradient
4 QoS Evaluation
4.1 Simulations on Stochastic Workloads
4.2 Comparative Experiments and Analysis
4.3 Experiments Based on Google Trace-Logs
5 Conclusion
References
Online Cost-Aware Service Requests Scheduling in Hybrid Clouds for Cloud Bursting
1 Introduction
2 System Model
2.1 Problem Definition
2.2 Problem Modeling
3 Online Cost-Aware Service Requests Scheduling Strategy
3.1 Problem Transformation by Lyapunov Optimization
3.2 The Analysis of the Relationship Between Cost of Renting and Rejected Requests Number
3.3 Optimal Decay Algorithm for the Zero-One Integer Linear Programming
4 Performance Evaluation
4.1 Simulation Setup
4.2 Performance Evaluation
5 Related Work
6 Conclusion
References
Adaptive Deployment of Service-Based Processes into Cloud Federations
1 Introduction
2 Motivating Example
3 Preliminaries and Background
3.1 Cloud Federation
3.2 Service-Based Process
3.3 Adaptive Deployment of SP
4 Proposed Approach
4.1 Overview of the Approach
4.2 E-PMFM Partitioning Algorithm
5 Experiments and Results
5.1 Experiment 1: E-PMFM Vs PMFM
5.2 Experiment 2: E-PMFM Vs Naive Approach
6 Related Work
7 Conclusion
References
Towards a Public Cloud Services Registry
1 Introduction
2 Related Work
3 Results and Analysis
4 Conclusion and Future Work
References
Query Processing
Location-Based Top-k Term Querying over Sliding Window
1 Introduction
2 Preliminaries and Related Work
2.1 Problem Definition
2.2 Related Work on Top-k Spatial-Keyword Query
2.3 Frequent Item Counting
2.4 Related Systems
3 Proposed Solution
3.1 Data Indexing Model
3.2 Query Processing
4 Experiments and Analysis
4.1 Baselines
4.2 Index Updating of Quad-Tree
4.3 Varying Message Capacity in Quad-Tree Leaf Node
4.4 Varying Targeted k
4.5 Accuracy Versus Baseline
4.6 Varying Parameter
5 Conclusion
References
A Kernel-Based Approach to Developing Adaptable and Reusable Sensor Retrieval Systems for the Web of Things
1 Introduction
2 Related Works
3 Background
3.1 Discovery
3.2 Search
4 Architecture of a Web Sensor Retrieval System
4.1 Reusable Processing Chain
4.2 Adaptability of the Modular Architecture
5 Kernel-Based Approach to Developing WSR
5.1 Abstract Modules
5.2 Bootstrapping Process
6 Evaluation
6.1 Reference WSR Instance
6.2 Discussion
7 Conclusion and Future Works
References
Reliable Retrieval of Top-k Tags
1 Introduction
2 Related Works
3 Top-k SAS and Evaluation
3.1 Design of Top-k SAS
3.2 Threshold-Based Evaluation on Top-k SAS
3.3 Experiments
4 Learning-Based Stability Evaluation
4.1 Dataset Preparation and Representation
4.2 Simple Feature Extraction and Selection
4.3 Learning and Evaluation
4.4 Results
4.5 Summary
5 Conclusion
References
Estimating Support Scores of Autism Communities in Large-Scale Web Information Systems
1 Introduction
2 Method
2.1 Data
2.2 Support Scores
2.3 Difference Between Aspergers and Entire Reddit
2.4 Computing Environment
3 Experimental Results
3.1 Support Scores
3.2 Performance of Cluster Computing
4 Conclusion
References
Spatial and Temporal Data
DTRP: A Flexible Deep Framework for Travel Route Planning
1 Introduction
2 Related Work
3 Problem Definition
3.1 Key Terminologies
3.2 Problem Definition
4 DTRP: Deep Traveling Route Planning Framework
4.1 Framework
4.2 Model Learning Stage
4.3 Route Generation Stage
5 Experiments
5.1 Experiment Setup
5.2 Next-Point Recommendation
5.3 General Planning
5.4 Must-Visiting Planning
6 Conclusion
References
Taxi Route Recommendation Based on Urban Traffic Coulomb's Law
1 Introduction
2 Related Work
2.1 Macroscopic Recommender Systems
2.2 Microscopic Recommender Systems
3 Preliminary
3.1 Problem Statement
3.2 Coulomb's Law
3.3 Urban Traffic Coulomb's Law
4 Routes Recommendation Using UTCL
4.1 Spatio-Temporal Processing and Metadata Collection
4.2 Traffic Charge Storage
4.3 Combination of Traffic Forces
4.4 Route Recommendation
4.5 Complexity Analysis
5 Experimental Analysis
5.1 Environment Setup and Simulation
5.2 Evaluation
5.3 Impact Factor Analysis
6 Conclusion and Future Works
References
Efficient Order-Sensitive Activity Trajectory Search
1 Introduction
2 Related Work
3 Problem Statement
4 Algorithms for the SumOATS-Problem
4.1 The Dynamic Programming (DP) Algorithm
4.2 The Optimized DP Algorithm
5 Algorithms for the MaxOATS-Problem
5.1 The Exact DP Algorithm
5.2 The Approximation Algorithm
5.3 The New Exact Algorithm
6 Experiments
6.1 Efficiency Evaluation
6.2 Scalability Testing
6.3 Parameter Sensitive Evaluation
6.4 Case Study
7 Conclusion
References
Time Series Classification by Modeling the Principal Shapes
1 Introduction
2 Background and Related Work
2.1 Time Series Classification
2.2 Global-Based Methods
2.3 Local-Based Methods
3 Principal Shape Model
3.1 Principal Shapes Extraction from Time Series
3.2 An Example of Principal Shapes on Toy Dataset
3.3 Classifying New Time Series
3.4 Effectiveness and Efficiency
4 Experiments and Results
4.1 Datasets and Baselines
4.2 Accuracy and Running Time on Common Datasets
4.3 Accuracy and Running Time on Large Datasets
4.4 Scalability
5 Conclusion and Future Work
References
Effective Caching of Shortest Travel-Time Paths for Web Mapping Mashup Systems
1 Introduction
2 Related Work
3 Preliminaries
4 System Overview
5 Cache Management
5.1 Cache Structure
5.2 Path Weight
5.3 Cache Operations
6 Experimental Evaluation
6.1 Experimental Setting
6.2 Experimental Results
7 Conclusion
References
Graph Theory
Discovering Hierarchical Subgraphs of K-Core-Truss
1 Introduction
2 Problem Statement
3 K-Core-Truss Algorithms
3.1 K-Core-Truss Decomposition Algorithms
3.2 Querying k-core-truss
4 Performance Studies
4.1 Datasets
4.2 Performance Evaluation of k-core, k-truss and k-core-truss Decompositions
4.3 Efficiency Evaluation of Querying Processing for Finding k-core, k-truss and k-core-truss
4.4 Case Study on DBLP Network
5 Related Work
6 Conclusions
References
Efficient Subgraph Matching on Non-volatile Memory
1 Introduction
2 Preliminaries and Related Work
3 Evaluation of Existing Algorithms on NVM
4 Detailed Analysis of Existing Algorithms
4.1 General Backtracking Framework
4.2 Optimization Techniques
5 Our Algorithm
5.1 Revised Backtracking Framework
5.2 Choices of Optimization Strategies
6 Subgraph Matching on Dynamic Graphs
7 Experiments
7.1 Efficiency and Scalability Evaluation
7.2 Evaluation of Update Algorithm
8 Conclusions
References
Influenced Nodes Discovery in Temporal Contact Network
1 Introduction
2 Related Work
3 Problem Formulation
3.1 Notations
3.2 Preliminary
3.3 Problem Statement
4 Infection Probability
4.1 Accurate Infection Probability
4.2 Infection Probability Approximation
5 HDS Algorithm
5.1 Point-to-Point Infection Probability Calculation
5.2 Candidate Set Updating
5.3 Algorithm Analysis
6 AHDS Algorithm
7 Experiments
7.1 Experiments on Synthetic Datasets
7.2 Experiments on Real-World Datasets
8 Conclusion
References
Tracking Clustering Coefficient on Dynamic Graph via Incremental Random Walk
Abstract
1 Introduction
2 Tracking Clustering Coefficient
2.1 Clustering Coefficient
2.2 Problem Definition
2.3 Tracking Clustering Coefficient Incrementally
3 Correctness and Complexity
3.1 Correctness
3.2 Computing Complexity
4 Evaluations
4.1 Experiment Setup
4.2 Accuracy
4.3 Performance
5 Conclusion
References
Event Detection
Event Cube - A Conceptual Framework for Event Modeling and Analysis
Abstract
1 Introduction
2 Related Work
2.1 Event Detection
2.2 Event Relationship Analysis
2.3 Online Analytical Processing
3 The Modelling Framework
3.1 Event Cube (EC)
3.2 EC Operations
4 Online Analytical Processing of ECs
4.1 Intra-cube Event Relation Analysis
4.2 Inter-cube Event Relation Analysis
5 Case Study
5.1 Case Study for Intra-cube Operations
5.2 Case Study for Inter-cube Operations
6 Conclusion
Acknowledgement
References
Cross-Domain and Cross-Modality Transfer Learning for Multi-domain and Multi-modality Event Detection
1 Introduction
2 Related Work
2.1 Event Detection from Internet Platforms
2.2 Transfer Learning
3 Cross-Domain and Cross-Modality Transfer Learning
3.1 Dictionary-Based Alignment
3.2 Cross-Domain and Cross-Modality Transfer Learning (CDM) Model
3.3 CDM for Event Discovery
4 Experiments
4.1 Dataset
4.2 Evaluation Metrics and Baselines
4.3 The Best Performance Achieved by the Approaches
4.4 Evaluations on the Transfer Scenarios of Cross-Domain and Cross-Modality
5 Conclusion
References
Determining Repairing Sequence of Inconsistencies in Content-Related Data
Abstract
1 Introduction
2 Related Work
3 Sequential Repairing
3.1 Content-Related Conditional Functional Dependencies (CCFDs)
3.2 Repairing Cost for Content-Related Data
3.3 Problem Statement
4 Inconsistencies Repairing
4.1 Overview
4.2 Inconsistencies Detection
5 Determining Repairing Sequence
5.1 Repairing Sequence Graph
5.2 Repairing Mutex
6 Repairing Target Value
7 Experimental Results
7.1 Experimental Setting
7.2 Experimental Performance
8 Conclusions
Acknowledgement
References
Author Index

System requirements

Save as PDF Copy link into clipboard

Schweitzer Fachinformationen

Web Information Systems Engineering - WISE 2017

Description

More details

Other editions

Additional editions

Content

System requirements