Select Subject

All (8831)

Agronomy (158)

Animal Husbandry,... (64)

Aquatic Science (16)

Astronomy (36)

Aviation (22)

Basic Medicine (184)

Biology (504)

Chemical Engineering (103)

Chemistry (635)

Civil and Archite... (105)

Clinical Medicine (236)

Computer Science ... (924)

Dynamic and Elect... (121)

Earth Science (119)

Economics (67)

Education (31)

Electrics, Commun... (927)

Energy Science an... (67)

Engineering and T... (15)

Environmental Sci... (140)

Food Science and ... (63)

Forestry (36)

Hydraulic Enginee... (40)

Mechanics (240)

Metallurgical Eng... (32)

Mine Engineering ... (38)

Nuclear Science a... (21)

Pharmacy (98)

Physics (920)

Preventive Medici... (37)

Psychology (20)

Security Science ... (17)

Sports Science (6)

Surveying and Map... (15)

Textile Science a... (16)

Traditional Chine... (56)

Transportation En... (57)

Select/Unselect all

For Selected Papers

Saved Papers

Please enter a name for this paper to be shown in your personalized Saved Papers list


	1. HPFP-Miner: A Novel Parallel Frequent Itemset Mining Algorithm
	CHEN Xiaoyun,HE Yanshan,CHEN Pengfei,MIAO Shengfa,YUE Min,SONG Weiguo
	Computer Science and Technology 08 April 2009
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract:Frequent itemset mining is a fundamental and essential issue in data mining field and can be used in many data mining tasks. Most of these mining tasks require multiple passes over the database and if the database size is large, which is usually the case, scalable high performance solutions involving multiple processors are required. In this paper, we present a novel parallel frequent itemset mining algorithm which is called HPFP-Miner. The proposed algorithm is based on FP-Growth and introduces little communication overheads by efficiently partitioning the list of frequent elements list over processors. The results of experiment show that HPFP-Miner has good scalability and performance.
	TO cite this article:CHEN Xiaoyun,HE Yanshan,CHEN Pengfei, et al. HPFP-Miner: A Novel Parallel Frequent Itemset Mining Algorithm[OL].[ 8 April 2009] http://en.paper.edu.cn/en_releasepaper/content/31153


	2. The Minimum Spanning Flow Model of the Hamiltonian Path Problem in a Digraph and its Polynomial Algorithm*
	Xuanxi Ning,Angelika Ning
	Computer Science and Technology 08 August 2006
	Show/Hide Abstract \| Cite this paper︱Full-text: PDF (0 B)

	Abstract: Recently in the research work on the blocking flow theory the concept of minimum flow was put forward and the model of the minimum spanning flow was established. In this paper it is proved that the problem of constructing a Hamiltonian path in a digraph (DHP) can be polynomially reduced to the problem of constructing a non-circuit minimum spanning flow in an extended network with arcs to which the unit capacity of l is assigned. Based on the principle of self-organization of a non-circuit minimum spanning flow in a network[1][2], we developed an algorithm for constructing a Hamiltonian path in a digraph, if at least one Hamiltonian path exists. Theory and practice show that constructing such a minimum spanning flow in one step is indeed as difficult as the DHP problem. Fortunately, the construction of a non-circuit minimum spanning flow can be completed in two steps: (1) constructing a minimum spanning flow (with or without circular flows) in the extended network by searching adjusting close chains. (2) constructing the non-circuit minimum spanning flow (without circular flows) by searching alternate close chains in the distribution of a minimum spanning flow with circular flows[1]. In this paper, we’ll prove that these two steps can be completed in polynomial time respectively, so the algorithm is of polynomial complexity O(n3m). The method of extending the algorithm for constructing Hamiltonian circuits in general graphs will also be introduced. About 9600 examples of different scales (n=10~4000, m=20~8000) were tested in the last eight years to test the effectiveness of the algorithm and some typical examples are presented in this paper.
	TO cite this article:Xuanxi Ning,Angelika Ning. The Minimum Spanning Flow Model of the Hamiltonian Path Problem in a Digraph and its Polynomial Algorithm*[OL].[ 8 August 2006] http://en.paper.edu.cn/en_releasepaper/content/7851

Select/Unselect all

For Selected Papers

Saved Papers

Please enter a name for this paper to be shown in your personalized Saved Papers list

Rank

Alert Name:
Alerting to:
Authentication email will be sent to your email address in 24 hours
Frequency:
Email Message Format:	Plain text Graphical(HTML)

Complete the form below and we will recommend the selected titles to your friends on your behalf. * Indicates a required field.
Your name*:
Your email address*:
Recipient's name*:
Recipient's email address*:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find the page(s) useful.

Your name:
Your email address:
Recipient's name:
Recipient's email address:
(multiple recipient's names and email addresses should be separated with semicolons)
Your comments:	I thought you would find this page useful.

Disclaimer: This message was sent to your friend using the "Send it to a friend" facility on the Sciencepaper Online’ WWW site, http://www.paper.edu.cn/en. The Sciencepaper Online is not responsible for the content of this email, and anything said in this email does not necessarily reflect the Sciencepaper Online's views.

	Check out RSS, or use RSS reader to subscribe this item