CN102364471A - Method for displaying contact person list - Google Patents
Method for displaying contact person list Download PDFInfo
- Publication number
- CN102364471A CN102364471A CN2011103144472A CN201110314447A CN102364471A CN 102364471 A CN102364471 A CN 102364471A CN 2011103144472 A CN2011103144472 A CN 2011103144472A CN 201110314447 A CN201110314447 A CN 201110314447A CN 102364471 A CN102364471 A CN 102364471A
- Authority
- CN
- China
- Prior art keywords
- coordinator
- group
- value
- interactive relation
- similarity
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a method for displaying a contact person list on an electronic device, in particular a method for displaying contact persons which can be automatically grouped. The contact person list is provided with a plurality of kinds of contact person information; and each kind of contact person information comprises an interaction relation with other contact persons. The method disclosed by the invention comprises the following steps of: calculating similarity in pairs in the contact person list according to the interaction relation; calculating a group attributed value of each contact person according to the similarity; after comparing the group attributed value of each contact person with the similarity, setting the group of each contact person; and displaying the group and the contact person list on the electronic device. The method can be executed on a network server for storing the contact person list or executed on the electronic device.
Description
[technical field]
The present invention relates to a kind of method that coordinator's tabular is divided into groups, particularly relate to the method for dividing into groups and showing after the relation of utilizing between coordinator and the coordinator is estimated.
[background technology]
In present these cybertimes, personal information can utilize high in the clouds technology access address list information more easily according to user's the coordinator on the address list on the network that is set in; For example: Google provides network communication contact book can be synchronized with outside the address list coordinator on the Android mobile phone, more can link coordinator's information of address list of other community network, in addition (the Facebook in the community website; Twitter, MySpace Google+) provides the function of adding coordinator (coordinator); Utilize this function user can set up tens of at least people; Hundreds of people's contact list at most, and so much coordinator makes in fact and have identical related group with the user and combine, for example household; The colleague; The classmate ... Etc. relation, and the people that will distinguish different groups as the user is to be main with manual administration at present, and the present invention can utilize individual's set data; Automatically address list or coordinator's tabular are done classification, remove the user from and manually help the coordinator to set the problem of group stroke by stroke.
But with the community website is example; When manually setting coordinator's tabular group, we can find that usually the people of same group also can have common coordinator usually; The people in the classmate of the senior middle school group for example; Also all can have common coordinator also in classmate group of senior middle school, but a classmate of senior middle school that these common coordinators possibly not be the user, therefore for do the district at a distance from possibly need again will " coordinator that has a common coordinator divides same again group " solve; But, in practical application, but can run into following difficulty:
1. can't differentiate the coordinator who strides group; Some people has the coordinator of a plurality of groups simultaneously; For example be that the classmate of university also is the colleague of company simultaneously simultaneously, above-mentioned rule can't be differentiated out with it, and people's erroneous judgement that serious words may produce two distinct groups is merged into same a group.
2. the people's relevance in the same group does not have the branch of power, and for example the colleague of company group possibly be made up of different departments, or some people possibly be, and random adding coordinator does not have origin in fact.
Also the someone utilizes the single chain connection of branch mass-sending method of hierarchy type in addition ... Deng having disadvantage
1. the packet mode of hierarchy type makes the grouping of incipient error to divide into groups again in the immobilization of grouping process, and fails to produce best group result.
2. need the setting of threshold value, might be because threshold value be set the not good grouping result that influences.
The present invention proposes a grouping algorithm of hiving off and being the basis with artificial ant; And the notion of importing similarity; It is higher to utilize similarity between coordinator and coordinator to tell coordinator and that group association wherein of striding group, and the coordinator in also can telling on the same group is strong correlation or weak relevant.In grouping process, have grouping mechanism again, the influence that not divided into groups by incipient error, and designated groups number in advance can be told voluntarily by algorithm and the most suitably organize number.
[summary of the invention]
Can't be automatically and the problem of dividing into groups accurately for solving in the existing electronic installation coordinator's tabular; The purpose of this invention is to provide the method that shows coordinator's tabular; Be applicable to that electronic installation shows coordinator's tabular, coordinator's tabular has a plurality of coordinator's information, and each coordinator's information comprises the interactive relation with other coordinators; It is characterized in that method of the present invention comprises:, calculate similarity in twos in coordinator's tabular according to above-mentioned interactive relation; According to above-mentioned similarity, calculate each coordinator group ascribed value; After comparing above-mentioned each coordinator group ascribed value and similarity, set each coordinator's group; And show with this coordinator's tabular of above-mentioned group sequencing display in this electronic installation.
Coordinator's tabular of the present invention is stored in the webserver on the network; Electronic installation can pass through internet download coordinator tabular; Cross method of the present invention as if executed on the webserver and divide into groups, then electronic installation can directly show coordinator's tabular with the good order of classifying; If electronic installation is downloaded contact table and is classified source book as; Be shown in the display frame of electronic installation after also can carrying out method of the present invention, can be coordinator's servomechanism of coordinator's servomechanism or social networks in the webserver of the present invention by electronic installation.
Above-mentioned coordinator's interactive relation is not familiar with the value of being set at 0 for being value of being set at 1 when being familiar with mutually; Or with between the coordinator each other the number of times of communication set, the number of times of communication can be the number of times of calling, the number of times of news in brief, the number of times of instant messaging or the number of times of webpage message.
If have N coordinator, its interactive relation can paint the matrix of making a NxN, be that example is 5 coordinators' a relation with figure below
| The |
The coordinator 2 | The coordinator 3 | The coordinator 4 | The coordinator 5 | |
| The |
?1 | ?0 | ?1 | ?0 | ?1 |
| The coordinator 2 | ?0 | ?1 | ?0 | ?1 | ?0 |
| The coordinator 3 | ?1 | ?0 | ?1 | ?0 | ?1 |
| The coordinator 4 | ?0 | ?1 | ?0 | ?1 | ?0 |
| The coordinator 5 | ?1 | ?0 | ?1 | ?0 | ?1 |
The similarity of the capable j row of i can formula be calculated:
At this, a:i and j have the total amount of common interactive relation.
B: with i be have common interactive relation but with the j total amount of the common interactive relation of tool not.
C: with j be have common interactive relation but with the i total amount of the common interactive relation of tool not.
D:i and j be the total amount of the common interactive relation of tool not.
Similarity also can adopt other account form in addition in addition, as:
Sim(i，j)＝e/f，
E:i and j have the total amount of common interactive relation,
F: all coordinators' quantity.
In addition, i coordinator group ascribed value can by:
Calculate;
is the mean value of i coordinator and same contigency network people similarity; And Max (Sim (i ...)) be i coordinator and the maximum value of same contigency network people similarity.
And when following formula is set up
(Sim(i，j)＞T
i)∧(Sim(i，j)＞T
j))
I coordinator and j coordinator belong to same group.
Compared with prior art; Benefit of the present invention is; Need not use manual mode to set group relation and, show that so coordinator's tabular can be more accurate and convenient with a kind of more accurate actual social state that the user can be more pressed close in the setting that makes group that calculates.
Can graphicly further be understood by following detailed Description Of The Invention and appended about advantage of the present invention and spirit.
[description of drawings]
Fig. 1 has illustrated and has been applicable to system architecture diagram of the present invention;
Fig. 2 has illustrated the rule that is applicable to that ant state of the present invention is selected;
Fig. 3 has illustrated the embodiment of coordinator's interactive relation of the present invention;
Fig. 4 has illustrated the embodiment of coordinator's similarity of the present invention.
[embodiment]
Please refer to Fig. 1 electronic installation 100 of the present invention and couple the webserver 200 through internet 300, electronic installation 100 has the screen 120 of demonstration in order to show information, when internet 300 is a community network (Facebook; Twitter; MySpace, Google+), electronic installation 100 is watched community network with browser; Browse and can show coordinator's tabular in the picture shown in tabular 121, the present invention makes coordinator's tabular show with the 1-4 of group classification; Electronic installation 100 can more comprise a phone module 110; Electronic installation 100 couples the webserver 200 and downloads coordinator's tabular by storage device 210 through internet 300 and is shown in the demonstration screen 120; The present invention makes coordinator's tabular show with the 1-4 of group classification, lets the user is more convenient to be chosen suitable number and dial.The method of in Fig. 1, tabular 121 being carried out group of the present invention classification can be implemented in electronic installation 100, also can be performed in and be downloaded to electronic installation 100 in the webserver 200 again.
Coordinator's tabular of the present invention has a plurality of coordinator's information; Each coordinator's information comprises the interactive relation with other coordinators, and the user who that is to say electronic installation 100 has the interactive relation of tabular 121, and any coordinator in the tabular 121 have a similar tabular; For example Zhao zero of group 1 has the 1-4 of its group; Its inside can have and the Hu zero of user's common understanding, week zero etc., is example with Fig. 2, if the coordinator has the matrix relationship that 7 people can plot 7x7; If the coordinator is familiar with then entry value each other " 1 "; If be not familiar with then entry value each other " 0 ", the present invention does not limit the setting of the relation of having only mutual understanding, and record that also can be through the internet more can be embedded in the number of times of coordinator's mutual communication among Fig. 2; So more closing to reality has the interpersonal relation of contact, and the number of times of communication can be the number of times of calling, the number of times of news in brief, the number of times of instant messaging or the number of times of webpage message.Formula capable of using calculates similarity between any two, plots the matrix relationship of 7x7, and is as shown in Figure 3.
At this, a:i and j have common coordinator's quantity.
B: with i be the coordinator but and j be not coordinator's quantity.
C: with j be the coordinator but and i be not coordinator's quantity.
D:i and j are not coordinator's quantity.
With reference to figure 2, be example with coordinator 2 with coordinator 1:
The present invention utilizes the ant algorithm to carry out the calculating of coordinator group ascribed value, and this algorithm is that Labroche proposed in 2002.Coordinator's data that algorithm will be hived off is earlier at the beginning assigned to ant, that is each ant is all represented a coordinator.Come the ant of analogy occurring in nature to be in contact with one another in twos again, claim in the algorithm that this process is meeting with.Meet with law of honor according to six kinds then, when two artificial ants meet with, change ant state separately.In continuous random experience process, artificial ant presents the ability of self: by experience and reciprocation at random each other, make similar ant can have same smell at last, and then reach the effect that object hives off.
Comprise three phases in the process of hiving off: (1). the starting stage (2). the experience stage (3). coordinator group forms the stage.
(1). the starting stage
Starting stage comprises three steps, mainly is to four parameters of algorithm, comprises Label, M, M+ and coordinator group ascribed value, carries out initial value and sets, and we introduce four parameters earlier, put off until some time later three steps of bright starting stage.
Label represents ant smell on one's body, also just representes ant ownership crowd's mark, and label=0 representes that this ant is not belonged to as yet.M represents the estimated value of this ant ownership crowd size, and the ant member among the ownership crowd of big more this ant of expression of value is many more.When ant meets with process, if the two label value identical (table is with the crowd) then increases the M value of the two, otherwise reduces the M value of the two.M+: represent among this ant ownership crowd, the bigger table crowd that this ant belonged to is more firm for the estimated value of similar ant quantity number with it, value.When ant meets with process, if the two then increases the M+ value of the two, otherwise reduce the M+ value of the two with crowd and similar.All between 0～1, if represent M or M+ value with X, then the formula of increase or minimizing X value is respectively shown in formula (1) and formula (2) in this M and M+ value:
X
new＝(1-α)×X
old+α
X
new＝(1-α)×X
old
α: be a constant value, α=0.2 here.
Coordinator group ascribed value is for judging whether two ants are the threshold values of accepting (acceptance) state, and two ants are accepted mutually, represent that they are similar.Every ant all has its coordinator group ascribed value separately, and we with the coordinator group ascribed value that Ti representes i ant also are between 0～1.Coordinator group ascribed value Ti value is not what fix, can constantly adjust according to formula (3) along with the experience process:
At this, Sim (i ...) be the mean value of ant i and the ant similarity that was met with in the past, and Max (Sim (i ...)) be the maximum value of similarity in the ant that was met with in ant i and past.Two ants in the experience process are accepted judgement with formula (4) respectively.When judgment formula (4) is a true time, then ant i and ant j are regarded as receive status, represent that it is similar each other that two ants are assert.
(Sim (i, j)＞T
i) ∧ (Sim (i, j)＞T
j)) formula (4):
Three steps of starting stage are explained as follows:
Each coordinator that step 1 will be hived off assigns to an ant, and promptly N coordinator just has N ant.
Step 2 makes zero four parameters of each ant, comprises Label, M, M+ and coordinator group ascribed value.
Step 3 is carried out ascribed value value initialization of coordinator group.In the initialization procedure, each ant can carry out L time experience at random with other ants, and every experience once just utilizes formula (3) to change the ascribed value Ti of its coordinator group value.The constantly adjustment so its coordinator group ascribed value value can be started from scratch, the value of adjusting after L time is exactly the initial value of the ascribed value Ti of this ant coordinator group.Advise getting final product for L=75 time here.In this step, Label, M, M+ still remain 0.
(2). the experience stage
In this stage, two ants of random choose make its mutual experience in whole ants, meet with the rule (see figure 4)s according to six that utilize true ant characteristic to be released simultaneously, change ant three parameter: Label, M, M+ on one's body.The coordinator group ascribed value value of ant continues adjustment in each back that meets with according to formula (3), learns into a stable and suitable value.In Fig. 4, and A (i, two ants of j) expression experience are receive status, (i, two ants of j) expression experience are nonaccepting state to No A, and are promptly dissimilar each other.
Algorithm via the mutual experience of ant, lets rule produce reciprocation constantly, can form the firm and suitable big group of a group a group gradually.Judge whether to meet iterations NIter (NIter=250*N) at last.In the formula 250 is that N is the ant number by the coefficient of experimental result suggestion.When meeting iterations, then get into next stage; Otherwise continue to meet with circulation.
(3) coordinator group forms the stage
The ant of identical Label is formed same group, and at this moment we can find can produce the crowd that some have only an ant member in the experience stage usually, are called assorted crowd.Assorted crowd forms reason and has two kinds:
1. coordinator's data of this ant is special, does not all have identical coordinator with any other coordinator, and at this moment we classify as it and do not belong to any group.
2. it is disallowable via rule four that this ant is belonged to unsuitable crowd in early days; Thereby generation oneself is the situation of a group; His coordinator's data of this situation and other coordinators still have common coordinator, still with its with existing group relatively, the group that its ownership is the most similar.
Carry out the initialization of each coordinator coordinator group ascribed value again; In Fig. 3; Coordinator 1 is an example; Meet with at random 75 times,
At initial phase, except coordinator group ascribed value, other Label, M, M+ still remain 0,7 coordinator and get into the experience stage in initialization end back.The experience stage is that two coordinators of random choose meet with, and meeting with coordinator 5 with coordinator 1 is example, and both similarities are 0.5767, and coordinator group ascribed value value is respectively 0.5431; 0.4985, applies mechanically formula (4) and be judged as acceptance, and because just begun to meet with, they do not have the crowd label of ownership all is 0; Meet rule 1, produce and be numbered 1 new group, and with coordinator 1; 5 label value is made as 1, gets into down to meet with successively, will carry out experience altogether 250*7=1750 time in the experience stage; Constantly adjust 4 property values of each coordinator, the friend with identical label value after being finished is classified as same a group, produces the grouping result of following table:
Experience stage grouping result
We can find that coordinator 1 has identical coordinator with coordinator 3, so be divided into one group, coordinator 5 is for striding the coordinator of group, but his similarity is more similar with first group, so assign to first group; Coordinator 2 and coordinator 4 are assigned to second group; Coordinator 6 for the coordinator that rejected by rule four (can find that by data he should be coordinator 2 household, so and coordinator 4 be not the coordinator); 7 of coordinators and your no coordinator.Therefore can be shown in according to above-mentioned group result and show in the screen 120.
The present invention can success the data of utilizing community website coordinator, all coordinators of user are hived off.Can effectively overcome the interference of striding coordinator of group and weak relevant coordinator, utilize the ant recognition system characteristic success reach intelligent effect of hiving off, save the puzzlement that the user manually hives off.
Claims (10)
1. a method that shows coordinator's tabular is applicable to an electronic installation, and this coordinator's tabular has a plurality of coordinator's information, and each coordinator's information comprises the interactive relation with other coordinators, it is characterized in that this method comprises:
According to above-mentioned interactive relation, calculate similarity in twos in coordinator's tabular;
According to above-mentioned similarity, calculate each coordinator group ascribed value;
After comparing above-mentioned each coordinator group ascribed value and similarity, set each coordinator's group; And
Show with this coordinator's tabular of above-mentioned group sequencing display in this electronic installation.
2. the method for claim 1 is characterized in that, this interactive relation of this coordinator value of being set at 1 during for mutual understanding or not the value of being set at 0.
3. the method for claim 1 is characterized in that, this interactive relation of this coordinator is the number of times of mutual communication.
4. the method for claim 1 is characterized in that, this interactive relation is the matrix of a NxN, and wherein the similarity of the capable j row of i is calculated with formula:
At this, a:i and j have the total amount of common interactive relation.
B: with i be have common interactive relation but with the j total amount of the common interactive relation of tool not.
C: with j be have common interactive relation but with the i total amount of the common interactive relation of tool not.
D:i and j be the total amount of the common interactive relation of tool not.
5. method as claimed in claim 4 is characterized in that, i coordinator group ascribed value by:
Calculate;
is the mean value of i coordinator and same contigency network people similarity; And Max (Sim (i ...)) be i coordinator and the maximum value of same contigency network people similarity.
6. method as claimed in claim 5 is characterized in that, when following formula is set up
(Sim(i，j)＞T
i)∧(Sim(i，j)＞T
j))
I coordinator and j coordinator belong to same group.
7. the method for claim 1 is characterized in that, this interactive relation is the matrix of a NxN, and wherein the similarity of the capable j row of i is calculated with formula:
Sim(i，j)＝e/f，
E:i and j have the total amount of common interactive relation,
F: all coordinators' quantity.
8. the method for claim 1 is characterized in that, above-mentioned coordinator's tabular is stored in the webserver, and this electronic installation is obtained above-mentioned coordinator's tabular through the internet.
9. method as claimed in claim 8 is characterized in that, this method is carried out by this webserver, and the classify contact table biographies of group of tool are delivered to this electronic installation.
10. method as claimed in claim 8 is characterized in that, this method is carried out by this electronic installation and shown.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011103144472A CN102364471A (en) | 2011-09-30 | 2011-09-30 | Method for displaying contact person list |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011103144472A CN102364471A (en) | 2011-09-30 | 2011-09-30 | Method for displaying contact person list |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102364471A true CN102364471A (en) | 2012-02-29 |
Family
ID=45691037
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011103144472A Pending CN102364471A (en) | 2011-09-30 | 2011-09-30 | Method for displaying contact person list |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102364471A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104144104A (en) * | 2013-05-07 | 2014-11-12 | 宏达国际电子股份有限公司 | Method for computerized grouping contact list, electronic device using the same and computer program product |
| CN104836882A (en) * | 2015-05-28 | 2015-08-12 | 小米科技有限责任公司 | Method and device for processing contact information |
| CN106817472A (en) * | 2015-12-02 | 2017-06-09 | 华为技术有限公司 | One kind communication account determines method, terminal device and server |
| CN103729414B (en) * | 2013-12-12 | 2017-07-11 | 福建榕基软件股份有限公司 | The method and its device of a kind of statistical information frequency of interaction |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101035370A (en) * | 2007-03-29 | 2007-09-12 | 华为技术有限公司 | Dynamic group implementation method and device |
| CN101562649A (en) * | 2009-05-14 | 2009-10-21 | 深圳华为通信技术有限公司 | Group management method for contact persons and mobile terminal |
| CN102082870A (en) * | 2010-12-28 | 2011-06-01 | 东莞宇龙通信科技有限公司 | Method and device for managing contacts as well as mobile terminal |
| CN102137029A (en) * | 2010-01-21 | 2011-07-27 | 阿里巴巴集团控股有限公司 | Method and device for managing instant messaging contact information |
-
2011
- 2011-09-30 CN CN2011103144472A patent/CN102364471A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101035370A (en) * | 2007-03-29 | 2007-09-12 | 华为技术有限公司 | Dynamic group implementation method and device |
| CN101562649A (en) * | 2009-05-14 | 2009-10-21 | 深圳华为通信技术有限公司 | Group management method for contact persons and mobile terminal |
| CN102137029A (en) * | 2010-01-21 | 2011-07-27 | 阿里巴巴集团控股有限公司 | Method and device for managing instant messaging contact information |
| CN102082870A (en) * | 2010-12-28 | 2011-06-01 | 东莞宇龙通信科技有限公司 | Method and device for managing contacts as well as mobile terminal |
Non-Patent Citations (1)
| Title |
|---|
| 张建华 等: "《蚁群聚类算法综述》", 《计算机工程与应用》, no. 16, 31 August 2006 (2006-08-31) * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104144104A (en) * | 2013-05-07 | 2014-11-12 | 宏达国际电子股份有限公司 | Method for computerized grouping contact list, electronic device using the same and computer program product |
| TWI571096B (en) * | 2013-05-07 | 2017-02-11 | 宏達國際電子股份有限公司 | Method for computerized grouping contact list, electric device using the same and computer program product |
| US9646208B2 (en) | 2013-05-07 | 2017-05-09 | Htc Corporation | Method for computerized grouping contact list, electronic device using the same and computer program product |
| CN103729414B (en) * | 2013-12-12 | 2017-07-11 | 福建榕基软件股份有限公司 | The method and its device of a kind of statistical information frequency of interaction |
| CN104836882A (en) * | 2015-05-28 | 2015-08-12 | 小米科技有限责任公司 | Method and device for processing contact information |
| CN104836882B (en) * | 2015-05-28 | 2018-01-05 | 小米科技有限责任公司 | The processing method and processing device of contact details |
| CN106817472A (en) * | 2015-12-02 | 2017-06-09 | 华为技术有限公司 | One kind communication account determines method, terminal device and server |
| CN106817472B (en) * | 2015-12-02 | 2020-03-10 | 华为技术有限公司 | Communication account determining method, terminal device and server |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR102164814B1 (en) | Method for providing product recommendation service based on deep-learning neural network | |
| JP6104239B2 (en) | Consumer-led advertising system | |
| CN104394118B (en) | A kind of method for identifying ID and system | |
| CN110059249A (en) | Method, terminal device and the system of personalized recommendation | |
| CN103678613B (en) | Method and device for calculating influence data | |
| US20090287687A1 (en) | System and method for recommending venues and events of interest to a user | |
| US9224095B2 (en) | System and methods for generating optimal post times for social networking sites | |
| CN110462604A (en) | The data processing system and method for association internet device are used based on equipment | |
| CN104518887B (en) | A kind of package recommendation method and device | |
| CN104765751B (en) | Using recommended method and device | |
| CN103295145A (en) | Mobile phone advertising method based on user consumption feature vector | |
| Xu et al. | Integrated collaborative filtering recommendation in social cyber-physical systems | |
| CN109614556B (en) | Access path prediction and information push method and device | |
| CN105281925B (en) | The method and apparatus that network service groups of users divides | |
| CN105320724A (en) | New heuristic for optimizing non-convex function for learning to rank | |
| CN101510856A (en) | Method and apparatus for extracting member relation loop in SNS network | |
| CN106570718A (en) | Information releasing method and releasing system | |
| CN104133817A (en) | Online community interaction method and device and online community platform | |
| US20150287092A1 (en) | Social networking consumer product organization and presentation application | |
| US20140324729A1 (en) | Computerized System and Method for Determining an Action Person's Influence on a Transaction | |
| CN106980703A (en) | For the method and device of group's search, electronic equipment, computer-readable medium | |
| CN106326279A (en) | Reward data processing method and system | |
| US20150006241A1 (en) | Analyzing participants of a social network | |
| US20150348059A1 (en) | System and method for determining the shopping phase of a shopper | |
| CN102364471A (en) | Method for displaying contact person list |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20120229 |