Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Graph data is getting increasingly popular in, e.g., bioinformatics and text processing. A main difficulty of graph data processing lies in the intrinsic high dimensionality of graphs, namely, when a graph is represented as a binary feature vector of indicators of all possible subgraphs, the dimensionality gets too large for usual statistical methods.  propose an efficient method for learning a binomial mixture model in this feature space. Combining the  l  1  regularizer and the data structure called DFS code tree, the MAP estimate of non-zero parameters are computed efficiently by means of the EM algorithm. Our method is applied to the clustering of RNA graphs, and is compared favorably with graph kernels and the spectral graph distance.
['Koji Tsuda', 'Taku Kudo']
I am writing a research paper on a idea Clustering graphs by weighted substructure mining
[{"from": "human", "value": "I am writing a research paper on a idea Clustering graphs by weighted substructure mining"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Graph data is getting increasingly popular in, e.g., bioinformatics and text processing. A main difficulty of graph data processing lies in the intrinsic high dimensionality of graphs, namely, when a graph is represented as a binary feature vector of indicators of all possible subgraphs, the dimensionality gets too large for usual statistical methods.  propose an efficient method for learning a binomial mixture model in this feature space. Combining the  l  1  regularizer and the data structure called DFS code tree, the MAP estimate of non-zero parameters are computed efficiently by means of the EM algorithm. Our method is applied to the clustering of RNA graphs, and is compared favorably with graph kernels and the spectral graph distance."}]