Improving Thai Herb Image Classification using Convolutional Neural Networks with Boost up Features

Conference proceedings article

ผู้เขียน/บรรณาธิการ

กลุ่มสาขาการวิจัยเชิงกลยุทธ์

ไม่พบข้อมูลที่เกี่ยวข้อง

รายละเอียดสำหรับงานพิมพ์

รายชื่อผู้แต่ง: Visavakitcharoen A., Ratanasanya S., Polvichai J.

ผู้เผยแพร่: Hindawi

ปีที่เผยแพร่ (ค.ศ.): 2019

ISBN: 9781538675120

นอก: 0146-9428

eISSN: 1745-4557

URL: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85065068772&doi=10.1109%2fKST.2019.8687446&partnerID=40&md5=2a60788da2d106693e924792ba8306da

ภาษา: English-Great Britain (EN-GB)

ดูในเว็บของวิทยาศาสตร์ | ดูบนเว็บไซต์ของสำนักพิมพ์ | บทความในเว็บของวิทยาศาสตร์

บทคัดย่อ

Graph representation, even its simplest form, has many applications, ranging from networking to bioinformatics. Graph clustering draws much attentions recently as it enables extraction of useful information, especially when the graph is highly dense. Partitioning Clustering is a popular method in graph clustering. In general, graph clustering is an NP-hard problem, therefore, it is possible to have different forms and different number of clusters with the same density in a highly connected graph. Most research in graph clustering focuses on determining clusters from a specified number of clusters. Nevertheless, knowing different sizes of clusters with similar densities is advantageous with several applications such as validating a service from smaller to larger communities with similar characteristics. This work presents a novel algorithm to determining different sizes of Partitioning Clusters with similar degrees of density in a highly connected graph by using minimum sub-cycles as motifs. The algorithm adopts Greedy-Strategy in partitioning clustering. 'Intra-Cluster Density', 'Difference Density', 'Coverage' and 'Conductance' are used as graph clustering metrics. ฉ 2019 IEEE.

คำสำคัญ

Graph Clustering, Greedy Strategy, Highly Connected Graph, Minimum Sub-cycle, partitioning clustering