The disclosure is related to normalizing location identifiers for processing in machine learning algorithms.
The Internet is a global system of interconnected computers and computer networks that use a standard Internet protocol suite (e.g., the Transmission Control Protocol (TCP) and Internet Protocol (IP)) to communicate with each other. The Internet of Things (IoT) is based on the idea that everyday objects, not just computers and computer networks, can be readable, recognizable, locatable, addressable, and controllable via an IoT communications network (e.g., an ad-hoc system or the Internet).
A number of market trends are driving development of IoT devices. For example, increasing energy costs are driving governments' strategic investments in smart grids and support for future consumption, such as for electric vehicles and public charging stations. Increasing health care costs and aging populations are driving development for remote/connected health care and fitness services. A technological revolution in the home is driving development for new “smart” services, including consolidation by service providers marketing ‘N’ play (e.g., data, voice, video, security, energy management, etc.) and expanding home networks. Buildings are getting smarter and more convenient as a means to reduce operational costs for enterprise facilities.
There are a number of key applications for the IoT. For example, in the area of smart grids and energy management, utility companies can optimize delivery of energy to homes and businesses while customers can better manage energy usage. In the area of home and building automation, smart homes and buildings can have centralized control over virtually any device or system in the home or office, from appliances to plug-in electric vehicle (PEV) security systems. In the field of asset tracking, enterprises, hospitals, factories, and other large organizations can accurately track the locations of high-value equipment, patients, vehicles, and so on. In the area of health and wellness, doctors can remotely monitor patients' health while people can track the progress of fitness routines.
The following presents a simplified summary relating to one or more aspects and/or embodiments disclosed herein. As such, the following summary should not be considered an extensive overview relating to all contemplated aspects and/or embodiments, nor should the following summary be regarded to identify key or critical elements relating to all contemplated aspects and/or embodiments or to delineate the scope associated with any particular aspect and/or embodiment. Accordingly, the following summary has the sole purpose to present certain concepts relating to one or more aspects and/or embodiments disclosed herein in a simplified form to precede the detailed description presented below.
According to one exemplary aspect, the disclosure relates to calculating a relative distance between a first node and a second node in a wireless network. A method for calculating a relative distance between a first node and a second node in a wireless network includes detecting a plurality of transitions of a user device from the first node to the second node, determining a relationship between the first node and the second node based on the plurality of transitions, and calculating the relative distance between the first node and the second node based on the determined relationship.
An apparatus for calculating a relative distance between a first node and a second node in a wireless network includes a wireless transceiver configured to detect a plurality of transitions of a user device from the first node to the second node, and a processor in communication with the wireless transceiver, the processor configured to determine a relationship between the first node and the second node based on the plurality of transitions, and to calculate the relative distance between the first node and the second node based on the determined relationship.
An apparatus for calculating a relative distance between a first node and a second node in a wireless network includes means for detecting a plurality of transitions of a user device from the first node to the second node, means for determining a relationship between the first node and the second node based on the plurality of transitions, and means for calculating the relative distance between the first node and the second node based on the determined relationship.
An apparatus for calculating a relative distance between a first node and a second node in a wireless network includes logic configured to detect a plurality of transitions of a user device from the first node to the second node, logic configured to determine a relationship between the first node and the second node based on the plurality of transitions, and logic configured to calculate the relative distance between the first node and the second node based on the determined relationship.
A non-transitory computer-readable medium for calculating a relative distance between a first node and a second node in a wireless network includes at least one instruction to detect a plurality of transitions of a user device from the first node to the second node, at least one instruction to determine a relationship between the first node and the second node based on the plurality of transitions, and at least one instruction to calculate the relative distance between the first node and the second node based on the determined relationship.
Other objects and advantages associated with the mechanisms disclosed herein will be apparent to those skilled in the art based on the accompanying drawings and detailed description.
A more complete appreciation of aspects of the disclosure and many of the attendant advantages thereof will be readily obtained as the same becomes better understood by reference to the following detailed description when considered in connection with the accompanying drawings which are presented solely for illustration and not limitation of the disclosure, and in which:
The present application is related to Provisional Application No. 61/769,130, entitled “AN IMPLICIT METHOD FOR CREATING RELATIONSHIPS BETWEEN INTERNET OF THINGS (IOT) DEVICES,” filed Feb. 25, 2013, and assigned to the assignee hereof and hereby expressly incorporated by reference herein.
The disclosure is related to normalizing location identifiers for processing in machine learning algorithms. An aspect of the disclosure is directed to calculating a relative distance between a first node and a second node in a wireless network by detecting a plurality of transitions of a user device from the first node to the second node, determining a relationship between the first node and the second node based on the plurality of transitions, and calculating the relative distance between the first node and the second node based on the determined relationship.
These and other aspects are disclosed in the following description and related drawings to show specific examples relating to exemplary embodiments for normalizing location identifiers for processing in machine learning algorithms. Alternate embodiments will be apparent to those skilled in the pertinent art upon reading this disclosure, and may be constructed and practiced without departing from the scope or spirit of the disclosure. Additionally, well-known elements will not be described in detail or may be omitted so as to not obscure the relevant details of the aspects and embodiments disclosed herein.
The words “exemplary” and/or “example” are used herein to mean “serving as an example, instance, or illustration.” Any embodiment described herein as “exemplary” and/or “example” is not necessarily to be construed as preferred or advantageous over other embodiments. Likewise, the term “embodiments of the invention” does not require that all embodiments of the invention include the discussed feature, advantage or mode of operation.
Further, many embodiments are described in terms of sequences of actions to be performed by, for example, elements of a computing device. It will be recognized that various actions described herein can be performed by specific circuits (e.g., application specific integrated circuits (ASICs)), by program instructions being executed by one or more processors, or by a combination of both. Additionally, these sequence of actions described herein can be considered to be embodied entirely within any form of computer readable storage medium having stored therein a corresponding set of computer instructions that upon execution would cause an associated processor to perform the functionality described herein. Thus, the various aspects of the invention may be embodied in a number of different forms, all of which have been contemplated to be within the scope of the claimed subject matter. In addition, for each of the embodiments described herein, the corresponding form of any such embodiments may be described herein as, for example, “logic configured to” perform the described action.
A client device, referred to herein as a user equipment (UE), may be mobile or stationary, and may communicate with a radio access network (RAN). As used herein, the term “UE” may be referred to interchangeably as an “access terminal” or “AT”, a “wireless device”, a “subscriber device”, a “subscriber terminal”, a “subscriber station”, a “user terminal” or UT, a “mobile terminal”, a “mobile station” and variations thereof. Generally, UEs can communicate with a core network via the RAN, and through the core network the UEs can be connected with external networks such as the Internet. Of course, other mechanisms of connecting to the core network and/or the Internet are also possible for the UEs, such as over wired access networks, WiFi networks (e.g., based on IEEE 802.11, etc.) and so on. UEs can be embodied by any of a number of types of devices including but not limited to PC cards, compact flash devices, external or internal modems, wireless or wireline phones, and so on. A communication link through which UEs can send signals to the RAN is called an uplink channel (e.g., a reverse traffic channel, a reverse control channel, an access channel, etc.). A communication link through which the RAN can send signals to UEs is called a downlink or forward link channel (e.g., a paging channel, a control channel, a broadcast channel, a forward traffic channel, etc.). As used herein the term traffic channel (TCH) can refer to either an uplink/reverse or downlink/forward traffic channel.
Referring to
Referring to
While internal components of UEs such as the UEs 200A and 200B can be embodied with different hardware configurations, a basic high-level UE configuration for internal hardware components is shown as platform 202 in
Accordingly, an embodiment of the invention can include a UE (e.g., UE 200A, 200B, etc.) including the ability to perform the functions described herein. As will be appreciated by those skilled in the art, the various logic elements can be embodied in discrete elements, software modules executed on a processor or any combination of software and hardware to achieve the functionality disclosed herein. For example, ASIC 208, memory 212, API 210 and local database 214 may all be used cooperatively to load, store and execute the various functions disclosed herein and thus the logic to perform these functions may be distributed over various elements. Alternatively, the functionality could be incorporated into one discrete component. Therefore, the features of the UEs 200A and 200B in
For example, where the UE 200A and/or 200B is configured to calculate a relative distance between a first node and a second node in a wireless network, the transceiver 206 may be configured to detect a plurality of transitions of the UE 200A and/or 200B from the first node to the second node. The ASIC 208 may be configured to determine a relationship between the first node and the second node based on the plurality of transitions and calculate the relative distance between the first node and the second node based on the determined relationship. The transceiver 206 may be configured to share the determined relationships and/or calculated relative distances with one or more other devices.
The wireless communication between the UEs 200A and/or 200B and the RAN 120 can be based on different technologies, such as CDMA, W-CDMA, time division multiple access (TDMA), frequency division multiple access (FDMA), Orthogonal Frequency Division Multiplexing (OFDM), GSM, or other protocols that may be used in a wireless communications network or a data communications network. As discussed in the foregoing and known in the art, voice transmission and/or data can be transmitted to the UEs from the RAN using a variety of networks and configurations. Accordingly, the illustrations provided herein are not intended to limit the embodiments of the invention and are merely to aid in the description of aspects of embodiments of the invention.
Referring to
Referring to
Referring to
Referring to
Referring to
Referring to
Generally, unless stated otherwise explicitly, the phrase “logic configured to” as used throughout this disclosure is intended to invoke an embodiment that is at least partially implemented with hardware, and is not intended to map to software-only implementations that are independent of hardware. Also, it will be appreciated that the configured logic or “logic configured to” in the various blocks are not limited to specific logic gates or elements, but generally refer to the ability to perform the functionality described herein (either via hardware or a combination of hardware and software). Thus, the configured logics or “logic configured to” as illustrated in the various blocks are not necessarily implemented as logic gates or logic elements despite sharing the word “logic.” Other interactions or cooperation between the logic in the various blocks will become clear to one of ordinary skill in the art from a review of the embodiments described below in more detail.
The various embodiments may be implemented on any of a variety of commercially available server devices, such as server 400 illustrated in
For example, where the server 400 is configured to calculate a relative distance between a first node and a second node in a wireless network, the network access ports 404 may be configured to detect a plurality of transitions of a user device from the first node to the second node. The processor 401 may be configured to determine a relationship between the first node and the second node based on the plurality of transitions and calculate the relative distance between the first node and the second node based on the determined relationship. The network access ports 404 may be further configured to share the determined relationships and/or calculated relative distances with one or more other devices.
A server, such as IoT server 170 in
The server can categorize the identifiers of access points reported by the user devices to determine relationships between the corresponding users. For example, the server can categorize the location identifiers of the access points by assigning a number to each location identifier. However, merely assigning random numbers to the location identifiers does not contribute to meaningful output. Likewise, assigning numbers linearly, meaning that each location identifier is assigned the next value upon entry in the system, also does not contribute to meaningful output.
Instead, the various aspects of the disclosure cluster the location identifiers and assign them numbers based on significance, location, and/or frequency of use, which allows the numeric assignations to add meaning to the output. For example, if a user device frequently transitions from access point A to access point B, the numeric assignments for these two points should indicate that the access points are related. As one option, numeric values can be assigned to the location identifiers in order of weight. Location identifiers that appear more frequently can be assigned a more significant numeric value. As another option, a graph of all location identifiers can be created. Using the graph, a transition table can be built, showing which location identifiers are related based on user devices transitioning between them. The most significant points can be taken as the basis for mapping the others, and numeric values can be assigned based on this transition map.
In
In
In
In
In
As is apparent, while
The user device 520 may store the transition table 500 locally and periodically upload it to the server, or the server may generate the transition table 500 based on transition information received from the user device 520 or the access points 510A-C. The transition information includes at least the location identifier of the new access point and optionally the time of the transition and the location identifier of the previous access point. Alternatively, the user device 520 may periodically send its geographic coordinates and/or the location identifier of its current access point to the server, and the server can determine when the user device 520 transitions from one location or access point to another.
However, the user device 520 need not send its transition information to the server. Rather, the user device 520 can store its transition table locally and identify related access points as described herein itself. The user device 520 can also share its transition table with other user devices. In that case, the user devices can aggregate the shared transition tables locally and each user device can determine relationships between access points based on their locally stored aggregated transition tables.
Where the access points 510A-C report the transition information to the server, they may simply report that the user device 520 transitioned into their coverage area and the server can determine from which access point the user device 520 transitioned. Alternatively, the access points 510A-C may be able to determine during the transition which access point was previously serving the user device 520 and report that information to the server as well.
The server can aggregate the transition tables, or transition information, from each user device in the network into a global transition table. Alternatively, the server can maintain separate transition tables for each user device in the network. Either way, the server can normalize the data (either in the global transition table or the individual transition tables), invert the normalized data, and calculate the relative distances between the access points. The calculated distances are not geo-spatial distances, but rather, geo-functional distances. That is, they show how closely related the access points are to each other. The more user devices that transition between two access points, and the more frequently the transitions, the more closely related those access points are considered to be to each other.
In another aspect, rather than a single global transition table or individual transition tables, transition tables may be built for a specific subset of user devices. For example, there may be millions of users in a given city, but only 100,000 of them may transition from a particular coffee shop's access point to a particular book store's access point. Such a relatively small number of transitions (i.e., 100,000 out of millions) may indicate that the coffee shop and the bakery are not very close, or not very related, to each other geo-functionally. In contrast, in a network of three users, such as a family network, if all three users frequently transition from a home access point to a garage access point, for example, it may indicate that the home access point and the garage access point are very close, or very related, to each other. When determining the distance between two points, the system can look at either the global transition table, the local transition table(s), or a combination of the two.
The server generates a normalized table 610 from the global transition table 600 by dividing each value in the global transition table 600 by the largest number, here 15. Next, the server generates an inverted normalized table 620 by subtracting each number in the normalized table 610 from 1.00.
The server then calculates the geo-functional distances between each access point A 510A to C 510C using the following equations:
|A−B|=(0.34+0.00)/2=0.34/2=0.17
|A−C|=(1.00+0.80)/2=1.80/2=0.90
|B−C|=(0.20+0.45)/2=0.65/2=0.33
As was illustrated in the global transition table 600, the greatest number of transitions were between access points A 510A and B 510B (10 and 15). As shown above, the distance value between access points A 510A and B 510B is the smallest distance value, indicating that access points A 510A and B 510B have the closest geo-functional distance in the network of access points A 510A to C 510C.
Note that the server is not required to use these specific formulas. Rather, any formula that can rank the geo-functional distances between access points as a function of the number of transitions between the access points can be used.
Calculating the geo-functional distances between access points can reveal relevant information about relationships between users. For example, if a first user is connected to a first access point and a second user is connected to a second access point that is very geo-functionally near the first access point, there is a strong possibility that there is some relationship between the two users. For example, where the user devices share their transition information with each other, if two user devices discover that they are frequently connected to geo-functionally close access points, it may indicate that the user devices are related.
Although the above aspects have been described in terms of location identifiers of access points, the disclosure is not so limited. The geo-functional distance between any type of node to which a user device can connect can be calculated using the aspects described above. For example, the access points referred to above could instead be cell phone towers, proximate user devices, or even GPS satellites. Similarly, the location identifiers referred to above could be any identifier that uniquely identifies the node. Note that the physical location of the node need not be known, as the geo-functional location determination does not require the physical location of the node. However, the physical location of a node could be associated with its geo-functional location.
At 910, the server detects a plurality of transitions from a first node to a second node by a user device. The detecting may include receiving an identifier of the second node from the user device. Alternatively, the detecting may include receiving an identifier of the first node, receiving an identifier of the second node, and determining that the user device has transitioned from the first node to the second node in response to receiving the identifier of the second node after receiving the identifier of the first node. The identifier of the first node may be a location identifier. The first node may be a wireless access point or a cell phone tower. A transition may represent a handover from the first node to the second node caused by the user device moving from a coverage area of the first node to a coverage area of the second node.
At 920, the server adds a count of the plurality of transitions to either an individual transition table for the user device or a global transition table. The individual transition table may store a count of transitions from the first node to the second node made by the first user device. The global transition table may store a count of transitions from the first node to the second node made by a plurality of user devices.
At 930, the server determines a relationship between the first node and the second node based on the plurality of transitions. Various metrics may indicate the relationship between the first node and the second node. For example, a greater number of transitions between the first node and the second node may indicate a stronger relationship between the first node and the second node, and vice versa. As another example, the time of day of each transition, or the approximate time of day of a majority of the transitions, may indicate the relationship between the first node and the second node. As yet another example, the number of distinct user devices that transition from the first node to the second node may indicate the relationship between the first node and the second node. The more distinct user devices that transition between the first node and the second node, the stronger the relationship between the nodes and the more popular the location may be determined to be. The various metrics related to the plurality of transitions may be used independently or in combination to determine the relationship between the first node and the second node.
There may also, or alternatively, be semantic information associated with the nodes. For example, certain nodes may be located in the northern hemisphere and others in the southern hemisphere, or certain nodes may be in proximity to coffee shops and others to chocolatiers. In these cases, one or more metrics can be defined indicating the affinity between the nodes based on the semantic information associated with the nodes.
At 940, the server calculates the geo-functional, or relative, distance between the first node and the second node based on the determined relationship. A stronger relationship between the first node and the second node indicates a closer relative distance between the first node and the second node. The calculating may include calculating the relative distance between the first node and the second node based on a number of a plurality of user devices transitioning between the first node and the second node compared to a number of the plurality of user devices. That is, a larger percentage of the user devices in a network transitioning between the two nodes indicates a closer relative distance than a smaller percentage of the user devices in the network transitioning between the nodes.
The calculating at 940 may include normalizing a count of the plurality of transitions from the first node to the second node to a first normalized value from zero to one, normalizing a count of a plurality of transitions from the second node to the first node to a second normalized value from zero to one, inverting the first normalized value, inverting the second normalized value, determining an average of the first normalized value and the second normalized value, and setting the average as the relative distance. A smaller relative distance can indicate a higher correlation between the first node and the second node.
The functionality of the modules of
In addition, the components and functions represented by
Those skilled in the art will appreciate that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referenced throughout the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.
Further, those skilled in the art will appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the aspects disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted to depart from the scope of the present disclosure.
The various illustrative logical blocks, modules, and circuits described in connection with the aspects disclosed herein may be implemented or performed with a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices (e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration).
The methods, sequences and/or algorithms described in connection with the aspects disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in RAM, flash memory, ROM, EPROM, EEPROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such that the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC. The ASIC may reside in an IoT device. In the alternative, the processor and the storage medium may reside as discrete components in a user terminal.
In one or more exemplary aspects, the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media may be any available media that can be accessed by a computer. By way of example, and not limitation, such computer-readable media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer. Also, any connection is properly termed a computer-readable medium. For example, if the software is transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium. Disk and disc, as used herein, includes CD, laser disc, optical disc, DVD, floppy disk and Blu-ray disc where disks usually reproduce data magnetically and/or optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.
While the foregoing disclosure shows illustrative aspects of the disclosure, it should be noted that various changes and modifications could be made herein without departing from the scope of the disclosure as defined by the appended claims. The functions, steps and/or actions of the method claims in accordance with the aspects of the disclosure described herein need not be performed in any particular order. Furthermore, although elements of the disclosure may be described or claimed in the singular, the plural is contemplated unless limitation to the singular is explicitly stated.
The present application for patent claims the benefit of Provisional Application No. 61/901,822, entitled “NORMALIZING LOCATION IDENTIFIERS FOR PROCESSING IN MACHINE LEARNING ALGORITHMS,” filed Nov. 8, 2013, which is assigned to the assignee hereof and hereby expressly incorporated by reference herein in its entirety.
Number | Date | Country | |
---|---|---|---|
61901822 | Nov 2013 | US |