Computer-implemented systems and methods for data management and visualization

Information

  • Patent Grant
  • 9996553
  • Patent Number
    9,996,553
  • Date Filed
    Monday, April 10, 2017
    8 years ago
  • Date Issued
    Tuesday, June 12, 2018
    7 years ago
Abstract
Systems and methods are disclosed for data management and visualization. In accordance with one implementation, a method is provided that includes, for example, receiving data from one or more sources, the data being associated with a plurality of locations. The method also includes receiving, based on input from a user, a selection of a set of metrics for scoring each of the plurality of locations and a weight to assign to each metric. In addition, the method includes calculating an overall score for each of the plurality of locations based on the received data, the selected set of metrics, and the weight assigned to each metric.
Description
BACKGROUND

In today's information age, individuals, businesses, and other entities have access to many information sources. The Internet, for example, has become one of the world's largest sources of information and provides instantaneous access to data from across the globe. Other sources of information include personal and corporate databases, as well as professional data sources.


Data and the information derived from it can be used for many purposes. In some cases, it may be used for personal reasons, such as determining where to live or travel. In other cases, it may be used for commercial or business reasons. For example, a company may desire to analyze a number of different states or geographic regions to determine where to build or relocate a new factory or office. In a knowledge economy, information can also be used to provide commercialized products and solutions for consumers.


Current systems and tools for analyzing data, however, do not allow users to efficiently manage and analyze data. Among other things, current solutions do not allow users to select, weigh, manipulate, and visualize data in ways suitable to their needs. Thus, it may be difficult and time consuming for a user to evaluate data for a variety of purposes, such as to calculate the desirability of a given location based on a set of criteria or to weigh locations against one another. Current solutions also suffer from other drawbacks, such as limited scalability, flexibility, and/or customization. Therefore, improved systems and methods are desired that provide effective data management and visualization features, while addressing one or more of the above drawbacks and disadvantages.





BRIEF DESCRIPTION OF THE DRAWINGS

Reference will now be made to the accompanying drawings, which illustrate exemplary embodiments of the present disclosure. In the drawings:



FIG. 1 is a block diagram of an exemplary system, consistent with embodiments of the present disclosure;



FIG. 2 is a flowchart of an exemplary method for managing and visualizing data, consistent with embodiments of the present disclosure;



FIG. 3 illustrates an exemplary user interface, consistent with embodiments of the present disclosure; and



FIG. 4 illustrates another exemplary user interface, consistent with embodiments of the present disclosure.





DESCRIPTION OF EXEMPLARY EMBODIMENTS

Reference will now be made in detail to several exemplary embodiments of the present disclosure, including those illustrated in the accompanying drawings. Whenever possible, the same reference numbers will be used throughout the drawings to refer to the same or like parts.


Embodiments disclosed herein are directed to, among other things, computer-implemented systems and methods for data management and visualization. The disclosed embodiments provide novel techniques for users to select, weigh, manipulate, and visualize data. The disclosed embodiments also provide an integrated solution that is scalable, flexible, and customizable for each user's needs.


In accordance with some embodiments, systems and methods are provided for data management and visualization. With such systems and methods, a user may manage the storage of data from one or more sources. Data may be added, deleted, modified and/or otherwise manipulated, such as by geographic areas of interest or date range(s). Data weighting and scoring may also be performed. In some embodiments, data weights may be assigned by a user, along with characteristics or other parameters for computing scores. Additionally, in some embodiments, a user may select to view the data in one or more visualization formats, such as in a map, a table, a chart, and/or other format(s).


Embodiments of the present disclosure may be implemented to allow users to manage and visualize data on a geographic or location basis. In such embodiments, a user may specify which characteristics are important for analyzing individual locations and view the data in one or more formats in order to easily compare multiple locations with one another on the basis of those characteristics. In addition, as further disclosed herein, a set of metrics may be specified by a user as well as the weights to be applied to each metric for purposes of analysis. The metrics, weights, and characteristics may all be adjustable and user-defined to allow complete flexibility and customization.


In some embodiments, systems and methods are provided that store data from one or more sources, the data being associated with a plurality of locations. The systems and methods also receive, from a user, an identification of a set of metrics derivable from the stored data and a weight to be assigned to each metric. In addition, the systems and methods calculate, for each of the plurality of locations, a score for each identified metric, apply the corresponding weight to the score for each identified metric, and calculate, for each of the plurality of locations, an overall score based on a sum of the weighted scores for each location. Furthermore, the systems and methods can provide instructions to present a display to the user, the display including a representation of the overall score and other corresponding data for each location. In some embodiments, the user may also be provided with input elements on the display to adjust, for example, the assigned weights and visualize the impact those changes have on the scores and/or other data for each location.


As will be appreciated from the present disclosure, the exemplary systems and method described herein may be implemented to analyze data on a geographic or location basis. Such an analysis may be done for a variety of purposes. In one exemplary embodiment provided herein, data is managed and visualized for purposes of identifying a potential area to live or purchase a home. Of course, the embodiments of the present disclosure are not limited to this exemplary implementation, and can be implemented and used for a wide variety of purposes. For example, the disclosed embodiments may be used by a business to determine a location for a new office or factory, by a student to determine which college to attend, or by an organization to determine where to host an event.


According to some embodiments, the operations, techniques, and/or components described herein can be tangibly implemented by a system, which can include one or more special-purpose computing devices. The special-purpose computing devices can be hard-wired to perform the operations, techniques, and/or components described herein, or can include digital computing devices such as one or more application-specific integrated circuits (ASICs) or field programmable gate arrays (FPGAs) that are persistently programmed to perform the operations, techniques and/or components described herein, or can include one or more hardware processors programmed to perform such features of the present disclosure pursuant to program instructions in firmware, memory, other storage, or a combination. Such special-purpose computing devices can also combine custom hard-wired logic, ASICs, or FPGAs with custom programming to accomplish the technique and other features of the present disclosure. The special-purpose computing devices can be desktop computer systems, portable computer systems, handheld devices, networking devices, or any other device that incorporates hard-wired and/or program logic to implement the techniques and other features of the present disclosure.


The one or more special-purpose computing devices can be generally controlled and coordinated by operating system software, such as iOS, Android, Blackberry, Chrome OS, Windows XP, Windows Vista, Windows 7, Windows 8, Windows Server, Windows CE, Unix, Linux, SunOS, Solaris, VxWorks, or other compatible operating systems. In other embodiments, the computing device can be controlled by a proprietary operating system. Operating systems control and schedule computer processes for execution, perform memory management, provide file system, networking, I/O services, and provide a user interface functionality, such as a graphical user interface (“GUI”), among other things.


By way of example, FIG. 1 is a block diagram that illustrates an implementation of an exemplary system 100, which, as described above, can comprise one or more special-purpose computing devices. As will be appreciated from this disclosure, the exemplary embodiment of FIG. 1 is provided for purposes of illustration. The number and arrangement of components in system 100 may be modified or adjusted without departing from the teachings of the present disclosure.


As illustrated in FIG. 1, system 100 includes a computing device 110 that includes a bus 102 or other communication mechanism for communicating information, and one or more hardware processors 104, coupled with bus 102 for processing information. The one or more hardware processors 104 can be, for example, one or more microprocessors.


Computing device 110 also includes a main memory 106, such as a random access memory (RAM) or other dynamic storage device, coupled to bus 102 for storing information and instructions to be executed by processor 104. Main memory 106 also can be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor 104. Such instructions, when stored in non-transitory storage media accessible to one or more processors 104, render computing device 110 into a special-purpose machine that is customized to perform the operations specified in the instructions.


Computing device 110 further includes a read only memory (ROM) 108 or other static storage device coupled to bus 102 for storing static information and instructions for processor 104. A storage device 150, such as a magnetic disk, optical disk, or USB thumb drive (Flash drive), etc., is provided and coupled to bus 102 for storing information and instructions.


Computing device 110 can be coupled via bus 102 to a display 112, such as a cathode ray tube (CRT), an LCD display, or a touchscreen, for displaying information to a computer user. An input device 114, including alphanumeric and other keys, is coupled to bus 102 for communicating information and command selections to processor 104. Another type of user input device is cursor control 116, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 104 and for controlling cursor movement on display 112. The input device typically has two degrees of freedom in two axes, a first axis (for example, x) and a second axis (for example, y), that allows the device to specify positions in a plane. In some embodiments, the same direction information and command selections as cursor control may be implemented via receiving touches on a touch screen without a cursor.


Computing device 110 can include a user interface module to implement a GUI that may be stored in a mass storage device as executable software codes that are executed by the one or more computing devices. This and other modules may include, by way of example, components, such as software components, object-oriented software components, class components and task components, processes, functions, attributes, procedures, subroutines, segments of program code, drivers, firmware, microcode, circuitry, data, databases, data structures, tables, arrays, and variables.


In general, the word “module,” as used herein, refers to logic embodied in hardware or firmware, or to a collection of software instructions, possibly having entry and exit points, written in a programming language, such as, for example, Java, Lua, C, and C++. A software module can be compiled and linked into an executable program, installed in a dynamic link library, or written in an interpreted programming language such as, for example, BASIC, Perl, Python, or Pig. It will be appreciated that software modules can be callable from other modules or from themselves, and/or can be invoked in response to detected events or interrupts. Software modules configured for execution on computing devices can be provided on a computer readable medium, such as a compact disc, digital video disc, flash drive, magnetic disc, or any other tangible medium, or as a digital download (and can be originally stored in a compressed or installable format that requires installation, decompression, or decryption prior to execution). Such software code can be stored, partially or fully, on a memory device of the executing computing device, for execution by the computing device. Software instructions can be embedded in firmware, such as an EPROM. It will be further appreciated that hardware modules can be comprised of connected logic units, such as gates and flip-flops, and/or can be comprised of programmable units, such as programmable gate arrays or processors. The modules or computing device functionality described herein are preferably implemented as software modules, but can be represented in hardware or firmware. Generally, the modules described herein refer to logical modules that may be combined with other modules or divided into sub-modules despite their physical organization or storage.


Computing device 110 can implement the techniques and other features described herein using customized hard-wired logic, one or more ASICs or FPGAs, firmware and/or program logic which in combination with the computing device causes or programs computing device 110 to be a special-purpose machine. According to some embodiments, the techniques and other features described herein are performed by computing device 110 in response to one or more processors 104 executing one or more sequences of one or more instructions contained in main memory 106. Such instructions can be read into main memory 106 from another storage medium, such as storage device 150. Execution of the sequences of instructions contained in main memory 106 causes processor 104 to perform the process steps described herein. In alternative embodiments, hard-wired circuitry can be used in place of or in combination with software instructions.


The term “non-transitory media” as used herein refers to any media storing data and/or instructions that cause a machine to operate in a specific fashion. Such non-transitory media can comprise non-volatile media and/or volatile media. Non-volatile media includes, for example, optical or magnetic disks, such as storage device 150. Volatile media includes dynamic memory, such as main memory 106. Common forms of non-transitory media include, for example, a floppy disk, a flexible disk, hard disk, solid state drive, magnetic tape, or any other magnetic data storage medium, a CD-ROM, any other optical data storage medium, any physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, NVRAM, any other memory chip or cartridge, and networked versions of the same.


Non-transitory media is distinct from, but can be used in conjunction with, transmission media. Transmission media participates in transferring information between storage media. For example, transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 102. Transmission media can also take the form of acoustic or light waves, such as those generated during radio-wave and infra-red data communications.


Various forms of media can be involved in carrying one or more sequences of one or more instructions to processor 104 for execution. For example, the instructions can initially be carried on a magnetic disk or solid state drive of a remote computer. The remote computer can load the instructions into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to computing device 110 can receive the data on the telephone line and use an infra-red transmitter to convert the data to an infra-red signal. An infra-red detector can receive the data carried in the infra-red signal and appropriate circuitry can place the data on bus 102. Bus 102 carries the data to main memory 106, from which processor 104 retrieves and executes the instructions. The instructions received by main memory 106 can optionally be stored on storage device 150 either before or after execution by processor 104.


Computing device 110 also includes a communication interface 118 coupled to bus 102. Communication interface 118 provides a two-way data communication coupling to a network link 120 that is connected to a local network 122. For example, communication interface 118 can be an integrated services digital network (ISDN) card, cable modem, satellite modem, or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interface 118 can be a local area network (LAN) card to provide a data communication connection to a compatible LAN. Wireless links can also be implemented. In any such implementation, communication interface 118 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.


Network link 120 typically provides data communication through one or more networks to other data devices. For example, network link 120 can provide a connection through local network 122 to a host computer 124 or to data equipment operated by an Internet Service Provider (ISP) 126. ISP 126 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet” 128. Local network 122 and Internet 128 both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 120 and through communication interface 118, which carry the digital data to and from computing device 110, are example forms of transmission media.


Computing device 110 can send messages and receive data, including program code, through the network(s), network link 120 and communication interface 118. In the Internet example, a server 130 might transmit a requested code for an application program through Internet 128, ISP 126, local network 122 and communication interface 118. The received code can be executed by processor 104 as it is received, and/or stored in storage device 150, or other non-volatile storage for later execution. In addition, computing device 110 may receive data from a plurality sources using network link 120 and communication interface 118. The data sources may include personal and corporate databases, as well as professional or commercial data sources. Such data may be transmitted via the Internet or other network(s) and stored locally at computing device 110, or may be hosted remotely (e.g., in a cloud arrangement) and accessed as needed by computing device 110 to perform the methods, techniques, and other features of the present disclosure.



FIG. 2 shows a flowchart representing an exemplary method 200 for managing and visualizing data, consistent with embodiments of the present disclosure. In some embodiments, method 200 can be performed by a client application (e.g., a web browser, a plug-in to a web browser, a standalone executable application, etc.) running on a client device, by a server (e.g., a web server), or it can have some steps or parts thereof executed on the client device, and some steps or parts thereof executed on the server. Thus, method 200 can be performed with, for example, system 100 including one or more computing devices 110, as described above with reference to FIG. 1. Further, while method 200 and other embodiments described herein can be performed by multiple computing devices, each having one or more processors, for purposes of illustration and without limitation, method 200 and other features will be explained herein with respect to a single computing device (e.g., computing device 110). Moreover, while the flowchart discloses the following steps in a particular order, it is appreciated that at least some of the steps can be moved, modified, or deleted where appropriate, consistent with the teachings of the present disclosure.


Referring to FIG. 2, at step 210, the computing device receives data from one or more sources, the data being associated with a plurality of locations. In one embodiment, the computing device receives data associated with a plurality of locations that may be used to analyze the desirability of a location for a particular need or purpose. For example, the received data may include data describing the population, median income, cost of living, unemployment rate, average education level, crime level, school ratings, and tax rate associated with each location. The computing device can receive the data from various sources, including those local to or remote from the computing device. Examples of such sources include a local memory or database, or an external memory or database. For instance, as part of step 210, the computing device can receive data over the Internet from third-party sources, such as government sources (e.g., U.S. Census Bureau), open sources (e.g., Wikipedia), and/or private sources (e.g., GreatSchools).


The received data may be associated with a plurality of locations, each of which in turn is associated with one or more types of geographical units. A geographical unit may include, for example, a unit that delineates a geographical area, such as a set of latitude and longitude coordinates, street address, zip code, school district, city, county, congressional district, state, and country. In one embodiment, the computing device can receive a selection of one or more locations from a user. For example, a user may identify three addresses corresponding to homes the user is considering purchasing or areas where the user is considering living, such that the user can compare various metrics associated with those addresses. Alternatively, the user may choose to analyze all locations within a specified region. For example, the user may select to analyze all zip codes within 45 miles of a city or town to define the scope of relevant data for analysis. In one embodiment, the received data may correspond to data suitable for a chloropleth map. In another embodiment, the received data may be a richer set of data suitable for a geosearch, including, for example, geocoordinates associated with each zip code.


In one embodiment, the computing device manages or allocates the received data to correspond to a geographic unit selected by a user. For example, if the user selects to compare five counties, but certain data received by the computing device is organized according to larger or smaller geographic units, the computing device can allocate the received data by county. In other words, if the user wants to compare the cost of living in five counties, but the computing device only receives cost of living data at the city level, then the computing device will compute the cost of living data for each county based on the cost of living data for each city within each of the selected counties (e.g., weighted average based on population of constituent cities).


At step 220, the computing device receives an identification of a set of metrics derivable from the received data. For example, based on input from the user, the user may indicate that he/she wants to compare locations within a specified region in which to purchase a home based on three metrics: school ratings, cost of living, and median income. This input may be used by the computing device to identify or compute the corresponding data from the received data. In some cases, the data may be directly identified from the received data (i.e., it already exists in the desired form of metric), while in other cases the computing device may transform, extract or compute the desired metric from the received data by applying one or more rules and/or data techniques. For example, if the computing device receives cost of living data at the city level, but the user would like to see cost of living data on the county level, then the computing device may compute the cost of living data on the county level by calculating a weighted average for the county based on the cost of living and relative population of the cities within the county, as discussed above. Moreover, the computing device may transform historical data, such as data associated with obsolete zip codes or zip codes that have changed boundaries, to updated data (e.g., by associating an old zip code with a new set of latitude/longitude coordinates or county). As another example, the computing device may receive data associated with latitude/longitude coordinates. If the user requests to review the data by zip code, then the computing device may obtain an identification of latitude/longitude coordinates (e.g., coordinate ranges) associated with the zip code and calculate a representation of the data (e.g., total, average, weighted average, median) for the entire zip code. In one embodiment, the received data may be received in one unit (e.g., a specific currency or form of measurement) and transformed into another unit in response to a user request. For example, if the user wants to see the average price per square foot for a property, but the computing device receives data regarding the average price of a property on a per-acre basis, then the computing device may transform the received data to reflect the unit selected by the user (e.g., by dividing the average price by 43,560).


In some embodiments, each of the metrics is associated with a weight. The weight may be identified by a user as part of step 220 and indicate the importance that the user attaches to each metric. For example, the weight may be a value between 0 and 100, wherein 0 represents the lowest weight that may be associated with a metric and 100 represents the highest weight that may be associated with a metric. The user may assign each metric may be assigned a separate weight based on input from a user. In one embodiment, the user may assign a metric a weight using a slider bar associated with the metric to move the position of an indicator on the slider bar to the appropriate value. Alternatively, the user may assign weights to metrics using a text input box, drop-down menu, or any other form of input.


In one embodiment, the computing device can store preset values for metrics and/or associated weights. For example, a user may store as a metric preset an identification of a set of metrics that the user considers important for evaluating a location. Thus, each time the user wants to analyze and compare locations, the user can select the metric preset, rather than separately identifying each of the metrics comprising the metric preset. In one embodiment, the user may also store in the metric preset weights associated with each of the metrics. In another embodiment, metric presets may be provided based on, for example, a user type or profile, or evaluation scenario. For example, different sets of metric presets may be defined for different types of people looking to purchase a home, such as a single person, a married couple without children, a family with young children, etc., as each of these types of people may typically focuses on different metrics when searching for a place to live.


At step 230, the computing device can, for each of the plurality of locations, calculate a score for each identified metric. Accordingly, each location may be associated with a plurality of scores, each score corresponding to one of the identified metrics for that location. Thus, in the previous example, each zip code in the specified region would be assigned a separate score for each of the identified metrics. More specifically, in that example, each location would be assigned three scores—one for school ratings, one for cost of living, and one for median income. Each score may fall within a range of permissible scores, such as a range of 0 to 100, with 0 being the lowest possible score for a metric and 100 being the highest possible score for a metric. Thus, in this embodiment, if three metrics are analyzed for each location, the highest overall score for a location (assuming each is weighted at 100%) is 300. Alternatively, the overall scores for a location may range from 0 to 100, with each metric contributing equally. For example, if there are four identified metrics, each would be weighted at 25%.


In some embodiments, a metric may be evaluated based on one or more characteristics specified by a user. For example, the user may identify at least one characteristic for evaluating one or more of the selected metrics. For instance, the user may specify that she wants the displayed school rating associated with each zip code to be based on a teacher-student ratio, per pupil spending, or graduation rate, or a combination of these characteristics. Thus, in one embodiment, calculating a score for a metric may include evaluating the metric in light of the one or more specified characteristics. For example, if the user specifies that she wants the school ratings score assigned to each location to reflect the teacher-student ratio and graduation rate in the location, the computing device can calculate the score for the school ratings metric based on those two characteristics. In one embodiment, the same characteristics are used to calculate the score for the metric with respect to each location.


At step 240, the computing device can, for each of the plurality of locations, apply the corresponding weight to the score for each identified metric. In one embodiment, the computing device applies the associated weight for a metric to its score by multiplying the score by a value determined based on the associated weight (e.g., the weight divided by 100). For example, if the user indicates that the weight for a metric should be 80, then the score for the metric may be multiplied by 0.80.


At step 250, the computing device can, for each of the plurality of locations, calculate an overall score based on the weighted scores. In one embodiment, the computing device calculates an overall score for a location by summing each of the weighted scores for the location. Additionally, or alternatively, the computing device can calculate an overall unweighted score for a location by summing each of the unweighted scores for the location.


At step 260, the computing device provides instructions to present a display to the user that includes, among other things, a representation of the overall score for each location. The type of display may be selectable and/or customizable by a user. For example, in one embodiment, the computing device can display a map comprising a representation of the overall weighted score for each location. In this embodiment, the representation of the overall weighted score may include, for example, a color-coded representation of each location. For example, if a user selects to analyze all counties in a metropolitan area based on three metrics, the overall weighted scores for each of those counties may be represented on a map using a color-coding scheme, whereby the county is drawn on the map in a color corresponding to its score (e.g., green for a high score, yellow for a moderate score, red for a low score). In some embodiments, the user may specific what colors may be used to represents various scores and/or the thresholds for determine what constitutes a high, moderate, or low score.


In one embodiment, the computing device may also provide instructs to present a display including a table comprising a representation of the overall weighted score for each location. In this embodiment, the representation of the overall weighted score for each location may include text that indicates the value of the overall weighted score. The table may also include, for each location, a color-coded image or symbol representing the weighted score. In one embodiment, the computing device can also display each of the metrics, characteristics, characteristic values, raw scores, ranks, weights, and weighted scores for each location. Moreover, in one embodiment, the user may manipulate the table such that information for each location is displayed, for example, based on the overall weighted or unweighted score for each location or the weighted or unweighted score for each location for a given metric.


In one embodiment, the computing device can receive an identification of a date or date range. For example, the user may indicate that she would like the analysis of the locations to be based on data from a certain day, month, year, or range of days, months, or years. Further, in one embodiment, the computing device can calculate a score for each identified metric based on data pertaining to the identified metric for the identified date or date range. For example, the computing device can calculate scores for each identified metric based on data collected for those metrics in the year 2000, weight those scores, and determine an overall weighted score for each location based on data from 2000.


In one embodiment, the computing device can receive an indication of a modified date or date range. For example, the user may indicate another day, month, year, or range of days, months, or years. The computing device can calculate a modified score for each identified metric based on data pertaining to the identified metric for the modified date or date range. The computing device can apply to the modified score for each identified metric, the associated weight for the metric and calculate a modified overall score based on the weighted modified scores. In one embodiment, the computing device can compare the overall score for a location based on an original or previously identified date or date range to the modified overall score for the location corresponding to the modified date or date range. This can enable users to determine how the desirability of a location changes over time (e.g., whether a location is trending positively or negatively), which may indicate, for example, whether the values of homes in the location are likely to rise or fall. In one embodiment, changes in the overall score for a location, as well as changes to the individual metrics for the location, may be presented in a line graph view to enable a user to see how the metric(s) and overall score for that location have changed over time.


In one embodiment, a date or date range may be specified using a timeline slider bar. For example, the computing device can provide instructs to present a display to a user including a color-coded map comprising a plurality of counties comprising a metropolitan area. The computing device can also display concurrently with the map a timeline slider bar indicating a range of years (e.g., 1990-2015). The user may specify a date by clicking within the timeline slider bar on the desired year for analysis. Alternatively, the user may specify a date range by placing one indicator at the beginning of the range and another indicator at the end of the date range. In one embodiment, when the user specifies a date or date range using the timeline slider bar, the computing device, for each of the plurality of locations, calculates a score the each identified metric, applies to the score for each identified metric the associated weight for the identified metric, and calculates an overall weighted score based on the weighted metric scores. The computing device can then display a representation of the overall weighted score for each location, such as by updating the color-coding for the counties displayed on the map to reflect the overall weighted scores for each county for the selected date or date range. Thus, by moving an indicator (or pair of indicators for a date range) forward and backward on the timeline slider bar, the user may see how the desirability of a location is changing over time.


Features that enable scalability may also be provided. For example, in one embodiment, the computing device can receive the identification of one or more additional metrics from a user. Each additional metric may be associated with an additional weight specific to that metric. The computing device can, for each of the plurality of locations, calculate a score for an additional metric, apply to the score for the additional metric the associated additional weight, and recalculate the overall weighted score based on the weighted metric scores for the location. The computing device can also display a representation of the recalculated overall weighted score for each location. Thus, the computing device can enable the user to add additional metrics to the existing metrics for evaluating locations and determine how the consideration of the additional metrics affects the desirability of the locations. It will also be appreciated that metrics may be removed by a user, with the scores for each location being recomputed and displayed by the computing device, so that the user can consider how the removal of one or more metrics impacts the comparison of locations.


In still further embodiments, the computing device can modify the weight associated with one of the metrics based on input from a user. For example, the user may move an indicator on a metric slider bar to raise or lower the weight associated with the metric. In response, the computing device can, for each of the plurality of locations, apply the modified weight to the score for the one of the metrics (i.e., the metric associated with the modified weight) and recalculate the overall weighted score based on the weighted metric scores, including the newly modified weighted metric score and the previously weighted metric scores. The computing device can also cause the display of a representation of the overall weighted score for each location. Thus, the user can see how adjusting the weights applied to one or more of the selected metrics changes the overall weighted score for each location.



FIG. 3 illustrates an exemplary user interface 300, consistent with embodiment of the present disclosure. User interface 300 illustrates an example of a display generated by the computing device (e.g., computing device 110) that can be implemented on device (e.g., display 112) for viewing by a user. Interface 300 can assist the user to visualize the desirability of a plurality of locations on a map. In the exemplary embodiment of FIG. 3, interface 300 includes a metric selector 310, timeline slider bar 320, table view button 330, legend 340, score display 350, statistics display 360, and map 370. Each of these graphical elements is described in greater detail below. It will be understood from this disclosure that the number and arrangement of these elements is exemplary and that modifications can be made, consistent with the present disclosure.


Metric selector 310 may display a representation of the metrics selected by a user for use in analyzing one or more locations. Metric selector 310 may include metric names 312, metric slider bars 314, weight indicators 316, and add new metric button 318. Metric names 312 are the names of the metrics selected by a user for analyzing the locations. Metric slider bars 314 may be used to assign weights to the selected metrics. In the exemplary interface shown in FIG. 3, the selected metrics being analyzed are school ratings, median income, and average home price, and the weights associated with those metrics are 100, 50, and 80, respectively.


A user may select add new metric button 318 to add a new metric to the list of metrics used to analyze the locations. In one embodiment, selecting add new metric 318 will cause the computing device to display a window or other prompt with a listing of potential metrics according to which locations may analyzed. User selection of a new metric will add the metric to metric selector 310. The user may then assign a weight to the new metric by adjusting the weight indicator 316 along the metric slider bar 314 associated with the new metric. In one embodiment, adding a new metric and/or associating a new weight with the new metric can cause the computing device to recalculate the overall scores for each of the locations and update the map display.


Timeline slider bar 320 may be used to select a date or date range from which data pertaining to the selected metrics should be collected. Accordingly, timeline slider bar 320 includes a date indicator 325 for selecting a date or date range. In the exemplary interface shown in FIG. 3, the selected date or year is 2015. Thus, the data used to determine the desirability of the locations displayed in map 370 will be the data collected pertaining to the selected metrics in 2015. In one embodiment, if a user selects a new date or date range, such as by moving date indicator 325 to a different location on timeline slider bar 320, the computing device will recalculate the scores for each metric based on data from the new date or date range, reapply the weights, recalculate the overall weighted scores for each location, and update the map display.


Interface 300 also includes a table view button 330 and legend 340. A user may select table view button 330 to change the current view of the displayed location information from the map view (shown in FIG. 3) to the table view (shown in FIG. 4). Legend 340 explains the meaning of the color-coding scheme used in map 370. For example, in FIG. 3, legend 340 indicates that less desirable locations are lightly shaded and more desirable locations are more heavily shaded.


Score display 350 may display the raw (i.e., unweighted) scores for each of the locations for a selected location. Score display 350 may include metric names 352, scores 354, and characteristics 356. In one embodiment, score display 350 may display data pertaining to the same metrics as selected and displayed via metric selector 310. Thus, metric names 352 may be the same as metric names 312. Characteristics may identify the characteristics according to which the scores 354 were determined for each of metrics 312. In the exemplary interface shown in FIG. 3, the score display 350 indicates that the school ratings score is based on graduation rates, the median income score is based on household income and the average home price is based on the median price of new homes. Scores 354 display the scores for a selected location associated with each metric 352. In one embodiment, scores 354 may be scaled (e.g., to a value between 0 and 100), such that they may be more easily weighed and analyzed with one another. For example, a median income of $63,920 may be converted to a score of 64/100 by multiplying the median income by 0.001. Alternatively, scores 354 may be scaled by converting them to their percentile rank among all locations within a displayed region or all possible locations. In one embodiment (not shown), scores 354 may include two indicators (e.g., along a bar): one for the unweighted score for a metric and another for the weighted score for the metric.


Statistics display 360 may display the name of a selected location and several statistics corresponded to the selected location. In one embodiment, the displayed statistics may include each of the metrics selected by the user. The displayed statistics may also include addition (e.g., default) statistics. In one embodiment, the user may determine which statistics are displayed in statistics display 360, including which statistics are displayed by default and whether all metrics currently under evaluation should be displayed. In the exemplary interface shown in FIG. 3, each of the selected metrics (i.e., school ratings, median income, and average home price) is displayed in statistics display 360, along with two addition metrics—population and percentage of population below the poverty line.


Map 370 displays a map corresponding to one or more of the analyzed locations. In one embodiment, map 370 includes a region comprising all locations being analyzed. In another embodiment, map 370 may display only a subset of the locations being analyzed (e.g., if the user zooms in on one or more locations). In one embodiment, each of the locations is color-coded based on the overall weighted or unweighted score of the location. Moreover, in one embodiment, if a user selects one of the locations (e.g., by clicking on the map), the computing device can update score display 350 and statistics display 360 to reflect the scores and statistics, respectively, for the selected location. The computing device can also update map 370, score display 350, and statistics display 360 in response to the user adding/removing a metric, adjusting the weight of a metric, or adjusting the selected date.



FIG. 4 illustrates another exemplary user interface 400, consistent with embodiment of the present disclosure. User interface 400 illustrates another example of a display that can be generated by the computing device (e.g., computing device 110) for viewing on a device (e.g., display 112) by a user. Interface 400 can assist a user to view metric data for various locations in a consolidated table. As shown in FIG. 4, interface 400 may include a metric selector 410, timeline slider bar 420, graph 430, map view button 440, export button 450, graph 460, and order buttons 470. Each of these elements are described in greater detail below. It will be understood from this disclosure that the number and arrangement of these elements is exemplary and that modifications can be made, consistent with the present disclosure.


Metric selector 410 may include the same components and provide the same functionality as metric selector 310. In one embodiment, if a user adds a new metric or adjusts the weight of an existing metric using metric selector 410, table 460 may be updated to reflect the new metric or new weighted total score. Timeline slider bar 420 may include the same components and provide the same functionality as timeline slider bar 320. In one embodiment, if a user adjusts the date indicator on timeline slider bar 420, graph 430 and table 460 may be updated to reflect the data for the selected date or date range. Graph 430 may display data for one or more locations corresponding to a selected metric in graph format.


A user may select the map view button 440 to cause the computing device to display interface 300. A user may select the export button 450 to cause the computing device to export the data displayed in table 460. For example, the computing device can export the data displayed in table 460 to a workbook (i.e., spreadsheet) format, comma-separated value format, text format, or any other format appropriate for the display of table data.


Table 460 may display consolidated data for one or more metrics and locations. In the example shown in FIG. 4, table 460 displays data corresponding to three selected metrics (i.e., school ratings, median income, and average home price) for four metropolitan Atlanta counties. Each of the metrics is further broken into an unweighted score for the characteristic(s) according to which the metric is being analyzed, raw characteristic value(s) (i.e., values for graduation rate, income, and price), and a rank. In one embodiment, the raw characteristic value is the value corresponding to a characteristic according to which the metric is analyzed, which may be based on a user selection, as discussed above. The score for each metric may be computed based on the raw characteristic value(s). In one embodiment, the score and the raw characteristic value(s) for a metric may be the same, such as when there is only one raw characteristic value and it is based on a scale of 0-100. In another embodiment, the raw characteristic value(s) may be averaged and/or scaled to a value between 0-100 to determine the score, such as by multiplying each raw characteristic value for a metric by the same factor. The rank may indicate the rank of a location for the metric.


In one embodiment, table 460 includes a total unweighted score and a total weighted score for each location. The total unweighted score may include the sum of the unweighted scores (i.e., the displayed scores) for each metric. The total weighted score may include the sum of the weighted scores (not displayed) for each metric, each of which may be calculated by multiplying the unweighted score for the metric by a factor set using metric selector 410. In one embodiment, the information displayed in table 460 may be ordered by location, a metric, total unweighted score, or total weighted score. The user may select the value on which ordering is based using order buttons 470. In the example shown in FIG. 4, the information displayed in table 460 is ordered alphabetically by location.


Embodiments of the present disclosure have been described herein with reference to numerous specific details that can vary from implementation to implementation. Certain adaptations and modifications of the described embodiments can be made. Other embodiments can be apparent to those skilled in the art from consideration of the specification and practice of the embodiments disclosed herein. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the present disclosure being indicated by the following claims. It is also intended that the sequence of steps shown in figures are only for illustrative purposes and are not intended to be limited to any particular sequence of steps. As such, it is appreciated that these steps can be performed in a different order while implementing the exemplary methods or processes disclosed herein.

Claims
  • 1. A computer-implemented system for data management and visualization, comprising: one or more computer-readable storage media that store instructions; andone or more processors that execute the instructions to configure the one or more processors to: provide an interactive user interface to a user device;receive, via the interactive user interface, selections of at least: a first metric;a first weight associated with the first metric;a second metric; anda second weight associated with the second metric;access one or more data sources storing: first data related to the first metric, including indications of the first metric associated with each of a plurality of locations; andsecond data related to the second metric, including indications of the second metric associated with each of the plurality of locations;calculate an overall score for at least one of the plurality of locations based in part on the first weight applied to first data associated with the location;the second weight applied to second data associated with the location; andupdate the interactive user interface with an indication of at least one of the calculated overall scores.
  • 2. The system of claim 1, wherein each of the plurality of locations is associated with a geographical unit type selected from: a zip code, a school district, a city, a county, a congressional district, a state, and a country.
  • 3. The system of claim 2, wherein the one or more processors are further configured to execute the instructions to: receive an identification of a geographical unit type,wherein the plurality of locations are of the identified geographical unit type.
  • 4. The system of claim 1, wherein the calculated overall scores for locations are sums of weighted first scores and weighted second scores for each location.
  • 5. The system of claim 4, wherein the one or more processors are further configured to execute the instructions to: receive an identification of a characteristic for evaluating at least one of the first or second metrics; andcalculate the overall score for the at least one metric based on the identified characteristic.
  • 6. The system of claim 4, wherein the one or more processors are further configured to execute the instructions to: modify the weight associated with at least one of the metrics; andfor the at least one of the plurality of locations: apply the modified weight to the score for the at least one of the metrics; andrecalculate the overall score based on the weighted scores.
  • 7. The system of claim 1, wherein the one or more processors are further configured to execute the instructions to: receive, based on input from the user, an identification of a date range; andcalculate the overall score based on data pertaining to the first and second metrics for the identified date range.
  • 8. The system of claim 7, wherein the one or more processors are further configured to execute the instructions to: receive an identification of a modified date range; andfor each of the plurality of locations: calculate a modified score for the first metric and the second metric based on data pertaining to the modified date range;apply to the modified score for each metric the associated weight; andcalculate a modified overall score based on the weighted modified scores.
  • 9. The system of claim 1, wherein the interactive user interface includes a map comprising a representation of the overall score for the at least one location on the map.
  • 10. The system of claim 1, wherein the user interface includes a table comprising a representation of the overall score for the at least one location.
  • 11. The system of claim 1, wherein the one or more processors are further configured to execute the instructions to: receive, based on input from the user, selection of a third metric and an additional third weight to assign to the third metric; andfor the at least one of the plurality of locations: calculate a score for the third metric;apply to the score for the third metric the third weight; andrecalculate the overall score based on the weighted third score for the location.
  • 12. A computer-implemented method performed by one or more processors, the method comprising: providing an interactive user interface to a user device;receiving, via the interactive user interface, selections of at least: a first metric;a first weight associated with the first metric;a second metric; anda second weight associated with the second metric;accessing one or more data sources storing: first data related to the first metric, including indications of the first metric associated with each of a plurality of locations; andsecond data related to the second metric, including indications of the second metric associated with each of the plurality of locations;calculating an overall score for at least one of the plurality of locations based in part on the first weight applied to first data associated with the location, andthe second weight applied to second data associated with the location; andupdating the interactive user interface with indications of at least some of the calculated overall scores.
  • 13. The method of claim 12, further comprising presenting, as part of the interactive user interface, a map comprising a representation of the overall score for each location.
  • 14. The method of claim 12, further comprising presenting, as part of the interactive user interface, a table comprising a representation of the overall score for each location.
  • 15. A non-transitory computer-readable medium storing a set of instructions that are executable by one or more processors to cause the one or more processors to perform operations comprising: providing an interactive user interface to a user device;receiving, via the interactive user interface, selections of at least: a first metric;a first weight associated with the first metric;a second metric; anda second weight associated with the second metric;accessing one or more data sources storing: first data related to the first metric, including indications of the first metric associated with each of a plurality of locations; andsecond data related to the second metric, including indications of the second metric associated with each of the plurality of locations;calculating an overall score for at least one of the plurality of locations based in part on the first weight applied to first data associated with the location, andthe second weight applied to second data associated with the location; andupdating the interactive user interface with indications of at least some of the calculated overall scores.
  • 16. The non-transitory computer-readable medium of claim 15, wherein the interactive user interface comprises a map comprising a representation of the overall score for the at least one location.
  • 17. The non-transitory computer-readable medium of claim 15, the interactive user interface comprises a table comprising a representation of the overall score for the at least one each location.
CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of and claims priority to U.S. patent application Ser. No. 14/929,584, which was filed on Nov. 2, 2015 (now allowed), which claims priority to U.S. Provisional Patent Application No. 62/214,840, which was filed on Sep. 4, 2015. The disclosures of the above-identified related applications are expressly incorporated herein by reference in their entireties.

US Referenced Citations (416)
Number Name Date Kind
4899161 Morin et al. Feb 1990 A
4958305 Piazza Sep 1990 A
5329108 Lamoure Jul 1994 A
5754182 Kobayashi May 1998 A
5781195 Marvin Jul 1998 A
5781704 Rossmo Jul 1998 A
6091956 Hollenberg Jul 2000 A
6157747 Szeliski et al. Dec 2000 A
6169552 Endo et al. Jan 2001 B1
6173067 Payton et al. Jan 2001 B1
6178432 Cook et al. Jan 2001 B1
6247019 Davies Jun 2001 B1
6389289 Voce et al. May 2002 B1
6414683 Gueziec Jul 2002 B1
6430305 Decker Aug 2002 B1
6483509 Rabenhorst Nov 2002 B1
6529900 Patterson et al. Mar 2003 B1
6631496 Li et al. Oct 2003 B1
6662103 Skolnick et al. Dec 2003 B1
6757445 Knopp Jun 2004 B1
6820135 Dingman Nov 2004 B1
6828920 Owen et al. Dec 2004 B2
6978419 Kantrowitz Dec 2005 B1
6980984 Huffman et al. Dec 2005 B1
6983203 Wako Jan 2006 B1
6985950 Hanson et al. Jan 2006 B1
7036085 Barros Apr 2006 B2
7158878 Rasmussen et al. Jan 2007 B2
7168039 Bertram Jan 2007 B2
7375732 Arcas May 2008 B2
7379811 Rasmussen et al. May 2008 B2
7457706 Malero et al. Nov 2008 B2
7461077 Greenwood Dec 2008 B1
7502786 Liu et al. Mar 2009 B2
7519470 Brasche et al. Apr 2009 B2
7529195 Gorman May 2009 B2
7539666 Ashworth et al. May 2009 B2
7558677 Jones Jul 2009 B2
7574428 Leiserowitz et al. Aug 2009 B2
7579965 Bucholz Aug 2009 B2
7617232 Gabbert et al. Nov 2009 B2
7617314 Bansod et al. Nov 2009 B1
7620628 Kapur et al. Nov 2009 B2
7663621 Allen et al. Feb 2010 B1
7756843 Palmer Jul 2010 B1
7791616 Loup et al. Sep 2010 B2
7805457 Viola et al. Sep 2010 B1
7809703 Balabhadrapatruni et al. Oct 2010 B2
7872647 Mayer et al. Jan 2011 B2
7894984 Rasmussen et al. Feb 2011 B2
7899611 Downs et al. Mar 2011 B2
7917376 Bellin et al. Mar 2011 B2
7920963 Jouline et al. Apr 2011 B2
7941321 Greenstein et al. May 2011 B2
7945852 Pilskains May 2011 B1
7962281 Rasmussen et al. Jun 2011 B2
7970240 Chao et al. Jun 2011 B1
8010545 Stefik et al. Aug 2011 B2
8036632 Cona et al. Oct 2011 B1
8036971 Aymeloglu et al. Oct 2011 B2
8037046 Udezue et al. Oct 2011 B2
8046283 Burns Oct 2011 B2
8054756 Chand et al. Nov 2011 B2
8065080 Koch Nov 2011 B2
8085268 Carrino et al. Dec 2011 B2
8134457 Velipasalar et al. Mar 2012 B2
8145703 Frishert et al. Mar 2012 B2
8200676 Frank Jun 2012 B2
8214361 Sandler et al. Jul 2012 B1
8214490 Vos et al. Jul 2012 B1
8214764 Gemmell et al. Jul 2012 B2
8229902 Vishniac et al. Jul 2012 B2
8229947 Fujinaga Jul 2012 B2
8230333 Decherd et al. Jul 2012 B2
8290838 Thakur et al. Oct 2012 B1
8290942 Jones et al. Oct 2012 B2
8290943 Carbone et al. Oct 2012 B2
8301464 Cave et al. Oct 2012 B1
8302855 Ma et al. Nov 2012 B2
8325178 Doyle, Jr. Dec 2012 B1
8368695 Howell et al. Feb 2013 B2
8386377 Xiong et al. Feb 2013 B1
8397171 Klassen et al. Mar 2013 B2
8400448 Doyle, Jr. Mar 2013 B1
8407180 Ramesh et al. Mar 2013 B1
8412234 Gatmir-Motahari et al. Apr 2013 B1
8412707 Mianji Apr 2013 B1
8422825 Neophytou et al. Apr 2013 B1
8452790 Mianji May 2013 B1
8463036 Ramesh et al. Jun 2013 B1
8473454 Evanitsky et al. Jun 2013 B2
8484115 Aymeloglu et al. Jul 2013 B2
8489331 Kopf et al. Jul 2013 B2
8489641 Seefeld et al. Jul 2013 B1
8498984 Hwang et al. Jul 2013 B1
8508533 Cervelli et al. Aug 2013 B2
8514229 Cervelli et al. Aug 2013 B2
8515207 Chau Aug 2013 B2
8564596 Carrino et al. Oct 2013 B2
8577911 Stepinski et al. Nov 2013 B1
8589273 Creeden et al. Nov 2013 B2
8688573 Ruknoic et al. Apr 2014 B1
8742934 Sarpy et al. Jun 2014 B1
8744890 Bernier Jun 2014 B1
8781169 Jackson et al. Jul 2014 B2
8799799 Cervelli et al. Aug 2014 B1
8806355 Twiss et al. Aug 2014 B2
8812960 Sun et al. Aug 2014 B1
8830322 Nerayoff et al. Sep 2014 B2
8924388 Elliot et al. Dec 2014 B2
8924389 Elliot et al. Dec 2014 B2
8938686 Erenrich et al. Jan 2015 B1
8949164 Mohler Feb 2015 B1
8983494 Onnen et al. Mar 2015 B1
9009177 Zheng et al. Apr 2015 B2
9021384 Beard et al. Apr 2015 B1
9069842 Melby Jun 2015 B2
9100428 Visbal Aug 2015 B1
9104293 Kornfeld et al. Aug 2015 B1
9104695 Cervelli et al. Aug 2015 B1
9111281 Stibel et al. Aug 2015 B2
9111380 Piemonte et al. Aug 2015 B2
9129219 Robertson et al. Sep 2015 B1
9146125 Vulcano et al. Sep 2015 B2
9256664 Chakerian et al. Feb 2016 B2
9280618 Bruce et al. Mar 2016 B1
9639580 Xing May 2017 B1
20020003539 Abe Jan 2002 A1
20020033848 Sciammarella et al. Mar 2002 A1
20020065708 Senay et al. May 2002 A1
20020095360 Joao Jul 2002 A1
20020095658 Shulman Jul 2002 A1
20020103705 Brady Aug 2002 A1
20020116120 Ruiz et al. Aug 2002 A1
20020130867 Yang et al. Sep 2002 A1
20020130906 Miyaki Sep 2002 A1
20020147805 Leshem et al. Oct 2002 A1
20030052896 Higgins et al. Mar 2003 A1
20030103049 Kindratenko et al. Jun 2003 A1
20030126102 Borthwick Jul 2003 A1
20030144868 MacIntyre et al. Jul 2003 A1
20030163352 Surpin et al. Aug 2003 A1
20030225755 Iwayama et al. Dec 2003 A1
20040030492 Fox et al. Feb 2004 A1
20040034570 Davis Feb 2004 A1
20040039498 Ollis et al. Feb 2004 A1
20040098236 Mayer et al. May 2004 A1
20040111480 Yue Jun 2004 A1
20040153418 Hanweck Aug 2004 A1
20040236688 Bozeman Nov 2004 A1
20050010472 Quatse et al. Jan 2005 A1
20050031197 Knopp Feb 2005 A1
20050034062 Bufkin et al. Feb 2005 A1
20050080769 Gemmell Apr 2005 A1
20050086207 Heuer et al. Apr 2005 A1
20050143602 Yada et al. Jun 2005 A1
20050154628 Eckart et al. Jul 2005 A1
20050154769 Eckart et al. Jul 2005 A1
20050162523 Darrell et al. Jul 2005 A1
20050182502 Iyengar Aug 2005 A1
20050182793 Keenan et al. Aug 2005 A1
20050223044 Ashworth et al. Oct 2005 A1
20050267652 Allstadt et al. Dec 2005 A1
20060026120 Carolan et al. Feb 2006 A1
20060026170 Kreitler et al. Feb 2006 A1
20060080283 Shipman Apr 2006 A1
20060139375 Rasmussen et al. Jun 2006 A1
20060143034 Rothermel Jun 2006 A1
20060143075 Carr et al. Jun 2006 A1
20060143079 Basak et al. Jun 2006 A1
20060146050 Yamauchi Jul 2006 A1
20060149596 Surpin et al. Jul 2006 A1
20060200384 Arutunian et al. Sep 2006 A1
20060251307 Florin et al. Nov 2006 A1
20060259527 Devarakonda et al. Nov 2006 A1
20060271277 Hu et al. Nov 2006 A1
20060279630 Aggarwal et al. Dec 2006 A1
20070000999 Kubo et al. Jan 2007 A1
20070011150 Frank Jan 2007 A1
20070011304 Error Jan 2007 A1
20070016363 Huang et al. Jan 2007 A1
20070024620 Muller-Fischer et al. Feb 2007 A1
20070038646 Thota Feb 2007 A1
20070057966 Ohno et al. Mar 2007 A1
20070078832 Ott et al. Apr 2007 A1
20070115373 Gallagher et al. May 2007 A1
20070150801 Chidlovskii et al. Jun 2007 A1
20070156673 Maga Jul 2007 A1
20070162454 D'Albora et al. Jul 2007 A1
20070185867 Maga Aug 2007 A1
20070188516 Loup et al. Aug 2007 A1
20070192122 Routson et al. Aug 2007 A1
20070208497 Downs et al. Sep 2007 A1
20070208498 Barker et al. Sep 2007 A1
20070239871 Kaskie Oct 2007 A1
20070258642 Thota Nov 2007 A1
20070284433 Domenica et al. Dec 2007 A1
20070294643 Kyle Dec 2007 A1
20080010605 Frank Jan 2008 A1
20080040684 Crump Feb 2008 A1
20080065655 Chakravarthy et al. Mar 2008 A1
20080077642 Carbone et al. Mar 2008 A1
20080082578 Hogue et al. Apr 2008 A1
20080098085 Krane et al. Apr 2008 A1
20080104019 Nath May 2008 A1
20080133579 Lim Jun 2008 A1
20080163073 Becker et al. Jul 2008 A1
20080192053 Howell et al. Aug 2008 A1
20080195417 Surpin et al. Aug 2008 A1
20080208735 Balet et al. Aug 2008 A1
20080222295 Robinson et al. Sep 2008 A1
20080223834 Griffiths et al. Sep 2008 A1
20080229056 Agarwal et al. Sep 2008 A1
20080255973 El Wade et al. Oct 2008 A1
20080263468 Cappione et al. Oct 2008 A1
20080267107 Rosenberg Oct 2008 A1
20080270468 Mao Oct 2008 A1
20080278311 Grange et al. Nov 2008 A1
20080288306 MacIntyre et al. Nov 2008 A1
20080294663 Heinley et al. Nov 2008 A1
20080294678 Gorman et al. Nov 2008 A1
20080301643 Appleton et al. Dec 2008 A1
20080313132 Hao et al. Dec 2008 A1
20090027418 Maru et al. Jan 2009 A1
20090088964 Schaaf et al. Apr 2009 A1
20090094270 Alirez et al. Apr 2009 A1
20090100018 Roberts Apr 2009 A1
20090106178 Chu Apr 2009 A1
20090112745 Stefanescu Apr 2009 A1
20090115786 Shmiasaki et al. May 2009 A1
20090125359 Knapic May 2009 A1
20090125459 Norton et al. May 2009 A1
20090132921 Hwangbo et al. May 2009 A1
20090132953 Reed et al. May 2009 A1
20090144262 White et al. Jun 2009 A1
20090157732 Hao et al. Jun 2009 A1
20090158185 Lacevic et al. Jun 2009 A1
20090171939 Athsani et al. Jul 2009 A1
20090172511 Decherd et al. Jul 2009 A1
20090179892 Tsuda et al. Jul 2009 A1
20090187447 Cheng et al. Jul 2009 A1
20090187464 Bai et al. Jul 2009 A1
20090187546 Whyte et al. Jul 2009 A1
20090187548 Ji et al. Jul 2009 A1
20090222400 Kupershmidt et al. Sep 2009 A1
20090249244 Robinson et al. Oct 2009 A1
20090254842 Leacock et al. Oct 2009 A1
20090271343 Vaiciulis et al. Oct 2009 A1
20090292626 Oxford Nov 2009 A1
20090307049 Elliott et al. Dec 2009 A1
20090313463 Pang et al. Dec 2009 A1
20090319418 Herz Dec 2009 A1
20090319891 MacKinlay Dec 2009 A1
20100030722 Goodson et al. Feb 2010 A1
20100031141 Summers et al. Feb 2010 A1
20100042922 Bradateanu et al. Feb 2010 A1
20100057622 Faith et al. Mar 2010 A1
20100057716 Stefik et al. Mar 2010 A1
20100063961 Guiheneuf et al. Mar 2010 A1
20100070523 Delgo et al. Mar 2010 A1
20100070842 Aymeloglu et al. Mar 2010 A1
20100076968 Boyns et al. Mar 2010 A1
20100098318 Anderson Apr 2010 A1
20100106420 Mattikalli et al. Apr 2010 A1
20100106752 Eckardt et al. Apr 2010 A1
20100114887 Conway et al. May 2010 A1
20100131502 Fordham May 2010 A1
20100161735 Sharma Jun 2010 A1
20100162176 Dunton Jun 2010 A1
20100185692 Zhang et al. Jul 2010 A1
20100191563 Schlaifer et al. Jul 2010 A1
20100198684 Eraker et al. Aug 2010 A1
20100199225 Coleman et al. Aug 2010 A1
20100211535 Rosenberger Aug 2010 A1
20100235915 Memon et al. Sep 2010 A1
20100262688 Hussain et al. Oct 2010 A1
20100277611 Holt et al. Nov 2010 A1
20100293174 Bennett et al. Nov 2010 A1
20100312837 Bodapati et al. Dec 2010 A1
20100321399 Ellren et al. Dec 2010 A1
20110022312 McDonough et al. Jan 2011 A1
20110061013 Bilicki et al. Mar 2011 A1
20110078173 Seligmann et al. Mar 2011 A1
20110090254 Carrino et al. Apr 2011 A1
20110093327 Fordyce, III et al. Apr 2011 A1
20110099133 Chang et al. Apr 2011 A1
20110117878 Barash et al. May 2011 A1
20110137766 Rasmussen et al. Jun 2011 A1
20110153368 Pierre et al. Jun 2011 A1
20110153384 Horne et al. Jun 2011 A1
20110161096 Buehler et al. Jun 2011 A1
20110170799 Carrino et al. Jul 2011 A1
20110173093 Psota et al. Jul 2011 A1
20110208565 Ross et al. Aug 2011 A1
20110208724 Jones et al. Aug 2011 A1
20110213655 Henkin Sep 2011 A1
20110218934 Elser Sep 2011 A1
20110218955 Tang Sep 2011 A1
20110225198 Edwards et al. Sep 2011 A1
20110238690 Arrasvuori et al. Sep 2011 A1
20110270604 Qi et al. Nov 2011 A1
20110270705 Parker Nov 2011 A1
20110270834 Sokolan et al. Nov 2011 A1
20110289397 Eastmond et al. Nov 2011 A1
20110295649 Fine Dec 2011 A1
20110314007 Dassa et al. Dec 2011 A1
20110314024 Chang et al. Dec 2011 A1
20120004904 Shin et al. Jan 2012 A1
20120011238 Rathod Jan 2012 A1
20120011245 Gillette et al. Jan 2012 A1
20120022945 Falkenborg et al. Jan 2012 A1
20120054284 Rakshit Mar 2012 A1
20120059853 Jagota Mar 2012 A1
20120066166 Curbera et al. Mar 2012 A1
20120066296 Appleton et al. Mar 2012 A1
20120079363 Folting et al. Mar 2012 A1
20120084117 Tavares et al. Apr 2012 A1
20120084118 Bai et al. Apr 2012 A1
20120084287 Lakshminarayan et al. Apr 2012 A1
20120106801 Jackson May 2012 A1
20120131512 Takeuchi et al. May 2012 A1
20120144335 Abeln et al. Jun 2012 A1
20120158527 Cannelongo et al. Jun 2012 A1
20120159362 Brown et al. Jun 2012 A1
20120159363 DeBacker et al. Jun 2012 A1
20120173381 Smith Jul 2012 A1
20120173985 Peppel Jul 2012 A1
20120206469 Hulubei et al. Aug 2012 A1
20120208636 Feige Aug 2012 A1
20120215784 King et al. Aug 2012 A1
20120221553 Wittmer et al. Aug 2012 A1
20120221580 Barney Aug 2012 A1
20120226523 Weiss Sep 2012 A1
20120245976 Kumar et al. Sep 2012 A1
20120323888 Osann, Jr. Dec 2012 A1
20130006725 Simanek et al. Jan 2013 A1
20130016106 Yip et al. Jan 2013 A1
20130021445 Cossette-Pacheco et al. Jan 2013 A1
20130054306 Bhalla Feb 2013 A1
20130057551 Ebert et al. Mar 2013 A1
20130060786 Serrano et al. Mar 2013 A1
20130073377 Heath Mar 2013 A1
20130076732 Cervelli et al. Mar 2013 A1
20130096988 Grossman et al. Apr 2013 A1
20130100134 Cervelli et al. Apr 2013 A1
20130101159 Chao et al. Apr 2013 A1
20130110746 Ahn May 2013 A1
20130132398 Pfiefle May 2013 A1
20130150004 Rosen Jun 2013 A1
20130151453 Bhanot et al. Jun 2013 A1
20130166348 Scotto Jun 2013 A1
20130166480 Popescu et al. Jun 2013 A1
20130176321 Mitchell et al. Jul 2013 A1
20130179420 Park et al. Jul 2013 A1
20130185245 Anderson Jul 2013 A1
20130185307 El-Yaniv et al. Jul 2013 A1
20130226318 Procyk Aug 2013 A1
20130238616 Rose et al. Sep 2013 A1
20130246170 Gross et al. Sep 2013 A1
20130246537 Gaddala Sep 2013 A1
20130246597 Iizawa et al. Sep 2013 A1
20130254900 Sathish et al. Sep 2013 A1
20130263019 Castellanos et al. Oct 2013 A1
20130268520 Fisher et al. Oct 2013 A1
20130279757 Kephart Oct 2013 A1
20130282696 John et al. Oct 2013 A1
20130282723 Petersen et al. Oct 2013 A1
20130290825 Arndt et al. Oct 2013 A1
20130297619 Chandrasekaran et al. Nov 2013 A1
20130304770 Boero et al. Nov 2013 A1
20130339891 Blumenberg et al. Dec 2013 A1
20140012796 Petersen et al. Jan 2014 A1
20140040371 Gurevich et al. Feb 2014 A1
20140058914 Song et al. Feb 2014 A1
20140068487 Steiger et al. Mar 2014 A1
20140095509 Patton Apr 2014 A1
20140108380 Gotz et al. Apr 2014 A1
20140108985 Scott et al. Apr 2014 A1
20140123279 Bishop et al. May 2014 A1
20140136285 Carvalho May 2014 A1
20140143009 Brice et al. May 2014 A1
20140156527 Grigg et al. Jun 2014 A1
20140157172 Peery et al. Jun 2014 A1
20140164502 Khodorenko et al. Jun 2014 A1
20140176606 Narayan et al. Jun 2014 A1
20140189536 Lange et al. Jul 2014 A1
20140195515 Baker et al. Jul 2014 A1
20140218400 O'Toole et al. Aug 2014 A1
20140222521 Chait Aug 2014 A1
20140222793 Sadkin et al. Aug 2014 A1
20140229554 Grunin et al. Aug 2014 A1
20140333651 Cervelli et al. Nov 2014 A1
20140337772 Cervelli et al. Nov 2014 A1
20140344230 Krause et al. Nov 2014 A1
20140358829 Hurwitz Dec 2014 A1
20140361899 Layson Dec 2014 A1
20140366132 Stiansen et al. Dec 2014 A1
20150029176 Baxter et al. Jan 2015 A1
20150073929 Psota et al. Mar 2015 A1
20150073954 Braff Mar 2015 A1
20150095773 Gonsalves et al. Apr 2015 A1
20150100897 Sun et al. Apr 2015 A1
20150100907 Erenrich et al. Apr 2015 A1
20150106170 Bonica Apr 2015 A1
20150106379 Elliot et al. Apr 2015 A1
20150134599 Banerjee et al. May 2015 A1
20150135256 Hoy et al. May 2015 A1
20150186821 Wang et al. Jul 2015 A1
20150187036 Wang et al. Jul 2015 A1
20150187100 Berry et al. Jul 2015 A1
20150188872 White Jul 2015 A1
20150242401 Liu Aug 2015 A1
20150312323 Peterson Oct 2015 A1
20150338233 Cervelli et al. Nov 2015 A1
20150379413 Robertson et al. Dec 2015 A1
20160004764 Chakerian et al. Jan 2016 A1
Foreign Referenced Citations (30)
Number Date Country
2012216622 May 2015 AU
102546446 Jul 2012 CN
103167093 Jun 2013 CN
102054015 May 2014 CN
102014204827 Sep 2014 DE
102014204830 Sep 2014 DE
102014204834 Sep 2014 DE
102013222023 Jan 2015 DE
0763201 Mar 1997 EP
2487610 Aug 2012 EP
2575107 Apr 2013 EP
2858014 Apr 2015 EP
2858018 Apr 2015 EP
2869211 May 2015 EP
2889814 Jul 2015 EP
2892197 Jul 2015 EP
2963595 Jan 2016 EP
2516155 Jan 2015 GB
2012778 Nov 2014 NL
624557 Dec 2014 NZ
WO 1995032424 Nov 1995 WO
WO 2000009529 Feb 2000 WO
WO 2001098925 Dec 2001 WO
WO 2004057268 Jul 2004 WO
WO 2005013200 Feb 2005 WO
WO 2005116851 Dec 2005 WO
WO 2008064207 May 2008 WO
WO 2009061501 May 2009 WO
WO 2009123975 Oct 2009 WO
WO 2011058507 May 2011 WO
Non-Patent Literature Citations (190)
Entry
“A First Look: Predicting Market Demand for Food Retail using a Huff Analysis,” TRF Policy Solutions, Jul. 2012, pp. 30.
“Andy Turner's GISRUK 2012 Notes” <https://docs.google.com/document/d/1cTmxg7mVx5gd89lqblCYvCEnHA4QAivH4l4WpyPsqE4/edit?pli=1> printed Sep. 16, 2013 in 15 pages.
Amnet, “5 Great Tools for Visualizing Your Twitter Followers,” posted Aug. 4, 2010, http://www.amnetblog.com/component/content/article/115-5-grate-tools-for-visualizing-your-twitter-followers.html.
Appacts, “Smart Thinking for Super Apps,” <http://www.appacts.com> Printed Jul. 18, 2013 in 4 pages.
Apsalar, “Data Powered Mobile Advertising,” “Free Mobile App Analytics” and various analytics related screen shots <http://apsalar.com> Printed Jul. 18, 2013 in 8 pages.
Barnes et al., “Viewshed Analysis”, GIS-ARC/INFO 2001, <www.evsc.virginia.edu/˜jhp7e/evsc466/student_pres/Rounds.pdf>.
Capptain—Pilot Your Apps, <http://www.capptain.com> Printed Jul. 18, 2013 in 6 pages.
Carver et al., “Real-Time Visibility Analysis and Rapid Viewshed Calculation Using a Voxel-Based Modelling Approach,” GISRUK 2012 Conference, Apr. 11-13, Lancaster UK, Apr. 13, 2012, pp. 6.
Celik, Tantek, “CSS Basic User Interface Module Level 3 (CSS3 UI),” Section 8 Resizing and Overflow, Jan. 17, 2012, retrieved from internet http://www.w3.org/TR/2012/WD-css3-ui-20120117/#resizing-amp-overflow retrieved on May 18, 2015.
Chaudhuri et al., “An Overview of Business Intelligence Technology,” Communications of the ACM, Aug. 2011, vol. 54, No. 8.
Chen et al., “Bringing Order to the Web: Automatically Categorizing Search Results,” CHI 2000, Proceedings of the SIGCHI conference on Human Factors in Computing Systems, Apr. 1-6, 2000, The Hague, The Netherlands, pp. 145-152.
Cohn, et al., “Semi-supervised clustering with user feedback,” Constrained Clustering: Advances in Algorithms, Theory, and Applications 4.1 (2003): 17-32.
Countly Mobile Analytics, <http://count.ly/> Printed Jul. 18, 2013 in 9 pages.
Definition “Identify”, downloaded Jan. 22, 2015, 1 page.
Definition “Overlay”, downloaded Jan. 22, 2015, 1 page.
DISTIMO—App Analytics, <http://www.distimo.com/app-analytics> Printed Jul. 18, 2013 in 5 pages.
Dramowicz, Ela, “Retail Trade Area Analysis Using the Huff Model,” Directions Magazine, Jul. 2, 2005 in 10 pages, http://www.directionsmag.com/articles/retail-trade-area-analysis-using-the-huff-model/123411.
Flurry Analytics, <http://www.flurry.com/> Printed Jul. 18, 2013 in 14 pages.
Ghosh, P., “A Solution of Polygon Containment, Spatial Planning, and Other Related Problems Using Minkowski Operations,” Computer Vision, Graphics, and Image Processing, 1990, vol. 49, pp. 1-35.
GIS-NET 3 Public_ Department of Regional Planning. Planning & Zoning Information for Unincorporated LA County. Retrieved Oct. 2, 2013 from http://gis.planning.lacounty.gov/GIS-NET3_Public/Viewer.html.
Google Analytics Official Website—Web Analytics & Reporting, <http://www.google.com/analytics.index.html> Printed Jul. 18, 2013 in 22 pages.
Gorr et al., “Crime Hot Spot Forecasting: Modeling and Comparative Evaluation”, Grant 98-IJ-CX-K005, May 6, 2002, 37 pages.
Griffith, Daniel A., “A Generalized Huff Model,” Geographical Analysis, Apr. 1982, vol. 14, No. 2, pp. 135-144.
Gu et al., “Record Linkage: Current Practice and Future Directions,” Jan. 15, 2004, pp. 32.
Hansen et al., “Analyzing Social Media Networks with NodeXL: Insights from a Connected World”, Chapter 4, pp. 53-67 and Chapter 10, pp. 143-164, published Sep. 2010.
Haralick et al., “Image Analysis Using Mathematical Morphology,” Pattern Analysis and Machine Intelligence, IEEE Transactions, Jul. 1987, vol. PAMI-9, No. 4, pp. 532-550.
Hibbert et al., “Prediction of Shopping Behavior Using a Huff Model Within a GIS Framework,” Healthy Eating in Context, Mar. 18, 2011, pp. 16.
Hua et al., “A Multi-attribute Data Structure with Parallel Bloom Filters for Network Services”, HiPC 2006, LNCS 4297, pp. 277-288, 2006.
Huang et al., “Systematic and Integrative Analysis of Large Gene Lists Using DAVID Bioinformatics Resources,” Nature Protocols, 4.1, 2008, 44-57.
Huff et al., “Calibrating the Huff Model Using ArcGIS Business Analyst,” ESRI, Sep. 2008, pp. 33.
Huff, David L., “Parameter Estimation in the Huff Model,” ESRI, ArcUser, Oct.-Dec. 2003, pp. 34-36.
“HunchLab: Heat Map and Kernel Density Calculation for Crime Analysis,” Azavea Journal, printed from www.azavea.com/blogs/newsletter/v4i4/kernel-density-capabilities-added-to-hunchlab/ on Sep. 9, 2014, 2 pages.
Ipbucker, C., “Inverse Transformation for Several Pseudo-cylindrical Map Projections Using Jacobian Matrix,” ICCSA 2009, Part 1 LNCS 5592, pp. 553-564.
Keylines.com, “An Introduction to KeyLines and Network Visualization,” Mar. 2014, <http://keylines.com/wp-content/uploads/2014/03/KeyLines-White-Paper.pdf> downloaded May 12, 2014 in 8 pages.
Keylines.com, “KeyLines Datasheet,” Mar. 2014, <http://keylines.com/wp-content/uploads/2014/03/KeyLines-datasheet.pdf> downloaded May 12, 2014 in 2 pages.
Keylines.com, “Visualizing Threats: Improved Cyber Security Through Network Visualization,” Apr. 2014, <http://keylines.com/wp-content/uploads/2014/04/Visualizing-Threats1.pdf> downloaded May 12, 2014 in 10 pages.
Kontagent Mobile Analytics, <http://www.kontagent.com/> Printed Jul. 18, 2013 in 9 pages.
Levine, N., “Crime Mapping and the Crimestat Program,” Geographical Analysis, 2006, vol. 38, pp. 41-56.
Liu, Tianshun, “Combining GIS and the Huff Model to Analyze Suitable Locations for a New Asian Supermarket in the Minneapolis and St. Paul, Minnesota USA,” Papers in Resource Analysis, 2012, vol. 14, pp. 8.
Localytics—Mobile App Marketing & Analytics, <http://www.localytics.com/> Printed Jul. 18, 2013 in 12 pages.
Mandagere, Nagapramod, “Buffer Operations in GIS,” <http://www-users.cs.umn.edu/˜npramod/enc_pdf.pdf> retrieved Jan. 28, 2010, pp. 7.
Manno et al., “Introducing Collaboration in Single-user Applications through the Centralized Control Architecture,” 2010, pp. 10.
Map Builder, “Rapid Mashup Development Tool for Google and Yahoo Maps!” <http://web.archive.org/web/20090626224734/http://www.mapbuilder.net/> printed Jul. 20, 2012 in 2 pages.
Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.yahoo.com.
Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.bing.com.
Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.google.com.
Mixpanel—Mobile Analytics, <https://mixpanel.com/> Printed Jul. 18, 2013 in 13 pages.
Murray, C., Oracle Spatial Developer's Guide—6 Coordinate Systems (Spatial Reference Systems), <http://docs.oracle.com/cd/B28359_01/appdev.111/b28400.pdf>, Jun. 2009.
Open Street Map, “Amm's Diary:Unconnected ways and other data quality issues,” http://www.openstreetmap.org/user/amm/diary printed Jul. 23, 2012 in 3 pages.
Open Web Analytics (OWA), <http://www.openwebanalytics.com/> Printed Jul. 19, 2013 in 5 pages.
Piwik—Free Web Analytics Software. <http://piwik.org/> Printed Jul. 19, 2013 in18 pages.
POI Editor, “How to: Create Your Own Points of Interest,” <http://www.poieditor.com/articles/how_to_create_your_own_points_of_interest/> printed Jul. 22, 2012.
Pozzi et al., “Vegetation and Population Density in Urban and Suburban Areas in the U.S.A.” Third International Symposium of Remote Sensing of Urban Areas Istanbul, Turkey, Jun. 2002, pp. 8.
Qiu, Fang, “3d Analysis and Surface Modeling”, <http://web.archive.org/web/20091202221925/http://www.utsa.edu/lrsg/Teaching/EES6513/08-3D.pdf> printed Sep. 16, 2013 in 26 pages.
Reddy et al., “Under the hood of GeoVRML 1.0,” SRI International, Proceedings of the fifth symposium on Vurtual Reality Modeling Language (Web3D-VRML), New York, NY, Feb. 2000, pp. 23-28. <http://pdf.aminer.org/000/648/038/under_the_hood_of geovrml.pdf>.
“Refresh CSS Ellipsis When Resizing Container—Stack Overflow,” Jul. 31, 2013, retrieved from internet http://stackoverflow.com/questions/17964681/refresh-css-ellipsis-when-resizing-container, retrieved on May 18, 2015.
Reibel et al., “Areal Interpolation of Population Counts Using Pre-classi_ed Land Cover Data,” Population Research and Policy Review, 2007, vol. 26, pp. 619-633.
Reibel, M., “Geographic Information Systems and Spatial Data Processing in Demography: a Review,” Population Research and Policy Review, 2007, vol. 26, pp. 601-618.
Rizzardi et al., “Interfacing U.S. Census Map Files with Statistical Graphics Software: Application and Use Epidemiology,” Statistics in Medicine, Oct. 1993, vol. 12, No. 19-20, pp. 1953-1964.
Sigrist, et al., “PROSITE, a Protein Domain Database for Functional Characterization and Annotation,” Nucleic Acids Research, 2010, vol. 38, pp. D161-D166.
Snyder, “Map Projections—A Working Manual,” U.S. Geological Survey Professional paper 1395, United States Government Printing Office, Washington: 1987, pp. 11-21 and 60-70.
Sonris, “Using the Area of Interest Tools,” <http://web.archive.org/web/20061001053327/http://sonris-www.dnr.state.la.us/gis/instruct_files/tutslide12> printed Jan. 3, 2013 in 1 page.
StatCounter—Free Invisible Web Tracker, Hit Counter and Web Stats, <http://statcounter.com/> Printed Jul. 19, 2013 in 17 pages.
Tangelder et al., “Freeform Shape Matching Using Minkowski Operations,” The Netherlands, Jun. 1996, pp. 12.
TestFlight—Beta Testing on the Fly, <http://testflightapp.com/> Printed Jul. 18, 2013 in 3 pages.
Thompson, Mick, “Getting Started with GEO,” Getting Started with GEO, Jul. 26, 2011.
trak.io, <http://trak.io/> printed Jul. 18, 2013 in 3 pages.
UserMetrix, <http://usermetrix.com/android-analytics> printed Jul. 18, 2013 in 3 pages.
Valentini et al., “Ensembles of Learning Machines”, M. Marinaro and R. Tagliaferri (Eds.): WIRN VIETRI 2002, LNCS 2486, pp. 3-20.
VB Forums, “Buffer A Polygon,” Internet Citation, <http://www.vbforums.com/showthread.php?198436-Buffer-a-Polygon>, Specifically Thread #1, #5 & #11 retrieved on May 2, 2013, pp. 8.
Vivid Solutions, “JTS Topology Suite: Technical Specifications,” <http://www.vividsolutions.com/jts/bin/JTS%20Technical%20Specs.pdf> Version 1.4, 2003, pp. 36.
Vose et al., “Help File for ModelRisk Version 5,” 2007, Vose Software, pp. 349-353. [Uploaded in 2 Parts].
Wang et al., “Research on a Clustering Data De-Duplication Mechanism Based on Bloom Filter,” IEEE 2010, 5 pages.
Wikipedia, “Douglas_Peucker-Algorithms,” <http://de.wikipedia.org/w/index.php?title=Douglas-Peucker-Algorithmus&oldid=91846042> printed Jul. 2011, pp. 2.
Wikipedia, “Multimap,” Jan. 1, 2013, https://en.wikipedia.org/w/index.php?title=Multimap&oldid=530800748.
Wikipedia, “Ramer_Douglas_Peucker Algorithm,” <http://en.wikipedia.org/wiki/Ramer%E2%80%93Douglas%E2%80%93Peucker_algorithm> printed Jul. 2011, pp. 3.
Wongsuphasawat et al., “Visual Analytics for Transportation Incident Data Sets,” Transportation Research Record 2138, 2009, pp. 135-145.
Woodbridge, Stephen, “[geos-devel] Polygon simplification,” <http://lists.osgeo.org/pipermail/geos-devel/2011-May/005210.html> dated May 8, 2011, pp. 3.
Notice of Acceptance for Australian Patent Application No. 2012216622 dated Jan. 6, 2015.
Notice of Allowance for U.S. Appl. No. 12/840,673 dated Apr. 6, 2015.
Notice of Allowance for U.S. Appl. No. 13/728,879 dated Jun. 21, 2016.
Notice of Allowance for U.S. Appl. No. 13/948,859 dated Dec. 10, 2014.
Notice of Allowance for U.S. Appl. No. 14/294,098 dated Dec. 29, 2014.
Notice of Allowance for U.S. Appl. No. 14/319,161 dated May 4, 2015.
Notice of Allowance for U.S. Appl. No. 14/323,935 dated Oct. 1, 2015.
Notice of Allowance for U.S. Appl. No. 14/479,863 dated Mar. 31, 2015.
Notice of Allowance for U.S. Appl. No. 14/552,336 dated Nov. 3, 2015.
Notice of Allowance for U.S. Appl. No. 14/730,123 dated Apr. 12, 2016.
Notice of Allowance for U.S. Appl. No. 14/746,671 dated Jan. 21, 2016.
Notice of Allowance for U.S. Appl. No. 14/858,647 dated Mar. 4, 2016.
Official Communication for Australian Patent Application No. 2014202442 dated Mar. 19, 2015.
Official Communication for Australian Patent Application No. 2014213553 dated May 7, 2015.
Official Communication for European Patent Application No. 14187739.9 dated Jul. 6, 2015.
Official Communication for European Patent Application No. 14187996.5 dated Feb. 12, 2015.
Official Communication for European Patent Application No. 14187996.5 dated Feb. 19, 2016.
Official Communication for European Patent Application No. 14191540.5 dated May 27, 2015.
Official Communication for European Patent Application No. 14200246.8 dated May 29, 2015.
Official Communication for European Patent Application No. 14200298.9 dated May 13, 2015.
Official Communication for European Patent Application No. 15181419.1 dated Sep. 29, 2015.
Official Communication for European Patent Application No. 15184764.7 dated Dec. 14, 2015.
Official Communication for Great Britain Patent Application No. 1404486.1 dated May 21, 2015.
Official Communication for Great Britain Patent Application No. 1404486.1 dated Aug. 27, 2014.
Official Communication for Great Britain Patent Application No. 1404489.5 dated May 21, 2015.
Official Communication for Great Britain Patent Application No. 1404489.5 dated Aug. 27, 2014.
Official Communication for Great Britain Patent Application No. 1404489.5 dated Oct. 6, 2014.
Official Communication for Great Britain Patent Application No. 1404499.4 dated Jun. 11, 2015.
Official Communication for Great Britain Patent Application No. 1404499.4 dated Aug. 20, 2014.
Official Communication for Great Britain Patent Application No. 1404499.4 dated Sep. 29, 2014.
Official Communication for Great Britain Patent Application No. 1408025.3 dated Nov. 6, 2014.
Official Communication for Netherlands Patent Application No. 2011632 dated Feb. 8, 2016.
Official Communication for Netherlands Patent Application No. 2012417 dated Sep. 18, 2015.
Official Communication for Netherlands Patent Application No. 2012421 dated Sep. 18, 2015.
Official Communication for Netherlands Patent Application No. 2012438 dated Sep. 21, 2015.
Official Communication for Netherlands Patent Application No. 2012778 dated Sep. 22, 2015.
Official Communication for New Zealand Patent Application No. 622473 dated Jun. 19, 2014.
Official Communication for New Zealand Patent Application No. 622473 dated Mar. 27, 2014.
Official Communication for New Zealand Patent Application No. 622513 dated Apr. 3, 2014.
Official Communication for New Zealand Patent Application No. 628161 dated Aug. 25, 2014.
Official Communication for New Zealand Patent Application No. 628585 dated Aug. 26, 2014.
Official Communication for New Zealand Patent Application No. 628840 dated Aug. 28, 2014.
Official Communication for U.S. Appl. No. 12/840,673 dated Sep. 17, 2014.
Official Communication for U.S. Appl. No. 12/840,673 dated Jan. 2, 2015.
Official Communication for U.S. Appl. No. 13/728,879 dated Aug. 12, 2015.
Official Communication for U.S. Appl. No. 13/728,879 dated Mar. 17, 2015.
Official Communication for U.S. Appl. No. 13/728,879 dated Nov. 20, 2015.
Official Communication for U.S. Appl. No. 13/728,879 dated Jan. 27, 2015.
Official Communication for U.S. Appl. No. 13/827,491 dated Dec. 1, 2014.
Official Communication for U.S. Appl. No. 13/827,491 dated Jun. 22, 2015.
Official Communication for U.S. Appl. No. 13/827,491 dated Oct. 9, 2015.
Official Communication for U.S. Appl. No. 14/141,252 dated Oct. 8, 2015.
Official Communication for U.S. Appl. No. 14/225,006 dated Sep. 10, 2014.
Official Communication for U.S. Appl. No. 14/225,006 dated Sep. 2, 2015.
Official Communication for U.S. Appl. No. 14/225,006 dated Dec. 21, 2015.
Official Communication for U.S. Appl. No. 14/225,006 dated Feb. 27, 2015.
Official Communication for U.S. Appl. No. 14/225,084 dated Sep. 11, 2015.
Official Communication for U.S. Appl. No. 14/225,084 dated Sep. 2, 2014.
Official Communication for U.S. Appl. No. 14/225,084 dated Feb. 20, 2015.
Official Communication for U.S. Appl. No. 14/225,084 dated Feb. 26, 2016.
Official Communication for U.S. Appl. No. 14/225,084 dated Jan. 4, 2016.
Official Communication for U.S. Appl. No. 14/225,160 dated Feb. 11, 2015.
Official Communication for U.S. Appl. No. 14/225,160 dated Aug. 12, 2015.
Official Communication for U.S. Appl. No. 14/225,160 dated May 20, 2015.
Official Communication for U.S. Appl. No. 14/225,160 dated Oct. 22, 2014.
Official Communication for U.S. Appl. No. 14/225,160 dated Jan. 25, 2016.
Official Communication for U.S. Appl. No. 14/225,160 dated Jul. 29, 2014.
Official Communication for U.S. Appl. No. 14/289,596 dated Jul. 18, 2014.
Official Communication for U.S. Appl. No. 14/289,596 dated Jan. 26, 2015.
Official Communication for U.S. Appl. No. 14/289,596 dated Apr. 30, 2015.
Official Communication for U.S. Appl. No. 14/289,596 dated May 9, 2016.
Official Communication for U.S. Appl. No. 14/289,599 dated Jul. 22, 2014.
Official Communication for U.S. Appl. No. 14/289,599 dated May 29, 2015.
Official Communication for U.S. Appl. No. 14/289,599 dated Sep. 4, 2015.
Official Communication for U.S. Appl. No. 14/294,098 dated Aug. 15, 2014.
Official Communication for U.S. Appl. No. 14/294,098 dated Nov. 6, 2014.
Official Communication for U.S. Appl. No. 14/306,138 dated Dec. 24, 2015.
Official Communication for U.S. Appl. No. 14/306,138 dated Dec. 3, 2015.
Official Communication for U.S. Appl. No. 14/306,147 dated Dec. 24, 2015.
Official Communication for U.S. Appl. No. 14/319,161 dated Jan. 23, 2015.
Official Communication for U.S. Appl. No. 14/319,765 dated Feb. 1, 2016.
Official Communication for U.S. Appl. No. 14/451,221 dated Oct. 21, 2014.
Official Communication for U.S. Appl. No. 14/463,615 dated Sep. 10, 2015.
Official Communication for U.S. Appl. No. 14/463,615 dated Nov. 13, 2014.
Official Communication for U.S. Appl. No. 14/463,615 dated May 21, 2015.
Official Communication for U.S. Appl. No. 14/463,615 dated Jan. 28, 2015.
Official Communication for U.S. Appl. No. 14/463,615 dated Dec. 9, 2015.
Official Communication for U.S. Appl. No. 14/479,863 dated Dec. 26, 2014.
Official Communication for U.S. Appl. No. 14/483,527 dated Jun. 22, 2015.
Official Communication for U.S. Appl. No. 14/483,527 dated Jan. 28, 2015.
Official Communication for U.S. Appl. No. 14/483,527 dated Oct. 28, 2015.
Official Communication for U.S. Appl. No. 14/490,612 dated Aug. 18, 2015.
Official Communication for U.S. Appl. No. 14/552,336 dated Jul. 20, 2015.
Official Communication for U.S. Appl. No. 14/562,524 dated Nov. 10, 2015.
Official Communication for U.S. Appl. No. 14/562,524 dated Sep. 14, 2015.
Official Communication for U.S. Appl. No. 14/571,098 dated Nov. 10, 2015.
Official Communication for U.S. Appl. No. 14/571,098 dated Mar. 11, 2015.
Official Communication for U.S. Appl. No. 14/571,098 dated Feb. 23, 2016.
Official Communication for U.S. Appl. No. 14/571,098 dated Aug. 24, 2015.
Official Communication for U.S. Appl. No. 14/571,098 dated Aug. 5, 2015.
Official Communication for U.S. Appl. No. 14/631,633 dated Sep. 10, 2015.
Official Communication for U.S. Appl. No. 14/676,621 dated Oct. 29, 2015.
Official Communication for U.S. Appl. No. 14/676,621 dated Jul. 30, 2015.
Official Communication for U.S. Appl. No. 14/730,123 dated Sep. 21, 2015.
Official Communication for U.S. Appl. No. 14/746,671 dated Nov. 12, 2015.
Official Communication for U.S. Appl. No. 14/800,447 dated Dec. 10, 2015.
Official Communication for U.S. Appl. No. 14/813,749 dated Sep. 28, 2015.
Official Communication for U.S. Appl. No. 14/842,734 dated Nov. 19, 2015.
Official Communication for U.S. Appl. No. 14/934,004 dated Feb. 16, 2016.
Official Communication for U.S. Appl. No. 14/929,584 dated Feb. 4, 2016.
Official Communication for U.S. Appl. No. 14/929,584 dated Sep. 16, 2016.
Official Communication for U.S. Appl. No. 14/929,584 dated May 25, 2016.
Provisional Applications (1)
Number Date Country
62214840 Sep 2015 US
Continuations (1)
Number Date Country
Parent 14929584 Nov 2015 US
Child 15482919 US