Výsledky vyhľadávania - "Minimum spanning tree-based clustering algorithms"
-
1
Minimum Spanning Tree Based Clustering Algorithms
ISBN: 0769527280, 9780769527284ISSN: 1082-3409Vydavateľské údaje: IEEE 01.11.2006Vydané v 2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06) (01.11.2006)“… In this paper, we propose two minimum spanning tree based clustering algorithms. The first algorithm produces a k-partition of a set of points for any given k…”
Získať plný text
Konferenčný príspevok.. -
2
Enhancing minimum spanning tree-based clustering by removing density-based outliers
ISSN: 1051-2004, 1095-4333Vydavateľské údaje: Elsevier Inc 01.09.2013Vydané v Digital signal processing (01.09.2013)“…Traditional minimum spanning tree-based clustering algorithms only make use of information about edges contained in the tree to partition a data set…”
Získať plný text
Journal Article -
3
Fast approximate minimum spanning tree based clustering algorithm
ISSN: 0925-2312, 1872-8286Vydavateľské údaje: Elsevier B.V 10.01.2018Vydané v Neurocomputing (Amsterdam) (10.01.2018)“…•A fast approximate minimum tree based clustering algorithm is proposed.•A novel centroid based nearest neighbor rule is presented.•Much faster as compared to…”
Získať plný text
Journal Article -
4
A Divide-and-Conquer Approach for Minimum Spanning Tree-Based Clustering
ISSN: 1041-4347, 1558-2191Vydavateľské údaje: New York, NY IEEE 01.07.2009Vydané v IEEE transactions on knowledge and data engineering (01.07.2009)“…Due to their ability to detect clusters with irregular boundaries, minimum spanning tree-based clustering algorithms have been widely used in practice…”
Získať plný text
Journal Article -
5
An efficient minimum spanning tree based clustering algorithm
ISBN: 1424450519, 9781424450510Vydavateľské údaje: IEEE 01.12.2009Vydané v ICM2CS '09 : proceeding of International Conference on Methods and Models in Computer Science:14-15 December 2009, Delhi, India (01.12.2009)“…Clustering analysis has been an emerging research issue in data mining due its variety of applications. In the recent years, it has become an essential tool…”
Získať plný text
Konferenčný príspevok.. -
6
A minimum spanning tree based clustering algorithm for high throughput biological data
ISBN: 1124589023, 9781124589022Vydavateľské údaje: ProQuest Dissertations & Theses 01.01.2011“…A new minimum spanning tree (MST) based heuristic for clustering biological data is proposed. The heuristic uses MSTs to generate initial solutions and applies…”
Získať plný text
Dissertation -
7
An improved parallel minimum spanning tree based clustering algorithm for microarrays data analysis
ISBN: 9781467308281, 1467308285Vydavateľské údaje: IEEE 01.05.2012Vydané v 2012 8th International Conference on Informatics and Systems (01.05.2012)“…Solving duster identification problem on large amount of data is known to be time consuming. Almost au the state of art clustering techniques focuses on…”
Získať plný text
Konferenčný príspevok.. -
8
A New Fast Minimum Spanning Tree-Based Clustering Technique
ISSN: 2375-9232Vydavateľské údaje: IEEE 01.12.2014Vydané v IEEE ... International Conference on Data Mining workshops (01.12.2014)“…Due to its important applications in data mining, many techniques have been developed for clustering. For today's real-world databases which typically have…”
Získať plný text
Konferenčný príspevok.. -
9
Graph-based biomedical text summarization: An itemset mining and sentence clustering approach
ISSN: 1532-0464, 1532-0480, 1532-0480Vydavateľské údaje: United States Elsevier Inc 01.08.2018Vydané v Journal of biomedical informatics (01.08.2018)“…[Display omitted] •A biomedical text summarization is proposed, which uses concept-level analysis.•Frequent itemset mining is combined with graph…”
Získať plný text
Journal Article -
10
Minimum spanning tree based clustering for outlier detection
ISSN: 0972-0529, 2169-0065Vydavateľské údaje: Taylor & Francis Group 01.01.2011Vydané v Journal of discrete mathematical sciences & cryptography (01.01.2011)“… Minimum spanning tree based clustering algorithm is capable of detecting clusters with irregular boundaries…”
Získať plný text
Journal Article -
11
A novel dynamic minimum spanning tree based clustering method for image mining
ISSN: 0972-0529, 2169-0065Vydavateľské údaje: Taylor & Francis Group 01.10.2011Vydané v Journal of discrete mathematical sciences & cryptography (01.10.2011)“…Image mining is more than just an extension of data mining to image domain. Image mining is a technique commonly used to extract knowledge directly from image…”
Získať plný text
Journal Article -
12
Meta clusters through minimum spanning tree based clustering for performance analysis of students
ISSN: 0972-0529, 2169-0065Vydavateľské údaje: Taylor & Francis Group 01.08.2011Vydané v Journal of discrete mathematical sciences & cryptography (01.08.2011)“… Minimum Spanning Tree based clustering algorithm is capable of detecting clusters with irregular boundaries…”
Získať plný text
Journal Article -
13
Minimum Spanning Tree-Resembling algorithm for Clusters, Outliers and Hubs
ISSN: 0972-0529, 2169-0065Vydavateľské údaje: Taylor & Francis 04.03.2015Vydané v Journal of discrete mathematical sciences & cryptography (04.03.2015)“… In this paper we present a new algorithm MSTRCOH similar to Minimum Spanning Tree based clustering algorithm…”
Získať plný text
Journal Article -
14
Structural similarity micro clustering algorithm for local outliers and hubs using dynamic minimum spanning tree
ISSN: 0972-0529, 2169-0065Vydavateľské údaje: Taylor & Francis Group 01.06.2011Vydané v Journal of discrete mathematical sciences & cryptography (01.06.2011)“… Minimum spanning tree based clustering algorithm is capable of detecting clusters with irregular boundaries…”
Získať plný text
Journal Article -
15
An integrated approach for local outlier detection using dynamic minimum spanning tree
ISSN: 0972-0529, 2169-0065Vydavateľské údaje: Taylor & Francis Group 01.01.2011Vydané v Journal of discrete mathematical sciences & cryptography (01.01.2011)“… Minimum spanning tree based clustering algorithm is capable of detecting clusters with irregular boundaries…”
Získať plný text
Journal Article -
16
Structural similarity clustering for detection of outliers and hubs using minimum spanning tree
ISSN: 0972-0529, 2169-0065Vydavateľské údaje: Taylor & Francis Group 01.01.2011Vydané v Journal of discrete mathematical sciences & cryptography (01.01.2011)“… A number of clustering algorithms exist that can solve the problem of clustering. Minimum spanning tree based clustering algorithm is capable of detecting clusters with irregular boundaries…”
Získať plný text
Journal Article -
17
A Novel Algorithm for Informative Meta Similarity Clusters Using Minimum Spanning Tree
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 06.05.2010Vydané v arXiv.org (06.05.2010)“… In this paper we propose two minimum spanning trees based clustering algorithm. The first algorithm produces k clusters with center and guaranteed intra-cluster similarity…”
Získať plný text
Paper

