Library Automation and Digital Archive
LONTAR
Fakultas Ilmu Komputer
Universitas Indonesia

Pencarian Sederhana

Find Similar Add to Favorite

Call Number SEM-347
Collection Type Indeks Artikel prosiding/Sem
Title Study of item matching algorithm based on bipartite graph joint clustering for technology transaction platform, 164-167
Author Ming Zhu, Nana Huang, Cairong Yan;
Publisher Proceedings 2011 4th IEEE International Conference on computer science and information technology Juni 10-12, 2011 Chengdu, China (ICCSIT 2011)
Subject
Location
Lokasi : Perpustakaan Fakultas Ilmu Komputer
Nomor Panggil ID Koleksi Status
SEM-347 TERSEDIA
Tidak ada review pada koleksi ini: 45240
For how to match supply items with demand items is the most important on technology transaction olatform. a matching algorithm based on bipartite graph is proposed in this paper. firstly, by abstarcting characters the supplier and demanders can be clustered into groups based on bipartite graph joint clustering method. then, an incidence matrix between items in each group is built which is used to find thw optimal matching relation. the simulate experiment results showed the that the algorithm can return the item pairs of biggest transaction probability so as to make the technology transaction platform efficientt and profit.