Span-reachability querying in large temporal graphs
Reachability is a fundamental problem in graph analysis. In applications such as social networks and collaboration networks, edges are always associated with timestamps. Most existing works on reachability queries in temporal graphs assume that ...
A survey on semantic schema discovery
- Kenza Kellou-Menouer,
- Nikolaos Kardoulakis,
- Georgia Troullinou,
- Zoubida Kedad,
- Dimitris Plexousakis,
- Haridimos Kondylakis
More and more weakly structured, and irregular data sources are becoming available every day. The schema of these sources is useful for a number of tasks, such as query answering, exploration and summarization. However, although semantic web data ...
Efficient exploratory clustering analyses in large-scale exploration processes
Clustering is a fundamental primitive in manifold applications. In order to achieve valuable results in exploratory clustering analyses, parameters of the clustering algorithm have to be set appropriately, which is a tremendous pitfall. We observe ...
Interactively discovering and ranking desired tuples by data exploration
- Xuedi Qin,
- Chengliang Chai,
- Yuyu Luo,
- Tianyu Zhao,
- Nan Tang,
- Guoliang Li,
- Jianhua Feng,
- Xiang Yu,
- Mourad Ouzzani
Data exploration—the problem of extracting knowledge from database even if we do not know exactly what we are looking for —is important for data discovery and analysis. However, precisely specifying SQL queries is not always practical, such as “...
Optimal price profile for influential nodes in online social networks
Influential nodes with rich connections in online social networks (OSNs) are of great values to initiate marketing campaigns. However, the potential influence spread that can be generated by these influential nodes is hidden behind the structures ...
Fast, exact, and parallel-friendly outlier detection algorithms with proximity graph in metric spaces
In many fields, e.g., data mining and machine learning, distance-based outlier detection (DOD) is widely employed to remove noises and find abnormal phenomena, because DOD is unsupervised, can be employed in any metric spaces, and does not have ...