Titlebook: Web and Big Data; First International Lei Chen,Christian S. Jensen,Xiang Lian Conference proceedings 2017 Springer International Publishin

知識(shí)分子

Element-Oriented Method of Assessing Landscape of Sightseeing Spots by Using Social Images In this paper, we propose an element-oriented method of landscape assessment that analyzes images available on image-sharing web sites. The experimental results demonstrate that our method is superior to the existing ones based on low-level visual features and user behavior analysis.

sundowning

Element-Oriented Method of Assessing Landscape of Sightseeing Spots by Using Social Images In this paper, we propose an element-oriented method of landscape assessment that analyzes images available on image-sharing web sites. The experimental results demonstrate that our method is superior to the existing ones based on low-level visual features and user behavior analysis.

GRILL

傾聽(tīng)

Sifting Truths from Multiple Low-Quality Data Sourcesvalues from them. It is a critical part of an effective data integration solution. In order to solve this problem, we first propose a model to specify the tuple quality. Then we present a framework to infer the tuple quality based on the concept of .. In particular, we propose an algorithm underlyin

miracle

G-spot

小步走路

Time-Constrained Graph Pattern Matching in a Large Temporal Graphh is contrary to the fact that graphs in real life are intrinsically dynamic. Therefore, in this paper, we propose a new problem of Time-Constrained Graph Pattern Matching (TCGPM) in a large temporal graph. Different from traditional work, our work deals with temporal graphs rather than a series of

aggravate

Time-Constrained Graph Pattern Matching in a Large Temporal Graphh is contrary to the fact that graphs in real life are intrinsically dynamic. Therefore, in this paper, we propose a new problem of Time-Constrained Graph Pattern Matching (TCGPM) in a large temporal graph. Different from traditional work, our work deals with temporal graphs rather than a series of

Herbivorous

說(shuō)笑

Efficient Compression on Real World Directed Graphstion of graph computation very challenging. Reducing graph size to fit in memory, for example by using the technique of lossless compression, is crucial in cutting the cost of large scale graph computation. Unfortunately, literature work on graph compression still suffers from issues including low c