Complex Relationship Mining Algorithm and its Application

Tong He

doi:10.4028/www.scientific.net/AMR.532-533.1736

Paper Titles

Short Text Clustering Algorithm with Feature Keyword Expansion
p.1716

An Improved IPP Planning Algorithm and the Application
p.1721

An Efficient Algorithm for Computing the k-Error Linear Complexity Spectrum of Periodic Sequences
p.1726

A Novel Filtering Algorithm Based on Least Square Support Vector
p.1732

Complex Relationship Mining Algorithm and its Application
p.1736

Fast Multilevel Thresholding Method for Image Segmentation Based on Improved Particle Swarm Optimization and Maximal Variance
p.1741

A Robust Star Acquisition Algorithm Based on Facet Model
p.1747

Near-Replicas of Web Pages Eliminating Repetitive Algorithms Based on MD5
p.1752

BP Network Optimization Based on Improved Genetic Algorithm
p.1757

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 532-533Complex Relationship Mining Algorithm and its...

Complex Relationship Mining Algorithm and its Application

Abstract:

Based on rough graph theory, this paper gives a new algorithm in rough network, which generalizes the classical algorithm of exploring maximum flow. This algorithm successfully deals with a kind of complex relationship mining problem between different relationship levels. Simulation shows the effectiveness of this algorithm.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 532-533)

Pages:

1736-1740

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.532-533.1736

Citation:

Cite this paper

Online since:

June 2012

Authors:

Tong He

Keywords:

Class Maximum Flow Algorithm, Edmonds-Karp Algorithm, Relationship Mining, Rough Graph, Rough Network

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] T. He, Y. Chen, and K. Shi: Weighted Rough Graph and Its Application, Proc. of Sixth IEEE International Conference on Intelligent System Design and Applications, pp.486-491(2006).

DOI: 10.1109/isda.2006.279

Google Scholar

[2] Z. Pawlak: Rough Sets, International Journal of Computer and Information Sciences, vol. 11, pp.341-356 (1982).

Google Scholar

[3] T. He, K. Shi: Rough Graph and Its Structure, Journal of Shandong University, vol. 41(6), pp.46-50(2006).

Google Scholar

[4] T. He, P. Xue, and K. Shi: The Application of Rough Graph in Relationship Mining, Journal of Systems Engineering and Electronics, vol. 19(4), pp.742-747(2008).

Google Scholar

[5] J. A. Bondy, U. S. R. Murty: Graph Theory with Applications. (The Macmillan Press LTD, London 1976).

Google Scholar

[6] J Edmonds, R M Karp: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problem, J. ACM, vol. 19, pp.218-264(1972).

DOI: 10.1145/321694.321699

Google Scholar

[7] W. Zhang, W. Wu, and J Liang: Rough Sets Theories and Methods. (Science Press, Beijing 2003).

Google Scholar

[8] A. Gibbons: Algorithmic Graph Theory. (Cambridge University Press, Cambridge 1986).

Google Scholar