NDLI: An Algebra Approach for Finding Frequent Subgraphs with Hamiltonian Cycle

Content Provider	IEEE Xplore Digital Library
Author	AnGuo Dong Lin Gao XiaoFeng Zhou HongYu Su
Copyright Year	2007
Description	Author affiliation: Xidian Univ., Xi'an (AnGuo Dong; Lin Gao; XiaoFeng Zhou; HongYu Su)
Abstract	When referred to functional motif discovery in biological network and drug target recognition in pharmaceutical chemistry, the most important step is to mine subgraphs with certain structure in a graph. Fortunately we notice that those kinds of subgraphs are frequently characterized by a Hamiltonian cycle. Hence, in this paper we develop a matrix theory based approach for mining such subgraphs. Firstly we study the properties of Hamiltonian subgraphs and determine the k-path based on the properties to find subgraph with Hamiltonian cycle. Then, an algorithm for mining subgraph with Hamiltonian cycle is designed under the frame of this approach. Finally, we analyze the complexity of the algorithm and simulate it on five real networks to verify our algorithms. The simulation results show that our algorithms have high efficiency.
Starting Page	288
Ending Page	292
File Size	296382
Page Count	5
File Format	PDF
ISBN	9780769528748
DOI	10.1109/FSKD.2007.138
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-08-24
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Computer science Drugs Algebra Pharmaceutical technology Target recognition Heuristic algorithms Biology Data mining Chemical technology
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An efficient way to find frequent pattern with dynamic programming approach

Knowledge-based algorithms for chemical structure and property analysis

New adaptations of classic algorithm for mining frequent itemsets from uncertain data

Knowledge discovery with a subset-superset approach for Mining Heterogeneous Data with dynamic support

Review of Frequent Itemsets Mining in High Dimensional Dataset

Mining frequent itemset from uncertain data

Mining dynamical frequent itemsets based on ant colony algorithm

An Efficient Algorithm for Discovering Maximum Length Frequent Itemsets

Experimental results on hamiltonian-cycle-finding algorithms (2003).

An Algebra Approach for Finding Frequent Subgraphs with Hamiltonian Cycle

Similar Documents

An efficient way to find frequent pattern with dynamic programming approach

Knowledge-based algorithms for chemical structure and property analysis

New adaptations of classic algorithm for mining frequent itemsets from uncertain data

Knowledge discovery with a subset-superset approach for Mining Heterogeneous Data with dynamic support

Review of Frequent Itemsets Mining in High Dimensional Dataset

Mining frequent itemset from uncertain data

Mining dynamical frequent itemsets based on ant colony algorithm

An Efficient Algorithm for Discovering Maximum Length Frequent Itemsets

Experimental results on hamiltonian-cycle-finding algorithms (2003).

An Algebra Approach for Finding Frequent Subgraphs with Hamiltonian Cycle