Abstract
Both documents clustering and words clustering are well studied problems. Most existing algorithms cluster documents (advertisement) and words (query) separately but not simultaneously. In this paper we present a novel idea of analyzing both queries and advertisements which occur with queries at the same time. We present an innovative co-clustering algorithm that suggests queries by co-clustering advertisements and queries. We pose the co-clustering problem as an optimization problem in information theory — the optimal co-clustering maximizes the mutual information between the clustered random variables subject to constraints on the number of row and column clusters.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.