Talk:HCS clustering algorithm - Revision history

Cewbot: Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}.

2024-02-03T04:59:22Z

Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}.

← Previous revision		Revision as of 04:59, 3 February 2024
Line 1:		Line 1:
			{{WikiProject banner shell\|
	{{WikiProject Computer science}}		{{WikiProject Computer science}}
			}}
	'''1. '''''HCS clustering algorithm'' article shouldn't be orphan, it could be linked from:		'''1. '''''HCS clustering algorithm'' article shouldn't be orphan, it could be linked from:

Christian75: Assessment: +Computer science (assisted)

2017-02-19T10:32:54Z

Assessment: +Computer science (assisted)

← Previous revision		Revision as of 10:32, 19 February 2017
Line 1:		Line 1:
			{{WikiProject Computer science}}
	'''1. '''''HCS clustering algorithm'' article shouldn't be orphan, it could be linked from:		'''1. '''''HCS clustering algorithm'' article shouldn't be orphan, it could be linked from:

212.179.4.49 at 08:10, 19 August 2013

2013-08-19T08:10:03Z

← Previous revision		Revision as of 08:10, 19 August 2013
Line 40:		Line 40:
	2. E Hartuv, A O Schmitt, J Lange, S Meier-Ewert, H Lehrach, R Shamir. "An algorithm for clustering cDNA fingerprints." Genomics 66, no. 3 (2000): 249-256.		2. E Hartuv, A O Schmitt, J Lange, S Meier-Ewert, H Lehrach, R Shamir. "An algorithm for clustering cDNA fingerprints." Genomics 66, no. 3 (2000): 249-256.

	These two ~~article~~ '''cite many references and sources''', on both aspects algorithmic and application, which can be copied to the article wiki page:		These two articles '''cite many references and sources''', on both aspects algorithmic and application, which can be copied to the article wiki page:

	Ahuja, R. K., Magnanti, T. A., and Orlin, J. B. (1993). “Network		Ahuja, R. K., Magnanti, T. A., and Orlin, J. B. (1993). “Network

ErezHartuv at 09:36, 18 August 2013

2013-08-18T09:36:35Z

← Previous revision		Revision as of 09:36, 18 August 2013
Line 205:		Line 205:
	IEEE Trans. Pattern Anal. Machine Intelligence 15(11): 1101–		IEEE Trans. Pattern Anal. Machine Intelligence 15(11): 1101–
	1113.		1113.
			[[User:ErezHartuv\|ErezHartuv]] ([[User talk:ErezHartuv\|talk]]) 09:36, 18 August 2013 (UTC)
	[[User:ErezHartuv\|ErezHartuv]] ([[User talk:ErezHartuv\|talk]]) 09:22, 18 August 2013 (UTC)		[[User:ErezHartuv\|ErezHartuv]] ([[User talk:ErezHartuv\|talk]]) 09:22, 18 August 2013 (UTC)
	[[User:ErezHartuv\|ErezHartuv]] ([[User talk:ErezHartuv\|talk]]) 08:04, 18 August 2013 (UTC)		[[User:ErezHartuv\|ErezHartuv]] ([[User talk:ErezHartuv\|talk]]) 08:04, 18 August 2013 (UTC)

ErezHartuv at 09:33, 18 August 2013

2013-08-18T09:33:58Z

← Previous revision		Revision as of 09:33, 18 August 2013
Line 1:		Line 1:
	'''1. '''''HCS clustering algorithm'' article shouldn't be orphan, it could be linked ~~for example,~~ from:		'''1. '''''HCS clustering algorithm'' article shouldn't be orphan, it could be linked from:

	http://en.wikipedia.org/wiki/Cluster_analysis		http://en.wikipedia.org/wiki/Cluster_analysis

ErezHartuv at 09:33, 18 August 2013

2013-08-18T09:33:27Z

← Previous revision		Revision as of 09:33, 18 August 2013
Line 1:		Line 1:
	'''1. '''''HCS clustering algorithm'' article shouldn't be orphan, it could be linked for example, from:		'''1. '''''HCS clustering algorithm'' article shouldn't be orphan, it could be linked for example, from:

	http://en.wikipedia.org/wiki/Cluster_analysis ~~, and from: http://en.wikipedia.org/wiki/Data_mining~~		http://en.wikipedia.org/wiki/Cluster_analysis

			http://en.wikipedia.org/wiki/Data_mining

			http://en.wikipedia.org/wiki/Bioinformatics

	'''2. '''There are '''plenty of cites''' of the ''HCS clustering algorithm'' which can be found by googling: ''a clustering algorithm based on graph connectivity''.		'''2. '''There are '''plenty of cites''' of the ''HCS clustering algorithm'' which can be found by googling: ''a clustering algorithm based on graph connectivity''.

212.179.4.49 at 09:29, 18 August 2013

2013-08-18T09:29:59Z

ErezHartuv at 09:22, 18 August 2013

2013-08-18T09:22:26Z

← Previous revision		Revision as of 09:22, 18 August 2013
Line 200:		Line 200:
	IEEE Trans. Pattern Anal. Machine Intelligence 15(11): 1101–		IEEE Trans. Pattern Anal. Machine Intelligence 15(11): 1101–
	1113.		1113.
			[[User:ErezHartuv\|ErezHartuv]] ([[User talk:ErezHartuv\|talk]]) 09:22, 18 August 2013 (UTC)

	[[User:ErezHartuv\|ErezHartuv]] ([[User talk:ErezHartuv\|talk]]) 08:04, 18 August 2013 (UTC)		[[User:ErezHartuv\|ErezHartuv]] ([[User talk:ErezHartuv\|talk]]) 08:04, 18 August 2013 (UTC)

ErezHartuv at 09:20, 18 August 2013

2013-08-18T09:20:56Z

← Previous revision		Revision as of 09:20, 18 August 2013
Line 1:		Line 1:
	'''1. '''''HCS clustering algorithm'' article shouldn't be orphan, it could be linked for example from ~~clustering algorithms page.~~		'''1. '''''HCS clustering algorithm'' article shouldn't be orphan, it could be linked for example, from:
	http://en.wikipedia.org/wiki/Cluster_analysis		http://en.wikipedia.org/wiki/Cluster_analysis

ErezHartuv at 09:19, 18 August 2013

2013-08-18T09:19:48Z

← Previous revision		Revision as of 09:19, 18 August 2013
Line 1:		Line 1:
	'''1. '''''HCS clustering algorithm'' article shouldn't be orphan, it could be linked for example from clustering algorithms page.		'''1. '''''HCS clustering algorithm'' article shouldn't be orphan, it could be linked for example from clustering algorithms page.
			http://en.wikipedia.org/wiki/Cluster_analysis

	'''2. '''There are '''plenty of cites''' of the ''HCS clustering algorithm'' which can be found by googling: ''a clustering algorithm based on graph connectivity''.		'''2. '''There are '''plenty of cites''' of the ''HCS clustering algorithm'' which can be found by googling: ''a clustering algorithm based on graph connectivity''.

← Previous revision		Revision as of 09:29, 18 August 2013
Line 1:		Line 1:
	'''1. '''''HCS clustering algorithm'' article shouldn't be orphan, it could be linked for example, from:		'''1. '''''HCS clustering algorithm'' article shouldn't be orphan, it could be linked for example, from:
	http://en.wikipedia.org/wiki/Cluster_analysis		http://en.wikipedia.org/wiki/Cluster_analysis , and from: http://en.wikipedia.org/wiki/Data_mining

	'''2. '''There are '''plenty of cites''' of the ''HCS clustering algorithm'' which can be found by googling: ''a clustering algorithm based on graph connectivity''.		'''2. '''There are '''plenty of cites''' of the ''HCS clustering algorithm'' which can be found by googling: ''a clustering algorithm based on graph connectivity''.
Line 6:		Line 6:
	For example, two works that builds (and cites) on ''HCS clustering algorithm'' are:		For example, two works that builds (and cites) on ''HCS clustering algorithm'' are:

	'''a.''' ''Mining coherent dense ~~subgraphs~~ across massive biological networks for functional discovery.		'''a.''' ''Mining coherent dense sub-graphs across massive biological networks for functional discovery.
	Haiyan Hu1, Xifeng Yan2, Yu Huang1, Jiawei Han2 and Xianghong Jasmine Zhou1,∗		Haiyan Hu1, Xifeng Yan2, Yu Huang1, Jiawei Han2 and Xianghong Jasmine Zhou1,∗
	Vol. 21 Suppl. 1 2005, pages i213–i221 doi:10.1093/bioinformatics/bti1049''		Vol. 21 Suppl. 1 2005, pages i213–i221 doi:10.1093/bioinformatics/bti1049''

	They write in the article:"MODES is developed		They write in the article:"MODES is developed
	based on HCS (Mining Highly Connected ~~Subgraphs~~) (Hartuv		based on HCS (Mining Highly Connected Sub-graphs) (Hartuv
	and Shamir, 2000), with two new features: (1) MODES..."		and Shamir, 2000), with two new features: (1) MODES..."

Line 18:		Line 18:

	They write in the article:Among those that		They write in the article:Among those that
	are most related to our work, [6] (HCS ~~clustring~~ algorithm) provides a definition of highly		are most related to our work, [6] (HCS clustering algorithm) provides a definition of highly
	connected ~~subgraph~~ that is valid and useful in practice. There,		connected sub-graph that is valid and useful in practice. There,
	the HCS algorithm is one of the most well-known clustering		the HCS algorithm is one of the most well-known clustering
	algorithms and has been widely used in various domains such		algorithms and has been widely used in various domains such