Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
Reflects downloads up to 04 Oct 2024Bibliometrics
Skip Table Of Content Section
research-article
Span-reachability querying in large temporal graphs
Abstract

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 ...

research-article
Public Access
Parallel mining of large maximal quasi-cliques
Abstract

Given a user-specified minimum degree threshold γ, a γ-quasi-clique is a subgraph where each vertex connects to at least γ fraction of the other vertices. Quasi-clique is a natural definition for dense structures, so finding large and hence ...

research-article
A survey on semantic schema discovery
Abstract

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 ...

research-article
Efficient exploratory clustering analyses in large-scale exploration processes
Abstract

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 ...

research-article
Privacy-preserving worker allocation in crowdsourcing
Abstract

Crowdsourcing has been a prevalent way to obtain answers for tasks that need human intelligence. In general, a crowdsourcing platform is responsible for allocating workers to each received task, with high-quality workers in priority. However, the ...

research-article
Interactively discovering and ranking desired tuples by data exploration
Abstract

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 “...

research-article
Optimal price profile for influential nodes in online social networks
Abstract

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 ...

research-article
Fast, exact, and parallel-friendly outlier detection algorithms with proximity graph in metric spaces
Abstract

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 ...

Subjects

Comments