%0 Journal Article %1 Ganesan:2003:EHD:635484.635487 %A Ganesan, Prasanna %A Garcia-Molina, Hector %A Widom, Jennifer %C New York, NY, USA %D 2003 %I ACM %J ACM Trans. Inf. Syst. %K hierarchic ranking similarity structure %N 1 %P 64--93 %R 10.1145/635484.635487 %T Exploiting Hierarchical Domain Structure to Compute Similarity %U http://doi.acm.org/10.1145/635484.635487 %V 21 %X The notion of similarity between objects finds use in many contexts, for example, in search engines, collaborative filtering, and clustering. Objects being compared often are modeled as sets, with their similarity traditionally determined based on set intersection. Intersection-based measures do not accurately capture similarity in certain domains, such as when the data is sparse or when there are known relationships between items within sets. We propose new measures that exploit a hierarchical domain structure in order to produce more intuitive similarity scores. We extend our similarity measures to provide appropriate results in the presence of multisets (also handled unsatisfactorily by traditional measures), for example, to correctly compute the similarity between customers who buy several instances of the same product (say milk), or who buy several products in the same category (say dairy products). We also provide an experimental comparison of our measures against traditional similarity measures, and report on a user study that evaluated how well our measures match human intuition.

@article{Ganesan:2003:EHD:635484.635487, abstract = {The notion of similarity between objects finds use in many contexts, for example, in search engines, collaborative filtering, and clustering. Objects being compared often are modeled as sets, with their similarity traditionally determined based on set intersection. Intersection-based measures do not accurately capture similarity in certain domains, such as when the data is sparse or when there are known relationships between items within sets. We propose new measures that exploit a hierarchical domain structure in order to produce more intuitive similarity scores. We extend our similarity measures to provide appropriate results in the presence of multisets (also handled unsatisfactorily by traditional measures), for example, to correctly compute the similarity between customers who buy several instances of the same product (say milk), or who buy several products in the same category (say dairy products). We also provide an experimental comparison of our measures against traditional similarity measures, and report on a user study that evaluated how well our measures match human intuition.}, acmid = {635487}, added-at = {2015-11-13T16:46:53.000+0100}, address = {New York, NY, USA}, author = {Ganesan, Prasanna and Garcia-Molina, Hector and Widom, Jennifer}, biburl = {https://www.bibsonomy.org/bibtex/2f815eddea20d7b7924abd41c5ea6a62b/backpatcher}, description = {Exploiting hierarchical domain structure to compute similarity}, doi = {10.1145/635484.635487}, interhash = {f8385f129c4686068451d9cc34190eb9}, intrahash = {f815eddea20d7b7924abd41c5ea6a62b}, issn = {1046-8188}, issue_date = {January 2003}, journal = {ACM Trans. Inf. Syst.}, keywords = {hierarchic ranking similarity structure}, month = jan, number = 1, numpages = {30}, pages = {64--93}, publisher = {ACM}, timestamp = {2015-11-13T16:46:53.000+0100}, title = {Exploiting Hierarchical Domain Structure to Compute Similarity}, url = {http://doi.acm.org/10.1145/635484.635487}, volume = 21, year = 2003 }