For How to match supply items with demand items is the most important on technology transaction platform. A matching algorithm based on bipartite graph is proposed in this paper. Firstly, by abstracting characters the suppliers 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 the optimal matching relation. The simulate experiment results showed that the algorithm can return the item pairs of biggest transaction probability so as to make the Technology transaction platform efficient and profit.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.