LPaMI: A Graph-Based Lifestyle Pattern Mining Application Using Personal Image Collections in Smartphones

Khan, Kifayat Ullah; Alam, Aftab; Dolgorsuren, Batjargal; Uddin,; Umair, Muhammad; Sang, Uijeong; Duong, Thuy-Van T.; Xu, Weihua; Lee, Young-Koo

doi:10.3390/app7121200

Cited by 2 publications

(1 citation statement)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Graphs have been used to model many complex data objects and their relationships in our real world, such as bioinformatics, chemistry, social networks, software, the World Wide Web, and so on [1][2][3][4][5][6]. With the increasing of graph data, graphs have been of extensive concern and deeply studied.…”

Section: Introductionmentioning

confidence: 99%

On Minimal Unique Induced Subgraph Queries

Jiang

Zhao

et al. 2018

Applied Sciences

View full text Add to dashboard Cite

In this paper, a novel type of interesting subgraph query is proposed: Minimal Unique Induced Subgraph (MUIS) query. Given a (large) graph G and a query vertex (position) q in the graph, can we find an induced subgraph containing q with the minimal number of vertices that is unique in G? MUIS query has many potential applications, such as subgraph retrieval, graph visualization, representative subgraph discovery and vertex property exploration. The formal definition of MUIS is given and the properties are discussed in this paper. The baseline and EQA (Efficient Query Answering) algorithms are proposed to solve the MUIS query problem under the filtering-validation framework. In the EQA algorithm, the Breadth First Search (BFS)-based candidate set generation strategy is proposed to ensure the minimality property of MUIS; the matched vertices-based pruning strategy is proposed to prune useless candidate sets and the unnecessary subgraph isomorphism; and the query position-based subgraph isomorphism is proposed to check efficiently the uniqueness of the subgraphs. Experiments are carried on real datasets and synthetic datasets to verify the effectiveness and efficiency of the proposed algorithm under novel measurements. The influencing factors of the process speed are discussed at last in the paper.

show abstract

Section: Introductionmentioning

confidence: 99%

On Minimal Unique Induced Subgraph Queries

Jiang

Zhao

et al. 2018

Applied Sciences

View full text Add to dashboard Cite

show abstract

Recognition and Optimization Algorithms for P5-Free Graphs

et al. 2020

View full text Add to dashboard Cite

The weighted independent set problem on P 5 -free graphs has numerous applications, including data mining and dispatching in railways. The recognition of P 5 -free graphs is executed in polynomial time. Many problems, such as chromatic number and dominating set, are NP-hard in the class of P 5 -free graphs. The size of a minimum independent feedback vertex set that belongs to a P 5 -free graph with n vertices can be computed in O ( n 16 ) time. The unweighted problems, clique and clique cover, are NP-complete and the independent set is polynomial. In this work, the P 5 -free graphs using the weak decomposition are characterized, as is the dominating clique, and they are given an O ( n ( n + m ) ) recognition algorithm. Additionally, we calculate directly the clique number and the chromatic number; determine in O ( n ) time, the size of a minimum independent feedback vertex set; and determine in O ( n + m ) time the number of stability, the dominating number and the minimum clique cover.

show abstract

LPaMI: A Graph-Based Lifestyle Pattern Mining Application Using Personal Image Collections in Smartphones

Cited by 2 publications

References 46 publications

On Minimal Unique Induced Subgraph Queries

On Minimal Unique Induced Subgraph Queries

Recognition and Optimization Algorithms for P5-Free Graphs

Contact Info

Product

Resources

About