Patent Document ID: 9442905
Application ID: 13930631

Base Claim:
1. A method of identifying a name and boundary of a neighborhood based on web documents, the method comprising: extracting, via one or more processors, n-grams appearing in a plurality of web documents and being of less than a threshold word count: obtaining a plurality of web documents, each web document being associated with a respective geographic location, the web documents including user reviews of local businesses associated with the respective geographic locations in the geographic information system, extracting n-grams from each of the web documents; associating, via the one or more processors, the n-grams with geographic locations associated with the web documents from which the n-grams were extracted, including associating each of the n-grams with a respective latitude and longitude coordinate of the web document from which the n-grams were extracted; identifying, via the one or more processors, a neighborhood by identifying a cluster of geographic locations associated with the n-grams, including: filtering from the n-grams stop-words, filtering from the n-grams phrases occurring in the web documents less than a threshold amount, filtering from the n-grams at least some n-grams that do not correspond with a cluster, filtering from the n-grams at least some n-grams that correspond to more than a threshold amount of clusters, filtering from the n-grams at least some n-grams that correspond to more than a threshold amount of geographic locations outside of a cluster; determining, via the one or more processors, a boundary for the neighborhood from the distribution of geographical locations in the cluster, including determining a convex hull of the cluster by identifying geographic locations of vertices of a polygon that contains at least a substantial portion of the cluster; determining, via the one or more processors, a name for the neighborhood from the n-gram, including: designating the n-gram as a candidate name for the geographic area defined by the polygon, identifying one or more candidate names for geographic areas at least partially overlapping the polygon, ranking the candidate names based on an amount of times the name appears in the web documents and the size of the geographic areas at least partially overlapping the polygon, and selecting the highest ranking candidate name as the name; and adding, via the one or more processors, the name and boundary of the neighborhood to a geographic information system, including storing the name in memory in a record that associates the name with the geographic area defined by the boundary.

---

Claim 2:
2. The method of claim 1 , wherein identifying the cluster of the geographical locations associated with the n-gram is performed using a density-based spatial clustering of applications with noise (DBSCAN) algorithm.