Coe: Clustering with obstacles entities a preliminary study

Anthony K.H. Tung; Jean Hon; Jiawei Han

doi:10.1007/3-540-45571-x_19

Coe: Clustering with obstacles entities a preliminary study

Anthony K.H. Tung, Jean Hon, Jiawei Han

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Clustering analysis has been a very active area of research in the data mining community. However, most algorithms have ignored the tact that physical obstacles exist in the real world and could thus aiffect the result of clustering dramatically. In this paper, we will look at the problem of clustering in the presence of obstacles. We called this problem the COE (Clustering with Obstaicles Entities) problem and provide an outhne of an algorithm called COE-CLARANS to solve it.

Original language	English (US)
Title of host publication	Knowledge Discovery and Data Mining
Subtitle of host publication	Current Issues and New Applications - 4th Pacific-Asia Conference, PAKDD 2000, Proceedings
Editors	Takao Terano, Huan Liu, Arbee L.P. Chen
Publisher	Springer
Pages	165-168
Number of pages	4
ISBN (Print)	3540673822, 9783540673828
DOIs	https://doi.org/10.1007/3-540-45571-x_19
State	Published - 2000
Externally published	Yes
Event	4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2000 - Kyoto, Japan Duration: Apr 18 2000 → Apr 20 2000

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1805
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2000
Country/Territory	Japan
City	Kyoto
Period	4/18/00 → 4/20/00

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Online availability

10.1007/3-540-45571-x_19

Library availability

Discover UIUC Full Text

Cite this

Tung, A. K. H., Hon, J., & Han, J. (2000). Coe: Clustering with obstacles entities a preliminary study. In T. Terano, H. Liu, & A. L. P. Chen (Eds.), Knowledge Discovery and Data Mining: Current Issues and New Applications - 4th Pacific-Asia Conference, PAKDD 2000, Proceedings (pp. 165-168). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1805). Springer. https://doi.org/10.1007/3-540-45571-x_19

Coe : Clustering with obstacles entities a preliminary study. / Tung, Anthony K.H.; Hon, Jean; Han, Jiawei.

Knowledge Discovery and Data Mining: Current Issues and New Applications - 4th Pacific-Asia Conference, PAKDD 2000, Proceedings. ed. / Takao Terano; Huan Liu; Arbee L.P. Chen. Springer, 2000. p. 165-168 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1805).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Tung, AKH, Hon, J & Han, J 2000, Coe: Clustering with obstacles entities a preliminary study. in T Terano, H Liu & ALP Chen (eds), Knowledge Discovery and Data Mining: Current Issues and New Applications - 4th Pacific-Asia Conference, PAKDD 2000, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1805, Springer, pp. 165-168, 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2000, Kyoto, Japan, 4/18/00. https://doi.org/10.1007/3-540-45571-x_19

Tung AKH, Hon J, Han J. Coe: Clustering with obstacles entities a preliminary study. In Terano T, Liu H, Chen ALP, editors, Knowledge Discovery and Data Mining: Current Issues and New Applications - 4th Pacific-Asia Conference, PAKDD 2000, Proceedings. Springer. 2000. p. 165-168. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45571-x_19

Tung, Anthony K.H. ; Hon, Jean ; Han, Jiawei. / Coe : Clustering with obstacles entities a preliminary study. Knowledge Discovery and Data Mining: Current Issues and New Applications - 4th Pacific-Asia Conference, PAKDD 2000, Proceedings. editor / Takao Terano ; Huan Liu ; Arbee L.P. Chen. Springer, 2000. pp. 165-168 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{3c3985e03629463a9dfc3d3e36e7865b,

title = "Coe: Clustering with obstacles entities a preliminary study",

abstract = "Clustering analysis has been a very active area of research in the data mining community. However, most algorithms have ignored the tact that physical obstacles exist in the real world and could thus aiffect the result of clustering dramatically. In this paper, we will look at the problem of clustering in the presence of obstacles. We called this problem the COE (Clustering with Obstaicles Entities) problem and provide an outhne of an algorithm called COE-CLARANS to solve it.",

author = "Tung, {Anthony K.H.} and Jean Hon and Jiawei Han",

year = "2000",

doi = "10.1007/3-540-45571-x_19",

language = "English (US)",

isbn = "3540673822",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "165--168",

editor = "Takao Terano and Huan Liu and Chen, {Arbee L.P.}",

booktitle = "Knowledge Discovery and Data Mining",

address = "Germany",

note = "4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2000 ; Conference date: 18-04-2000 Through 20-04-2000",

}

TY - GEN

T1 - Coe

T2 - 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2000

AU - Tung, Anthony K.H.

AU - Hon, Jean

AU - Han, Jiawei

PY - 2000

Y1 - 2000

N2 - Clustering analysis has been a very active area of research in the data mining community. However, most algorithms have ignored the tact that physical obstacles exist in the real world and could thus aiffect the result of clustering dramatically. In this paper, we will look at the problem of clustering in the presence of obstacles. We called this problem the COE (Clustering with Obstaicles Entities) problem and provide an outhne of an algorithm called COE-CLARANS to solve it.

AB - Clustering analysis has been a very active area of research in the data mining community. However, most algorithms have ignored the tact that physical obstacles exist in the real world and could thus aiffect the result of clustering dramatically. In this paper, we will look at the problem of clustering in the presence of obstacles. We called this problem the COE (Clustering with Obstaicles Entities) problem and provide an outhne of an algorithm called COE-CLARANS to solve it.

UR - http://www.scopus.com/inward/record.url?scp=84942758304&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84942758304&partnerID=8YFLogxK

U2 - 10.1007/3-540-45571-x_19

DO - 10.1007/3-540-45571-x_19

M3 - Conference contribution

AN - SCOPUS:84942758304

SN - 3540673822

SN - 9783540673828

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 165

EP - 168

BT - Knowledge Discovery and Data Mining

A2 - Terano, Takao

A2 - Liu, Huan

A2 - Chen, Arbee L.P.

PB - Springer

Y2 - 18 April 2000 through 20 April 2000

ER -

Coe: Clustering with obstacles entities a preliminary study

Abstract

Publication series

Other

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this