The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Oct. 29, 2013
Filed:
Sep. 20, 2010
Fei Cao, Issaquah, WA (US);
Shaoyu Zhou, Issaquah, WA (US);
Zhuoqing Wu, Jr., Bellevue, WA (US);
Sijian Zhang, Bellevue, WA (US);
Siddhartha Roy, Bellevue, WA (US);
Michael A. Elizarov, Sammamish, WA (US);
Fei Cao, Issaquah, WA (US);
Shaoyu Zhou, Issaquah, WA (US);
Zhuoqing Wu, Jr., Bellevue, WA (US);
Sijian Zhang, Bellevue, WA (US);
Siddhartha Roy, Bellevue, WA (US);
Michael A. Elizarov, Sammamish, WA (US);
Microsoft Corporation, Redmond, WA (US);
Abstract
Large sets of unorganized data may provide little value in identifying useful observations from such data. For example, an online merchant may maintain a database of millions of user IDs (e.g., a cookie ID, a login ID, a device ID, a network ID, etc.) along with content viewed and/or actions taken with the user IDs, where minimal associations are known between user IDs. It may be advantageous to link together user IDs of respective users to capture a comprehensive view of respective users' activities. Accordingly, one or more systems and/or techniques for identifying a cluster of nodes based upon transforming a set of node pairings (e.g., pairings of related nodes) one or more times are disclosed herein. Iterative transformations may be performed until respective nodes are paired with merely their smallest neighboring node and are paired with no other node. In this way, node clusters may be identifiable.