A Fast Algorithm for Computing Hypergraph Transversals and its Application in Mining Emerging Patterns

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by James Bailey Articles by Thomas Manoukian Articles by Kotagiri Ramamohanarao

Third IEEE International Conference on Data Mining (ICDM'03)

Melbourne, Florida

November 19-November 22

ISBN: 0-7695-1978-4

	ASCII Text	x
	James Bailey, Thomas Manoukian, Kotagiri Ramamohanarao, "A Fast Algorithm for Computing Hypergraph Transversals and its Application in Mining Emerging Patterns," Data Mining, IEEE International Conference on, pp. 485, Third IEEE International Conference on Data Mining (ICDM'03), 2003.

	BibTex	x
	@article{ 10.1109/ICDM.2003.1250958, author = {James Bailey and Thomas Manoukian and Kotagiri Ramamohanarao}, title = {A Fast Algorithm for Computing Hypergraph Transversals and its Application in Mining Emerging Patterns}, journal ={Data Mining, IEEE International Conference on}, volume = {0}, year = {2003}, isbn = {0-7695-1978-4}, pages = {485}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDM.2003.1250958}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Data Mining, IEEE International Conference on TI - A Fast Algorithm for Computing Hypergraph Transversals and its Application in Mining Emerging Patterns SN - 0-7695-1978-4 SP EP A1 - James Bailey, A1 - Thomas Manoukian, A1 - Kotagiri Ramamohanarao, PY - 2003 KW - null VL - 0 JA - Data Mining, IEEE International Conference on ER -

James Bailey, The University of Melbourne, Australia

Thomas Manoukian, The University of Melbourne, Australia

Kotagiri Ramamohanarao, The University of Melbourne, Australia

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDM.2003.1250958

Computing the minimal transversals of a hypergraph is an important problem in computer science that has significant applications in data mining. In this paper, we present a new algorithm for computing hypergraph transversals and highlight their close connection to an important class of patterns known as emerging patterns. We evaluate our technique on a number of large datasets and show that it out-performs previous approaches by a factor of 9-29 times.

Citation:

James Bailey, Thomas Manoukian, Kotagiri Ramamohanarao, "A Fast Algorithm for Computing Hypergraph Transversals and its Application in Mining Emerging Patterns," icdm, pp.485, Third IEEE International Conference on Data Mining (ICDM'03), 2003

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.