WO2009151134A1 - リソース情報のリソース・ポイント算出、およびポイント流通方法 - Google Patents
リソース情報のリソース・ポイント算出、およびポイント流通方法 Download PDFInfo
- Publication number
- WO2009151134A1 WO2009151134A1 PCT/JP2009/060839 JP2009060839W WO2009151134A1 WO 2009151134 A1 WO2009151134 A1 WO 2009151134A1 JP 2009060839 W JP2009060839 W JP 2009060839W WO 2009151134 A1 WO2009151134 A1 WO 2009151134A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- resource
- value
- user
- tag
- information
- Prior art date
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
Definitions
- the present invention evaluates a plurality of resources posted via a network by a client terminal by a predetermined method, and automatically assigns a given point, whereby a plurality of resources
- the present invention relates to a system capable of distributing points in a community having groups.
- Examples of media that generate content by directly posting and posting information directly on the Internet using the Internet include a Q & A site, an auction site, a social networking service (SNS), and a blog. These are called CGM (Customer Generated Media), and users can easily disclose information on the Internet in real time, and other Internet users can freely find interesting and useful information from these information. Can be selected. For this reason, CGM is used in many forms by many Internet users as a social database for communities on the Internet.
- the questioner, the answer to the question, and the evaluation of the answer is trying to evaluate the usefulness of the useful answer or answer given to the question are performed manually based on the subjectivity of the questioning person, for example, in a form in which the usefulness is given to the user who posted in the form of points (Patent Document 1).
- the price is merely determined in an auction format between the purchaser and the seller, and the price is also determined based on the subjectivity. In other words, there is no common value for information stored in social databases, and social asset values are often sparse.
- the present invention has been proposed in order to solve these conventional problems, and the object of the present invention is to provide various resources that are posted to a community via a network such as the Internet and accumulated in a database. Then, it automatically creates a correspondence (link) according to the user's behavior for the contents of the tags and resources that are automatically extracted, and for these resources, it is an objective for the entire community using a predetermined evaluation method. Automatically evaluates and associates points based on these ratings with resources to present relative value within the community to the user, and then rewards a given point based on this point Distribute points to users who post resources and distribute points automatically in the community It is to provide a stem.
- the invention according to claim 1 is a system for calculating (i) a point of a resource and outputting it for a resource input by a user via an interface (21),
- Second storage means (45, FIG. 9B), and (iii) the one or more resource tag related information stored in the second storage means Accordingly, the first generation means (FIG. 9A, FIG.
- Each of the generated resource lists includes one or more resource IDs, and each of the tag IDs associated with each of the resource IDs included in the resource list generated immediately before Means based on the resource ID included in the resource tag related information, (iv) the hop number value, and each hop number value included in the resource list corresponding to the hop number value Based on the value of the first resource center value associated with the resource ID by the first storage means, the one resource First calculation means (S3401) for calculating the first resource center value of D, and (v) further identified by the first resource ID based on the first resource center value calculated by the first calculation means
- the present invention relates to a system including second calculation means (S3404) for calculating the points of the resource, and (vi) presentation means (D143) for presenting the points calculated by the second calculation means to the interface.
- the invention according to claim 2 is the system according to claim 1, wherein (i) the resource list in which the value of the number of hops generated by the first generation means is 1, the second storage is stored. Generated by removing the one resource ID from the union of the resource IDs included in the resource tag related information further associating each tag ID associated with the one resource ID by means (45) (Ii) each of the resource lists in which the value of the number of hops generated by the first generation means is 2 or more is included in the resource list generated immediately before Already generated from the union of the resource IDs included in the resource tag related information further associating the tag IDs respectively associated with the resource IDs. And it relates to any of the above (S1608) system produced by extracting a new the resource ID which is not also included in the resource list corresponding to the value of the number of hops.
- the invention according to claim 3 is the system according to claim 2, wherein the first generation unit further increments the value of the hop count until the new resource ID is not extracted. As a result, the resource list is repeatedly generated until a given value is reached (S1607, S1608). *
- the invention according to claim 4 is the system according to any one of claims 1 to 3, wherein the first storage means stores a second resource center value associated with the resource ID.
- the first storage means stores a second resource center value associated with the resource ID.
- a relation between one of the resource IDs, a user ID associated with one of the resource IDs for identifying the user, one of the resource IDs, and the user ID A third storage means (44) for storing one or more user action correspondence information including an action classification for identifying the user, and (ii) the one or more stored in the third storage means (44) 3rd calculating means (S1803, S3503, S3503, S3503) for calculating a user evaluation value for each of the user IDs associated with the one resource ID based on the user action correspondence information 1806), and for each of the user IDs, the resource ID of the user action correspondence information associated with the user ID is further associated with the second resource central value associated by the first storage means (42).
- a value, a value indicating the resource classification of the user action correspondence information associated with the user ID, and the action classification for identifying the relationship between the user ID, the first resource ID and the resource ID in the third storage unit A third calculation means for calculating a user evaluation value of the user ID based on a value indicating the action classification for identifying a relationship of user IDs; and (iii) calculated by the third calculation means, A fourth calculator for calculating a second resource center value of the one resource ID based on the user evaluation value of each user ID (S1815) and relates to a system comprising a.
- the invention according to claim 5 is the system according to claim 4, further comprising: (i) fourth storage means (41) for storing the user ID and a user center value associated with the user ID; (Ii) fifth storage means (311), wherein one of the user IDs, the other user ID associated with one of the user IDs, one of the user IDs and the other user ID Means for storing one or more pieces of user-related information including a user-related type for identifying the relationship, and (iii) the user stored in the fourth storage means (41) for the user ID of 1 A fifth calculation means (S3306) for calculating a center value, wherein the stored user center value is the other user ID associated with the one user ID stored in the fifth storage means.
- the invention according to claim 6 is the system according to claim 4, wherein the action category includes questions, answers, negative evaluation, positive evaluation, and / or browsing, and the value indicating the action category is
- the present invention relates to a system in which weighting is set corresponding to each of the action categories.
- the invention according to claim 7 relates to the system according to claim 5, wherein the user relation type includes favorite user registration and / or rejected user registration.
- the invention according to an eighth aspect is the system according to any one of the fourth to seventh aspects, wherein the first storage means can store a resource supply and demand value associated with the resource ID. , Based on the first resource center value calculated by the first calculation means and the second resource center value calculated by the fourth calculation means for the one resource ID, the first storage means (42 And a sixth calculation means for calculating the value of the resource supply and demand value associated with the one resource ID.
- the invention according to claim 9 is the system according to claim 8, wherein the value of the resource supply and demand value calculated and stored by the sixth calculating means is the second center value and the first center value.
- the system is based on the division value of.
- the invention according to claim 10 is the system according to claim 9, wherein the resource point identified by the one resource ID calculated by the second calculation means is the first storage means in the first storage means.
- the resource supply / demand values associated with one resource ID are normalized within a given range for all the resource supply / demand values associated with all the resource IDs stored in the first storage means. The system is calculated based on the above.
- the invention according to claim 11 is the system according to any one of claims 1 to 10, wherein (i) the resource point identified by the resource ID and the resource are identified by the second calculation means. 6th storage means (not shown) for storing the date and time when the point was calculated, the date and time when the point was calculated, the date and time when the resource was input, and the regular, scheduled and / or arbitrary setting (Ii) the presentation means further includes a resource point transition graph (D142) for the resource identified by the one resource ID, the sixth storage A resource point transition graph based on the date and time and the points related to the one resource ID stored in the means is created and the Characterized in that it presents the interface (21), about the system.
- D142 resource point transition graph
- the invention according to claim 12 includes two or more resources including (i) a resource, a resource ID for uniquely identifying the resource, and a resource point in a database (152) in a storage device included in the server (13).
- a resource tag association table (45) for storing one or more resource tag correspondence information including one of resource IDs included in the information and one or more tag IDs associated with the resource ID;
- the processing device (14) further provided in the server (13) including the temporary memory (153) includes a resource poi of the one resource information.
- a selection step (S1601) for selecting the value of the resource ID of the single resource information, and (vi) the resource-value having the value of the selected resource ID as the value of the resource ID of the resource tag correspondence information The value of the tag ID of the tag correspondence information is extracted (S1601), and the resource ID of the resource tag correspondence information having the extracted tag ID value as the tag ID value of the resource tag correspondence information And the resource ID obtained by deleting the selected resource ID value from the union of the extracted resource ID values.
- a list of values is generated as a resource list corresponding to the number of hops, where the value of the number of hops for the selected resource ID is 1, and stored in the temporary memory (153).
- List generation storage step (S1603), (vii) The value of the number of hops until the resource list corresponding to the number of hops satisfying a given condition (S1607), wherein the value of the number of hops is an integer of 2 or more Is a second resource list generation and storage step (S1608) that is repeatedly generated while incrementing from 2 (S1606) and stored in the temporary memory (153).
- the resource having the resource ID value of the list as the resource ID value of the resource tag correspondence information The tag ID value of the resource tag correspondence information is extracted, and the resource ID value of the resource tag correspondence information having the extracted tag ID value as the tag ID value of the resource tag correspondence information is extracted. Further, the value of the resource ID obtained by extracting and deleting the value of the resource ID of each of the first resource lists stored in the temporary memory from the union of the extracted value of the resource ID (S1608), (viii) the hop count value, and the hop count corresponding resource list corresponding to the hop count value, The resource ID value of the resource information is stored as the resource ID value of the resource information stored in the resource table (42).
- a first calculation step (S1604, S1605, S1609) for calculating a first resource central value for the one resource information based on the value of the resource point of the resource information; and (ix) the calculated first
- a second calculation step of calculating a first point for the one resource information based on one resource center value and storing it in the resource table as a value of the resource point of the one resource information (S1503) And a method executed by the processing device at a first timing.
- the invention according to claim 13 is the method according to claim 12, wherein the resource information stored in the resource table (42) includes an initial resource point associated with the resource ID, and (I) Using one or more first texts newly input via the interface (21) as resources of the new resource information, the value of the resource ID of the new resource information and the initial resource point
- the second text extracted from the first text above the new second text not stored as the tag of the tag information stored in the tag table (43) is used as the tag of the new tag information, and the value of the tag ID of the new tag information
- a tag extraction storage step (S2004) to be newly stored in the tag table (43), and (iii) a resource ID value of the new resource information stored in the resource storage step and the tag extraction storage step Storing the new resource tag correspondence information including the value of the tag ID of the new
- the initial resource point value of the new resource information was input via the interface.
- the method relates to a method performed by the processing device (14).
- the second text extracted from the first text by the tag extracting and storing step includes (i) one or more first texts from the first text.
- a first keyword group including one keyword is extracted (S2002), and (ii) a second database (19) stored in a storage device of a second server configured on the network, the server
- the extracted first keyword group is stored in the second database (19) linked with the database (152) of (13) by the application interface, and the text set including a plurality of pairs of words and their descriptions.
- a description of the matching word is acquired (S2002, S2101), and (iii) a second keyword group including one or more second keywords is further extracted from the acquired description (S2002, S2102). And (iv) searching for resources of the resource information in the resource table (42) using each of the second keywords included in the extracted second keyword group, and storing a given number or more as the resources
- the second keyword is extracted by deleting the second keyword from the second keyword group (S2003, S2104 to S2107).
- the database (152) is one of the resource IDs included in the resource information of the resource table (42).
- a user history table (44) for storing two or more user behavior correspondence information including one or more user IDs associated with one of the resource IDs and a corresponding behavior classification, and (ii) )
- the user having the resource ID value of the one resource information selected in the selection step (S1601) as the resource ID value of the user action correspondence information stored in the user history table (44)
- Temporary memo by extracting the value of the one or more user IDs of the behavior correspondence information and the value of the corresponding first behavior category (153)
- the action category extraction step (S1801) stored in (153), and (iii) one evaluation value of the user ID is repeatedly calculated for each of the extracted one or more user ID values, and the temporary memory (153)
- the third calculation step (S1803 to S1806) to be stored in the user behavior having the value of the one user ID as the value of the user ID of
- a list from which the ID value is deleted is generated as the second resource list for the selected resource ID and stored in the temporary memory (153).
- (Iv) (iv) The value of the first action category extracted in the action category extraction step (S1801) and the value of each resource ID included in the generated second resource list The extracted second action classification for the value of the resource point of the resource information and the value of the resource ID of the resource information having as the value of the resource ID of the resource information stored in the resource table (42) And (v) calculating the evaluation value of the one user ID and storing it in the temporary memory (153) (S1805), and (v) the extracted one Steps of calculating a second resource center value for the one resource information based on each evaluation value of the above user ID (S1512, S1808) , S1815), and (vi) a second point for the one resource information based on the calculated first resource center value and the calculated second resource center value for the one resource information. And (S1503) storing the value in the resource table (42) as the value of the resource point of the
- the selection step (S1601) is performed for each of resource ID values of all resource information stored in the resource table (42). ) As the resource ID of the one resource information, and then (ii) the first resource list generation and storage step (S1603), the second resource list generation and storage step (S1608), and the first The calculation step (S1604, S1605, S1609) and the second calculation step (S1503) respectively calculate the first resource center value of all the resource information and the second resource center value of all the resource information.
- the third points of all the resource information are calculated and stored in the temporary memory (153), respectively (iv) the calculated third points are A third point storing step (S1503) for storing the resource point values of all resource information in the resource table (42), respectively, and the method executed by the processing device (14) at the first timing About.
- the invention according to claim 17 is the method according to claim 16, further comprising: (i) two or more pieces of user account information including the user ID that uniquely identifies a user and an account point associated with the user ID (Ii) the two or more resource information stored in the resource table (42) further includes one posting user ID associated with a resource ID of the resource information The value of the posted user ID includes a posted user ID that is the value of the user ID of the user who has input the first text as a resource of the resource information, and (iii) the user history table
- the action classifications of the two or more user action correspondence information stored in (44) are questions, answers, Including a category representing a positive evaluation, a positive assessment, and browsing, and a value corresponding to the category is set as the value of the behavior category.
- the interface (21 ) Is stored as the value of the posting user ID of the new resource information, and at the same time, the value of the resource ID of the new resource information
- the user action correspondence including the value of the posting user ID of the new resource information and the value corresponding to the category selected by the user that is one of the behavior categories other than browsing Storing information in the user history table (44);
- the resource table (42) Any one of the resource ID values of the resources included in all the stored resource information at the timing specified by any of the users via the interface (21) and the specified resource ID value Storing the user action correspondence information including a value of the user ID for identifying the designated user and a value corresponding to the classification representing the browsing in the user history table (44).
- the invention according to claim 18 is the method according to claim 17, further comprising (i) a point investment step, wherein the value of the posting user ID of the new resource information is stored in the user table (41).
- the initial resource point of the new resource information stored in the resource table (42) is calculated from the value of the account point of the user account information having the user ID value of the stored user account information. Subtracting and further storing the subtracted result in the user table (41) as an account point value of the user account information, thereby increasing or decreasing the account point value.
- all tag information stored in the tag table (43) Furthermore, each tag point is provided, and each tag point of the tag information includes the value of the tag ID of the one tag information and the resource tag stored in the resource tag relation table (45).
- the one or more resource ID values of the resource tag correspondence information included as the tag ID value of the tag correspondence information further include the resource ID value of the resource information stored in the resource table (42).
- a value obtained by summing values of resource points of the resource information can be stored.
- a fourth point calculation storage step for storing each as the value of the tag point of the tag information of the table; (iv) Remuneration step, at a second timing specified when the first text of the resource of the new resource information is input via the interface (21), (a) by the selection step The value of the resource ID of the new resource information is selected, and (b) the number of hops where the number of hops for the resource ID of the new resource information is set to 1 in the first resource list generation and storage step (1603) A corresponding resource list is generated, and (c) the value of each resource ID included in the resource list corresponding to the number of hops is set to the resource ID of the resource tag correspondence information stored in the resource tag association table (45).
- the value of one or more tag IDs of the resource tag correspondence information each having a value has the value of the tag points of the tag information respectively included as the value of the tag ID of the tag information stored in the table (43).
- the sum of the tag point values for each resource ID is calculated and stored in the temporary memory (153), and (d) the initial of the new resource information stored in the resource table (42)
- each payout point for each resource ID included in the resource list corresponding to the number of hops is calculated, and each of the temporary memories (153) and (e) each of the stored payout points has the resource list corresponding to the number of hops.
- the value of the posted user ID of the resource information having the value of each resource ID as the value of the resource ID of the resource information stored in the resource table (42), and the user of the user table (41) Add to the value of the account point of the user account information, which is included as the value of the user ID of the account information, and use the added result as the value of the account point of the user account information. 41), each of which is stored in 41), and relates to a method executed by the processing device (14).
- the invention according to claim 19 is the method according to claim 18, wherein (i) the database (152) further stores two or more pieces of management information including expenditure points, collection points, and point movement times in reward distribution. And (ii) the value of the initial resource point of the new resource information stored in the resource table is the value of the expenditure point, and the new resource information
- the management information in which the difference between the value of the resource point and the total value of the payout points stored in the temporary memory is the value of the collection point, and the time of the second timing is the value of the point movement time,
- the invention according to claim 20 is the method according to claim 19, further comprising: (i) each account included in all the user account information stored in the user table (41) at a third timing.
- the value obtained by multiplying the point value by a given ratio and subtracting the integer value by rounding off the decimal point from the result of the multiplication is subtracted from the value of each account point, and the subtracted result In the user table (41) as the value of the account point of the user account information, and (ii) the integer value of the management information stored in the operation management table (48)
- the management information having the value of the expenditure point and the value of the collection point, and the time of the third timing as the value of the point movement time, Comprising a second management information storage step of storing the serial operational management table (48), and characterized in that it is executed by the processing unit (14), to a method.
- the invention according to claim 21 is the method according to claim 20, wherein (i) the database (152) further stores two or more point distribution information including total distribution points (49). Among the management information stored in the operation management table (48) by the first management information storage step and / or the second management information storage step at the first timing.
- the point distribution management table (49) calculates a total value of expenditure point values included in the management information having a point movement time value within a given range, and uses the calculated total value as a total distribution point value.
- FIG. 1 shows the overall outline of the configuration of the point evaluation payout system according to the present invention.
- FIG. 2 shows a preferred overall flow between the client terminal 12 and the point evaluation payout server in the first embodiment of the point evaluation payout system according to the present invention.
- FIG. 3 shows a list of suitable functions in the embodiment 1 of the point evaluation payout system according to the present invention.
- FIG. 4 shows a list of suitable tables and relationships in the first embodiment of the point evaluation payout system according to the present invention.
- FIG. 5 shows a suitable question resource registration flow in the embodiment 1 of the point evaluation payout system according to the present invention.
- FIG. 6 shows a preferred answer resource registration flow in the first embodiment of the point evaluation payout system according to the present invention.
- FIG. 1 shows the overall outline of the configuration of the point evaluation payout system according to the present invention.
- FIG. 2 shows a preferred overall flow between the client terminal 12 and the point evaluation payout server in the first embodiment of the point evaluation payout system according to the present invention.
- FIG. 3 shows a list of suitable functions in the embodiment 1
- FIG. 7 shows a preferred evaluation resource registration flow in the embodiment 1 of the point evaluation payout system according to the present invention.
- FIG. 8A shows an example of the resource division link in the first embodiment of the point evaluation payout system according to the present invention.
- FIG. 8B shows a specific table storage situation for an example of the resource division link in the embodiment 1 of the point evaluation payout system according to the present invention.
- FIG. 9A shows an example of a tag link in the first embodiment of the point evaluation payout system according to the present invention.
- FIG. 9B shows a specific table storage situation for an example of the tag link in the first embodiment of the point evaluation payout system according to the present invention.
- FIG. 10A shows an example of an action link in the first embodiment of the point evaluation payout system according to the present invention.
- FIG. 10B shows a specific table storage state for an example of the action link in the embodiment 1 of the point evaluation payout system according to the present invention.
- FIG. 11 shows a list of suitable functions in the embodiment 2 of the point evaluation payout system according to the present invention.
- FIG. 12 shows a preferred question resource registration flow in the embodiment 2 of the point evaluation payout system according to the present invention.
- FIG. 13 illustrates, as a flow chart, a suitable pricing process timing in the second embodiment of the point evaluation payout system according to the present invention.
- FIG. 14 shows a suitable user screen image in the embodiment 2 of the point evaluation payout system according to the present invention.
- FIG. 15 shows a preferred pricing process flow in the second embodiment of the point evaluation payout system according to the present invention.
- FIG. 11 shows a specific table storage state for an example of the action link in the embodiment 1 of the point evaluation payout system according to the present invention.
- FIG. 11 shows a list of suitable functions in the embodiment 2 of the point evaluation payout system according to the present invention.
- FIG. 12 shows a
- FIG. 16 shows a processing flow for calculating the resource center value using a suitable tag in the embodiment 2 of the point evaluation payout system according to the present invention.
- FIG. 17 conceptually shows an example of a suitable tag / link transition in the second embodiment of the point evaluation payout system according to the present invention.
- FIG. 18A shows a processing flow for calculating a resource center value by a suitable user action in the second embodiment of the point evaluation payout system according to the present invention.
- FIG. 18B is an example of a suitable action link in the embodiment 2 of the point evaluation payout system according to the present invention.
- FIG. 19 shows a list of suitable functions in the embodiment 3 of the point evaluation payout system according to the present invention.
- FIG. 20 shows a preferred general outline of the point evaluation payout system according to the third embodiment of the present invention.
- FIG. 21 shows a preferred feature vector extraction processing flow in the third embodiment of the point evaluation payout system according to the present invention.
- FIG. 22 shows a tag extraction process flow by a suitable genetic algorithm in the third embodiment of the point evaluation payout system according to the present invention.
- FIG. 23 shows an outline of preferable reward distribution in the embodiment 4 of the point evaluation payout system according to the present invention.
- FIG. 24 shows a list of suitable functions in the embodiment 4 of the point evaluation payout system according to the present invention.
- FIG. 25 shows a preferred question resource registration flow in the fourth embodiment of the point evaluation payout system according to the present invention.
- FIG. 26 shows a flow of a preferred direct payout process in the embodiment 4 of the point evaluation payout system according to the present invention.
- FIG. 27 shows a flow of a preferred indirect payout process in the embodiment 4 of the point evaluation payout system according to the present invention.
- FIG. 28 shows an example of a suitable management table in the fifth embodiment of the point evaluation payout system according to the present invention.
- FIG. 29 shows a preferred pricing process flow in the fifth embodiment of the point evaluation payout system according to the present invention.
- FIG. 30 shows an example of a preferred community point flow ratio (increase rate) calculation processing flow in the fifth embodiment of the point evaluation payout system according to the present invention.
- FIG. 31 shows an improved table list and relationship in the sixth embodiment of the point evaluation payout system according to the present invention.
- FIG. 32A shows an example of a user link in the sixth embodiment of the point evaluation payout system according to the present invention.
- FIG. 32B shows a specific table storage state of an example of a user link in the sixth embodiment of the point evaluation payout system according to the present invention.
- FIG. 33 shows a user center value calculation flow by a link between users in the sixth embodiment of the point evaluation payout system according to the present invention.
- FIG. 34 shows an improved pricing process flow in the sixth embodiment of the point evaluation payout system according to the present invention.
- FIG. 35 shows a resource centrality calculation processing flow based on an improved user action in the sixth embodiment of the point evaluation payout system according to the present invention.
- FIG. 36 shows an example of an action link considering the improved user link in the sixth embodiment of the point evaluation payout system according to the present invention.
- FIG. 37 shows the resource centrality calculation processing flow by the improved tag in the embodiment 6 of the point evaluation payout system according to the present invention.
- FIG. 1 is a diagram schematically showing a configuration of a first embodiment of a point evaluation payout system for resources according to the present invention.
- the point evaluation payout system is configured by connecting a plurality of client terminals 12A, 12B, 12C... And a point evaluation payout server 13 via a communication network 11. With such a system, the user can access the point evaluation payout server 13 via the network 11 from the client terminal.
- the point evaluation payout server 13 includes a processing device 14, a storage device 15, and a communication device 16.
- the storage device 15 includes a medium such as a hard disk or a random access memory (RAM).
- the communication network 11 may be an arbitrary network such as the Internet network.
- the client terminals 12A to 12N may be computer systems that are normally used, that is, desktop or laptop personal computers, and even mobile terminals that can be connected to the network 11 such as mobile phones and PDAs. Good. Further, each of the client terminals 12A to 12N has a browser 21 for carrying out a dialogue with the point evaluation payout server 13 in addition to a communication device (not shown) for connecting to the processing device 14 and the communication network 11. It has.
- This point evaluation payout system can be a known client-server network system.
- the storage device 15 provided in the point evaluation payout server 13 is a collection of a program 151 for causing the server 13 to function and numerical values and other information that can be searched using the server 13. 152 and a temporary memory 153 for temporarily storing information can be stored.
- the processing device 14 operates the program 151 stored in the storage device 15, data included in the database 152 is registered / searched / updated / deleted, and desired processing is realized.
- the database 152 can be a known relational database.
- FIG. 2 a preferred overall configuration between the client terminal 12 and the point evaluation payout server 13 in the first embodiment of the point evaluation payout system according to the present invention realized by such a configuration.
- the flow (2) will be described.
- FIG. 2 there are users A, B1, B2, C1 and C2 as users who access the point evaluation payout server 13, and each of them interacts with the point evaluation payout server via the browser 21 and the network 11 provided in their client terminals. It can be performed.
- these users can belong to a place (hereinafter referred to as “community”) that is virtually realized by the point evaluation dividend server and provided to the user in the service realized by the system.
- the resource is content posted by the user.
- the content is connected to the point evaluation payout server side to 1 Shall be treated as one resource.
- resources can include not only text data but also images and other format data.
- the user A can post to the community a question such as “I want to know how to install MS Office 2007” as a question resource together with an answer acceptance deadline (S21).
- This question resource is disclosed to another user after registration is completed.
- Each of the users B1 and B2 who browsed the question resource can post an appropriate answer to the question as an answer resource, for example, “Installation is possible as it is” (S22).
- the users C1 and C2 who have browsed the question resource and / or answer resource can post an evaluation such as “It was a very helpful answer” as an evaluation resource for the question resource and / or answer resource (S23).
- resources that is, resources such as question resources, answer resources, and evaluation resources are sequentially accumulated in the database 152 of the point evaluation payout server.
- FIG. 3 shows a list of suitable functions and relationships of the first embodiment according to the point evaluation payout system.
- the program 1511 stored in the storage device 15 included in the point evaluation payout server 13 includes a user module B1 for realizing the function 33 from the function 31 and a management module B2 for realizing the function 36 from the function 34. Can do.
- the user authentication function 31 permits the user to access the server and use various functions through an authentication processing request from the client terminal.
- the resource posting function 32 permits a resource posting request from the client terminal and accepts a resource posting by the user.
- the resource browsing function 33 permits a browsing request from the client terminal, and searches for various resources stored in the database 152 and presents the contents of the resources.
- the user account management function 34 performs management of authentication information for executing the user authentication function, management of a user profile, and management of an account (account) related to the user account.
- the tag information management function 35 is configured to automatically extract tags at arbitrary timing from a resource group posted by a user, and to register various tag information including registration, update, or deletion of the extracted tag information in the database 152. Perform management.
- the resource management function 36 manages various resource information including registration of resources posted by the user, association between resources, association between tags and resources, and association between users and resources.
- the program 1511 includes a general communication program that allows a computer to communicate using a protocol such as TCP / IP, A known program in a general database management system can be included.
- the database 152 includes a user table 41, a resource table 42, a tag table 43, and a user history table 44. , A resource tag association table 45 and a resource association table 46.
- the user table 41 includes a user ID for uniquely identifying a user, authentication information, various types of user profile information, and account point information associated with the user ID of the user account. Can be included as account information.
- the resource table 42 stores resource information posted by the user, and includes a resource, a resource ID that uniquely identifies the resource, resource attribute information including a resource category and a posting user ID, and resource points that the resource has, and Resource point information including initial resource points can be included as resource information.
- the resource classification refers to a classification including “question”, “answer”, and “evaluation” in the present embodiment.
- Tag information extracted from the resource group is stored in the tag table 43, and tag, tag ID for uniquely identifying the tag, tag attribute information, tag contents, and tag points of the tag are used as tag information.
- the user history table 44 stores user history information for resources, and may include resource ID, user ID, and action classification as user action correspondence information.
- the action category refers to a category including “question”, “answer”, “evaluation”, and “view” in the present embodiment. In addition to this, it is possible to include categories such as “purchase”, “favorite registration”, and “resource deletion request”. Furthermore, the action category “evaluation” can be further refined into a plurality of categories such as “positive assessment” and “negative assessment”.
- the resource tag association table 45 stores resource and tag related information, and includes one resource ID included in the resource information and one or more tag IDs associated with the resource ID as resource tag correspondence information. be able to.
- the resource association table 46 stores information between the parent and child of two resources, and includes a resource ID and its child resource ID.
- the parent-child information indicates to which resource the resource is registered, for example, an answer resource for the question resource and an evaluation resource for the answer resource.
- user action correspondence information is associated with a user ID for identifying a user.
- resource information is associated with a resource ID for identifying a resource.
- tag information is associated with a tag ID for identifying a tag
- user history information is associated with a resource ID
- resource tag association table 45 a tag ID is associated with a resource ID.
- the child resource ID is associated with the resource ID.
- the user table 41 and the resource table 42 can be linked by using the user ID as a key
- the tag table 43 and the resource table 42 can be linked by using the resource ID as a key
- the resource table 42, the user history table 44, the resource tag association table 45, and the resource association table 46 can be linked with a resource ID as a key.
- the illustrated processing device 14 and storage device 15 are provided in the point evaluation payout server 13.
- FIG. 5 shows a question resource registration flow (5) to the point evaluation payout server by the client terminal A.
- the processing device 14 performs an authentication process using information stored in the user authentication function 31, the user account management function 34, and the user table 41 in response to an authentication request from the client terminal A.
- This authentication process can be, for example, a commonly used ID / password method, but is not limited thereto.
- the point evaluation payout server can receive a question resource posting request from the client terminal A.
- the registration information of the question resource can be managed with a status such as “temporary registration” or “official registration”.
- the client terminal A can specify and post tag information related to the resource in addition to the resource information, and stores the “question” history in the user history table 44. This completes the registration of the question resource.
- FIG. 6 shows a response resource registration flow (6) to the point evaluation payout server by the client terminal B.
- the authentication process in S600 is the same as the description in FIG.
- the point evaluation payout server that has received the question resource browsing request from the client terminal B uses the resource browsing function 33 to search the resource table 42 using a given search condition, and presents the search result to the client terminal B.
- the search condition may be a search based on the date or keyword when the question resource is registered, but is not limited thereto.
- An answer resource can be posted by the client terminal B for the retrieved question resource (S602).
- the client terminal B can specify and post tag information related to the resource in addition to the resource information.
- the registration information of the answer resource can be managed by a status such as “temporary registration” or “official registration”.
- the tag information posted in the tag management table 43 is stored, and the “answer” history is stored in the user history table 44. This completes registration of the answer resource.
- FIG. 7 shows an evaluation resource registration flow (7) to the point evaluation payout server by the client terminal C.
- the authentication process in S700 is the same as the description in FIG.
- the point evaluation payout server that has received the request for browsing the question resource and / or answer resource by the client terminal C searches the resource table 42 using the given search condition by the resource browsing function 33, and the search result. Is presented to the client terminal B.
- the search condition may be a search based on the date or keyword when the question resource is registered, but is not limited thereto.
- An evaluation resource can be posted by the client terminal C for the retrieved question resource and / or answer resource (S702).
- the client terminal C can specify and post tag information related to the resource in addition to the resource information.
- the registration information of the evaluation resource can be managed by a status such as “temporary registration” or “official registration”.
- the tag information posted in the tag management table 43 is stored, and the “evaluation” history is stored in the user history table 44. This completes registration of the answer resource.
- the “community” in the point evaluation payout system of the present embodiment is accumulated in a set of resources accumulated in the resource table 42, and a table group including a user table 41 and a tag table 43 linked thereto.
- FIGS. 8A and 8B show the concept of “link by resource classification” (hereinafter referred to as “resource classification link”) and the storage status in a specific resource related table (46).
- the resource (ID) A to the resource (ID) G exist in the community, and in the resource table 42, any of “question resource”, “answer resource”, and “evaluation resource” is selected depending on the resource classification. It is registered as one.
- Resource A and resource F are “question resources”, resource C and resource E are “answer resources”, and resource B, resource D and resource G are “evaluation resources”. Further, resource E and resource B are linked to resource F. Further, resource C is linked to resource A, and resource D and resource G are linked to resource C.
- the answer resource or the evaluation resource for the question resource is linked directly or indirectly from the question resource, and this link relation is defined as a “resource division link”.
- this link relation is defined as a “resource division link”.
- the resource list of resource F with a hop count of 1 is (B, E)
- the resource list of resource A with a hop count of 1 is (C)
- the resource list of resource A with a hop count of 2 is (D, G
- a corresponding resource list can be defined by the reference resource and the number of hops indicating the distance from the reference resource.
- the resource list refers to a list composed of one or more resource IDs, and these resource lists are stored separately in the temporary memory and stored.
- “link” means that another ID is associated with one ID based on a table that defines association (such as a resource association table).
- This resource classification link can define two resources in the resource association table 46 by the correspondence between the resource ID and the resource ID of its child resource.
- a group of resources included in a single resource partition link can be organized as a “resource group”.
- FIG. 9A and FIG. 9B show the concept of “links by tags of resources” (hereinafter referred to as “tag links”) and the specific storage status in the resource tag related table (45).
- tag links are stored in the tag table 43.
- the tags 1 to 3 are manually posted by the user when the resources according to FIGS. 5 to 7 described above are registered.
- resource A, resource B, resource C and resource D are linked to each other via tag 1
- resource E, resource F, resource A and resource B are linked to each other via tag 2
- tag The resource D and the resource G are linked to each other via 3.
- Resource E and resource G are linked with “resource E ⁇ resource B ⁇ resource D ⁇ resource E” via tag 2, tag 1, and tag 3 in three hops.
- a direct and / or indirect relationship between a plurality of resources via tags is defined as a “tag link”.
- a resource list with a hop number 1 of resource A is (B, C, D, E, F)
- a resource list with hop number 2 is (G)
- a tag that intervenes with a reference resource is (G)
- the corresponding resource list can be defined by the number of hops indicating the number of hops. If there are multiple possible tag links from one resource to the other, that is, the one with the smallest number of hops can be the tag link.
- This tag link can be defined by using a resource tag association table 45 to define a link between two resources based on the correspondence between resource IDs and tag IDs.
- the tag link is defined by the relationship between the tag and the resource.
- the tag link can be defined by the relationship between the tag and the resource group.
- FIG. 10A and FIG. 10B show the concept of “link by user's behavior (history)” (hereinafter referred to as “behavior link”) and its specific storage status in the user history table (44).
- resource A to resource G exist in the community, and user 1 to user 3 exist at the same time.
- User information of users 1 to 3 is stored in the user table 41, and each user can “post” questions, answer resources, and evaluation resources, and is already stored in the resource table. You can also "browse" the resource information that you have.
- it can be posted together with two or more evaluation categories such as “positive evaluation” and “negative evaluation”.
- FIG. 10A shows the concept of “link by user's behavior (history)” (hereinafter referred to as “behavior link”) and its specific storage status in the user history table (44).
- FIG. 10A resource A to resource G exist in the community, and user 1 to user 3 exist at the same time.
- User information of users 1 to 3 is stored in the user table 41, and
- the symbol “Q” means “post question resource” as the user action category, and similarly the symbol “A” is “post answer resource” and the symbol “+ R” is “plus”.
- the “post of evaluation” and the symbol “-R” mean “post of negative evaluation”.
- resource E, resource F, resource A, and resource B are linked to each other together with their respective action divisions via user 1
- resource A, resource B, resource C, and resource D are sent via user 2.
- the resource D and the resource G are linked to each other together with their respective action categories through the user 3. In this way, in a community, a direct and / or indirect relationship between any two resources is defined as an “action link” using a user and its action category.
- a resource list with a hop number of 1 for resource A is (B, C, D, E, F), and a resource list with a hop number of 2 is (G).
- the corresponding resource list can be defined by the number of hops indicating the number of hops.
- This action link can define a link between two resources by using a resource ID and a user ID using the user history table 44. 10A and 10B are merely examples, and other behavior categories such as “purchase”, “favorite registration”, and “resource deletion request” can be freely defined. Yes, you may define action links including these.
- the relationship between a plurality of resources posted by one or more users is defined using three types of links: resource category links, tag links, and action links. can do.
- resource category links can be used to satisfy resource requests.
- action links can be used to satisfy resource requests.
- an objective evaluation of the resource with respect to the community from a plurality of viewpoints can be performed on the resources existing in the community, that is, the individual resources accumulated in the database 152 of the point evaluation dividend server.
- each resource stored in the database 152 of one or more resources existing in the community in the first embodiment that is, the point evaluation payout server is described.
- An objective central value for the entire community is calculated for the resource, and a pricing process for calculating as a resource point can be performed at an arbitrary timing. This makes it possible to provide an objective assessment of the entire community instead of the traditional manual assessment of resources by the user's subjectivity, and provides a common value assessment for information stored in social databases. It becomes possible.
- the community operation management function 37 provides a function for the community operation manager to perform various settings necessary for executing the pricing process including setting of the pricing process timing and setting of the interest rate in the community. can do.
- the resource point calculation function 38 is a value of each resource stored in the resource table 42, for example, periodically / scheduled or at an arbitrary timing such as a predetermined time or every time a specific event occurs. The result is output as a resource point and stored in the resource point of the resource table 42.
- the description regarding the program mentioned above is only for the purpose of illustration, and is not limited to these.
- FIG. 12 shows an example (12) of the flow related to the question resource registration to the point evaluation payout server 13 by the client terminal A, and incorporates the execution of the pricing process.
- the point evaluation dividend server 13 posts the question resource by the client terminal A in S1202. The difference is that the initial resource point calculation process is performed at the same time when the request (S1201) is received.
- the resource point calculation function 38 can price each resource including the question resource, and the client terminal A can present the pricing result for the question resource as an initial resource point.
- a feature of this embodiment lies in that both resources can be newly stored in the resource table (42) (S1202, S1204).
- the initial resource points are calculated and stored by processing in the resource point calculation function 38, as will be described later.
- the question resource pricing process is performed at the time of registering the question resource.
- the present invention is not limited to this timing, but at any timing, that is, once a day, every morning.
- the processing device 14 can start the program in the resource point calculation function 38 and perform the pricing process at the time of midnight, when the answer reception to the question resource is completed or when the event is detected.
- the resource to be subjected to the pricing process is not limited to the specific resource but may be all resources, and any resource stored in the resource table 42 can be used.
- FIG. 13 is an example of a flow chart illustrating the timing for executing the pricing process in the point evaluation payout system of the present embodiment.
- the pricing process can be executed at regular / scheduled timing such as once / day and every day at midnight, and the pricing process can be performed for all resources.
- the system detects an action event by the user, that is, the history is stored in the user history table 44, and at the timing when the event that the action is “viewing” of a certain resource occurs.
- a pricing process can be executed on the resource.
- Timing T1303 is the case of the initial resource point calculation in FIG. 12 described above. This system detects the action by the user, that is, the history is stored in the user history table 44, and the action is “post”.
- a pricing process can be executed for the resource.
- the pricing process is not performed in the event that the resource is other than that, that is, in the event of “answer resource” or “evaluation resource”.
- the pricing process can be executed for all resources at the timing of completion of answer reception set when registering the question resource.
- a job scheduler capable of detecting an arbitrary event and starting a specific program 1512 is installed in the program 151 or the job scheduling is performed. It is preferable to link middleware capable of executing the above with this system.
- each resource point changes dynamically each time the pricing process is executed.
- the server can generate a graph showing the temporal transition of the resource points. And such a transition graph can be shown with respect to the user who has a resource.
- the user can always check the transition of the resource point from the initial resource point of the resource posted by the user. This makes it possible to check each time “how useful information the resource posted by itself was”. And since the said resource point is a relative and objective evaluation with respect to the whole community, it can be said that it is a reliable value through the community.
- the point evaluation payout server 13 includes means for presenting information such as D141 to D143 to the user's browser.
- Each of the plurality of resources stored in the resource table 42 has a resource ID for identifying the resource and a resource point associated with the resource ID.
- the resource point is calculated for the resource, and the entry in the resource table 42 is updated.
- the resource tag relation table (45) is a tag ID associated with one of the resource IDs and one of the resource IDs for identifying a tag extracted from the resource identified by the resource ID.
- One or more resource tag related information including a tag ID is stored.
- the processing device 14 of the point evaluation payout server 13 first uses the resource point calculation function to center the all resources in the community using the resource classification link, tag link, and action link described above.
- a value can be calculated for each resource.
- “resource central value calculation by tag using tag / link resource list” (S1501) and / or “resource central value by user's action using behavior link resource list” “Calculation” (S1502) is used.
- the “center value” refers to a value that relatively indicates the objective centrality of a specific resource viewed from the entire resource group having one or more resources, and includes the tag link and / or the above-described tag link and / or Alternatively, it can be calculated by using action links and these resource lists. That is, as the specific resource and many other resources are directly / indirectly linked and have a relationship, the central value becomes higher, and conversely, the direct / indirect relationship The smaller the value, the smaller the central value.
- processing execution timings of “resource center value calculation using tags using tags / links” (S1501) and “resource center value calculation using user actions using behavior links” (S1502) are the timings described above. For example, when the resource points are presented to the user in real time according to the action event from the user as in timings T1302 and T1303, only the processing of S1502 is executed. It can also be set to reduce the pricing process. These are set by the operation manager by the community operation management function 37.
- FIG. 16 is an example of a processing flow related to “resource center value calculation using tags using tags / links” (S1501) in FIG.
- the outline is as follows. That is, based on one or more resource tag related information stored in the resource tag related table (45), a resource list corresponding to the hop number value for one resource ID is represented as the hop number value.
- each of the generated resource lists includes one or more resource IDs.
- each tag ID associated with each resource ID included in the resource list generated immediately before is based on the resource ID included in the associated resource tag related information.
- “immediately before” means, as will be described later, a resource list that is most recently generated among one or more resource lists that are generated according to the number of repetitions in the repetition process.
- the resource point calculation function 38 includes a module for calculating the resource center value (S3401). Further, the resource point calculation function 38 further includes a module for calculating a resource point identified by the one resource ID based on the first resource central value (S3404). The point is presented to the user by means of presenting the calculated point to the interface (D143).
- a resource central value evaluation target resource (hereinafter referred to as an evaluation target resource) is selected, and the tag link is displayed.
- an evaluation target resource a resource central value evaluation target resource
- the tag link is displayed.
- a tag of the resource to be evaluated is extracted (S1601). That is, by extracting the value of the tag ID of the resource tag correspondence information having the value of the selected resource ID as the resource ID value of the resource tag correspondence information from the resource tag association table 45, the resource ID is obtained. Extract the associated tag ID.
- a given minimum value is set as the resource center value by the tag (S1610), and then the resource center value calculation process is completed.
- a tag is extracted, a resource related to this tag is searched along the tag link, and a resource list with the number of hops “1” is generated by subtracting the evaluation target resource from the union. (S1603). This is to extract the resource ID of the resource tag correspondence information, which has the extracted tag ID value as the tag ID value of the resource tag correspondence information, and to sum the extracted resource ID values.
- a list of resource ID values from which the selected resource ID value has been deleted from the set is generated as a resource list with the hop count value for the selected resource ID as 1, and the temporary memory ( 153).
- the resource list with the value of the number of hops generated as 1 is extracted from the resource tag related table (45) by the module for generating the resource list included in the resource point calculation function.
- the resource tag association table 45 is further searched, and the resource ID included in the resource tag association information further associated with each tag ID associated with the evaluation target resource ID is extracted and extracted. It is generated as a list consisting of resource IDs obtained by removing the evaluation target resource ID from the set of resource IDs.
- a resource list (S1608). That is, in this step, the resource list is repeatedly generated while incrementing the hop count value from 2 (S1606) until the given condition (S1607) is satisfied, where the hop count value is an integer greater than or equal to 2. And storing in the temporary memory (153) (S1608), and having the resource ID value of the resource list generated immediately before as the resource ID value of the resource tag correspondence information The value of the resource ID of the resource tag correspondence information having the extracted tag ID value as the value of the tag ID of the resource tag correspondence information is extracted. Are extracted, and all the first resource lists stored in the temporary memory are extracted from the union of the extracted resource ID values.
- the resource list corresponding to these hop numbers “n (n is a natural number, initial value is 1)” is stored separately in the temporary memory 153, and the “tag link is used. It is made available during processing of “resource center value calculation by tag”. Further, the processing from S1609 and S1604 to S1607 is repeated until a given condition is satisfied using this resource list.
- the given condition is that all the resources in the community stored in the resource table 42 are hit in the search and no new resource ID is extracted, or the value of the hop count n is incremented. As a result, it can be determined whether a given value has been reached (for example, “has n reached 10”).
- the value calculation process is completed (S1609).
- the resource list and link strength generated in this process can be temporarily stored in a temporary memory provided in the server.
- the resource to be evaluated here is “resource (ID) A”. (S1601) Tags corresponding to resource A, “tag 1 and tag 2” are extracted.
- the value of the hop count and the value of each resource ID included in each resource list corresponding to the value of the hop count are used as the resource ID value of the resource information stored in the resource table (42).
- the first resource center value for one resource information can be calculated.
- a first point for one resource information can be calculated and stored in the resource table as a resource point value of one resource information. (S1503).
- the value of the initial resource point of the new resource information described above is the value of the resource ID of the new resource information in the step of selecting a resource ID with the timing input via the interface as the first timing.
- the same calculation can be performed by selecting (S1601) and then executing the steps of generating and storing the resource list (S1603 and S1608) and calculating steps (S1604, S1605, S1609, and S1503).
- the initially stored resources are resources A, B, C, E, and F, and resource D (60 points) and resource G (40 points) have been stored by the time of this resource point calculation.
- the tag 3 is newly stored, the resource D, the tag 1 and the tag 3 are linked, and the resource G and the tag 3 are linked (17).
- the resource center value is the resource point for the resource A as it is
- the resource A is initially 30 points
- the resource point calculation affects the resource G from the resource B.
- it has changed to 52 points. That is, the resource point of each resource continues to change dynamically depending on the link status at the time of calculating the resource point.
- FIG. 18A is an example of a processing flow related to “resource center value calculation based on user action using action links” (S1502) in FIG.
- the user history table 44 mainly used in this processing includes one resource ID, a user ID associated with one of the resource IDs for identifying one user, and the resource ID of the resource ID.
- One or more user action correspondence information including one and an action classification for identifying a relationship between user IDs is stored.
- a module for calculating a user evaluation value for each of the user IDs associated with one resource ID based on one or more user action correspondence information stored in the user history table 44 (S1803, S3503, S1806)
- the resource points further associated with the resource ID of the user action correspondence information associated with the user ID by the resource table 42 ,
- Know the relationship of user IDs A user evaluation value of the user ID is calculated based on a value indicating an action category for performing the operation, and further, each of the user ID is obtained by a module provided in the resource point calculation function 38
- the second resource center value of one resource ID can be calculated based on the user evaluation value.
- a resource center value evaluation target resource (hereinafter referred to as an evaluation target resource) is selected, and a user ID of the evaluation target resource and an action log of the user are extracted along the action link.
- an action category extraction step (S1801) the resource ID value of one resource information selected as the evaluation target is provided as the resource ID value of the user action correspondence information stored in the user history table (44).
- the value of one or more user IDs of the user action correspondence information and the corresponding (first) action category value are extracted and stored in the temporary memory (153). That is, a list (user list) composed of user IDs associated with the evaluation target resource ID is generated by the user history table 44, and the associated action category (hereinafter referred to as “category I”) is the user history table.
- Each is extracted from 44 (S1801).
- a resource related to the user ID is searched along the action link, and a resource list corresponding to the user ID is generated by removing the evaluation target resource from the union. .
- This step includes the values of one or more resource IDs and the correspondences of the user action correspondence information having one user ID value as the user ID value of the user action correspondence information stored in the user history table (44).
- a list in which the value of the (second) action category is extracted and the value of the selected resource ID is deleted from the union of the extracted one or more resource ID values is selected as the resource ID selected
- This is realized by generating a (second) resource list for and storing it in the temporary memory (153) (S1803). That is, for one extracted user ID, user history information is searched from the user history table 44, and a resource ID included in the history information is extracted. Then, a set of newly extracted resource IDs obtained by removing the evaluation target resource ID and the resource ID included in the already created resource list from the extracted resource ID corresponds to the one user ID.
- a resource list is generated (S1803).
- an action category hereinafter referred to as “Section II” that associates the one user ID with each resource ID of the resource list is also extracted (S1803).
- “resource resource point ⁇ weight by section II ⁇ weight by section I” is calculated (S1805), and the total value of all the resources Is the evaluation value of the user ID (S1806). That is, the value of the (first) action category extracted in the step (S1801) of extracting the action category and the value of each resource ID included in the generated (second) resource list are displayed in the resource table ( 42) based on the resource point value of the resource information stored as the resource ID value of the resource information and the extracted (second) action category value for the resource ID value of the resource information. Then, the evaluation value of one user ID is calculated and stored in the temporary memory (153) (S1805).
- the above-described S1803 to S1806 are repeatedly executed for all the user IDs for each user ID of the user list corresponding to the number of steps extracted and created in S1801 or S1811 described later, and each evaluation for all the user IDs is performed. The value is calculated and stored in the temporary memory (153) (S1806).
- link strength [number of hops] is calculated (S1807). And it adds to the already calculated link strength. That is, “link strength + link strength [hop count]” is set as a new “link strength” (S1808).
- the hop count is incremented (S1809), and the user ID and action log extracted along the action link for the resource in the resource list are extracted. That is, from the user history table 44, a user ID further associated with each resource ID included in each resource list corresponding to each user ID included in the user list generated immediately before is extracted. Then, a set of newly extracted user IDs, excluding resource IDs included in any user list already created from the extracted user IDs, is expressed as a hop number “n (n is a natural number, The initial value is 1) ”is obtained as a new user list (S1811). At the same time, an action category (“Section I”) that associates each user ID with each resource ID of the resource list is also extracted (S1811).
- the processing from S1811 and S1802 to S1810 is repeated until a given condition (S1810) is satisfied using this user list.
- the resource center value calculation process by is completed (S1815).
- the user list, link strength, and extracted action log generated in this process can be temporarily stored in a temporary memory provided in the server.
- “predetermined number of hops 2”. Under these, the “resource center value by user action” is calculated by the resource center value calculation process.
- the resource to be evaluated here is “resource (ID) A”.
- the user list with the hop number 1 from the resource A is “user (1, 2)”, and the user list with the hop number 2 is “user (3)”.
- the resource list corresponding to “user 1” is “resource source (E, F)”, and the resource list corresponding to “user 2” is “resource source (B, C, D)” and “user 3”.
- the resource list corresponding to is “Re source (G)”.
- the resource central value is the resource point for the resource A as it is
- the resource A was initially 30 points, whereas the influence of action link generation by this resource point calculation. It has changed to about 50 points. That is, the resource point of each resource continues to change dynamically depending on the link status at the time of calculating the resource point.
- the object of the resource centrality evaluation is new between the time of the last evaluation and the time of the main evaluation. It is also possible to have only the action links generated at the same time, that is, only the difference action links. In this case, it is possible to obtain the link strength of each resource by calculating the link strength for the difference behavioral link in each resource and adding the link strength to the previously calculated link strength.
- the point for one resource information is based on the calculated first resource center value and / or the calculated second resource center value for one resource information at the first timing described above. Is calculated and stored in the resource table (42) as the value of the resource point of the one resource information (S1503).
- the processing is the point evaluation dividend server
- the thirteen processing devices 14 can use the resource point calculation function to directly regard the resource center value as the resource point of the resource, and update the resource point value of the resource table 42 for each of all resources. can do.
- the input is both “Calculate Resource Central Value by Tag Using Tag Link” and “Calculate Resource Central Value by User Action Using Behavior Link”, “Use Tag Link for All Resources”
- the two resource center values are balanced by the ratio (flow ratio) so that the total value of “Calculate Resource Center Value Using Tag” and the “Calculation of Resource Center Value Based on User Action Using Action Link” are equal.
- the resource point of the resource is obtained by taking the average of the resource center value after the equilibrium.
- the value of the resource point in the resource table 42 can be updated for each of all resources.
- the point evaluation payout system in the present invention is not limited to these.
- the pricing process in the second embodiment described above, and the process of automatically extracting tags from the resource group stored in the resource table 42 Can be combined. More specifically, one or more keywords extracted from the resource group stored in the resource table are used, and the tag corresponding to the resource is set at an arbitrary timing in cooperation with the dictionary system (database) 19.
- the tag table 43 and the resource tag association table 45 can be updated. This automatic tag extraction makes it possible to realize dynamic update of the tag link and automatic update of resource points of resources based on automatic accumulation in the tag table 43. The resource points for each resource are even more objective.
- the tag automatic extraction function 39 is a function for extracting a tag from a resource to be extracted and further associating the resource with the tag as described above.
- the description regarding the said program is only for the purpose of illustration, and is not limited to these.
- one or more first texts newly stored in the above-described resource storing step (S1204) that is, second texts extracted from the resources, respectively, and the tag table (43
- the new second text that has not been stored as the tag of the tag information stored in () is newly added to the tag table (43) as the tag information of the new tag information together with the tag ID value of the new tag information.
- a step (S2004) relating to the tag extraction and storage to be stored, and new resource tag correspondence information including the value of the resource ID of the newly stored resource information and the value of the tag ID of the new tag information The step of storing in an association table (45) is provided.
- the second text extracted from the first text in the present embodiment extracts a first keyword group including one or more first keywords from the first text (S2002, S2101), the second database (19) stored in the storage device of the second server configured on the network, the second database linked with the database (152) of the server (13) by the application interface Searching the word corresponding to each first keyword by using each first keyword of the first keyword group for a text set including a plurality of pairs of words and their descriptions stored in (19).
- the description of the word that matches the first keyword is acquired (S2002, S2102), and the acquired Further, a second keyword group including one or more second keywords is extracted (S2002, S2103), and a resource table (42) is used using each second keyword included in the second keyword group. It is characterized in that it is extracted by searching the resource of the resource information and deleting from the second keyword group the second keyword stored as a given number or more as the resource (S2003, S2104 to S2107). .
- the processor 14 of the point evaluation payout server 13 uses the automatic tag extraction function 39 at any timing such as when registering resources, once per day, every day at midnight, or when receiving an answer to a questioned resource or when an event is detected.
- the program can be activated to start the tag automatic extraction process (S2001).
- S2002 keywords are extracted from one or more resources to be subjected to tag extraction, and m keywords and TF / IDF values satisfying a given requirement from the keywords through cooperation with the dictionary system 19. Is generated as an element.
- n tags are extracted from the m feature vectors using a genetic algorithm.
- the dictionary system 19 is a system having an input / output interface function that includes a keyword and its explanatory text as contents, and outputs an explanatory text of the keyword when the keyword is input.
- the point evaluation payout system according to the present invention may be provided inside the system, or may be configured to interact with a known dictionary site on the network using an API. Also, known evaluation methods and algorithms can be applied to the TF / IDF values and genetic algorithms.
- FIG. 21 is an example of a processing flow related to the above-described feature vector extraction (S2002 in FIG. 20) in the present embodiment.
- the processing device 14 of the point evaluation payout server 13 Upon receiving the feature vector extraction start instruction, the processing device 14 of the point evaluation payout server 13 first extracts keywords by a known morphological analysis method and sets them as the first keyword group (S2101). Next, in cooperation with the dictionary system 19 described above, an explanation for the keyword is acquired, and the extraction target resource is expanded by connecting the extraction target resource and the acquired explanation (S2102). Then, the keyword is re-extracted by using the morphological analysis method again and set to the second keyword group (S2103), and the TF / IDF value of each keyword in the second keyword group is calculated (S2104).
- the TF / IDF value can be calculated based on the following known calculation formula.
- tf_ij is the appearance frequency of the keyword i in the resource j
- df_i is the number of extraction target resources including i
- N is the number of extraction target resources. It is the total number.
- a keyword having a value larger than a given threshold is extracted and registered as an element of the feature vector together with its appearance frequency (S2105). Then, the number of resources having each keyword of the registered feature vector is calculated (S2106), and the keyword having a value larger than a given threshold is deleted from the feature vector. The vector is determined (S2107). This completes the feature vector extraction process.
- the database 152 newly includes a table in which the association between the keyword and the resource having the keyword is defined, and the keyword is stored in the table at the timing when the keyword is deleted from the feature vector and associated with the resource. Another effect is that resource grouping can be performed automatically.
- FIG. 22 is an example of a processing flow relating to tag extraction (S2003 in FIG. 20) using the above-described genetic algorithm in the present embodiment.
- the processing device 14 of the point evaluation payout server 13 uses the keyword group registered in the feature vector as a tag candidate group for resource extraction, and extracts a tag group from the tag candidate group by a genetic algorithm. Can be performed.
- an individual having a given number of tag candidates is randomly generated a given number of times, so that a parent individual group (first generation individual group) having a genotype as a tag set can be obtained ( S2201).
- a parent individual group first generation individual group
- crossover is performed, and a child individual group can be generated by repeating the crossover for a given number of times (S2202).
- the individual evaluation value of each individual is calculated (S2203).
- the individual evaluation can be the number of resources including one or more of a given number of tag candidates that the individual has.
- a population for the next generation is selected and a next generation population is generated (S2204).
- the individual evaluation value of each next generation individual is calculated, and the best evaluation value in the next generation individual group is extracted (S2206). If the highest quality evaluation value exceeds the highest quality evaluation value of the previous generation, that is, if evolution is observed, the process returns to S2202, and crossover processing is performed again. If the best evaluation value does not exceed and evolution has been completed, the individual having the best evaluation value is regarded as the optimum individual (S2206), and tag candidates that are the genotypes of the optimum individual are extracted. The tag of the target resource can be determined and set (S2207).
- an account (account) of a user who has one or more other resources included in the above-described resource division link or tag link for one questionable resource is included in the above-described resource division link or tag link for one questionable resource.
- the distribution points calculated by a given method can be distributed (hereinafter referred to as “reward distribution”).
- the processing device (14) further provided in the server (13) including the temporary memory (153) changes the resource point value of one resource information to the resource point value of other resource information. Based on this, it is possible to increase and decrease the account points based on the calculation and storage.
- the user table (41) stores two or more user account information including a user ID uniquely identifying the user and an account point associated with the user ID.
- the resource table (42) is one posting user ID associated with the resource ID of the resource information when storing two or more pieces of resource information, and the value of the posting user ID is the resource information.
- Each resource includes a posting user ID, which is the value of the user ID of the user who entered the text.
- the action categories of the two or more user action correspondence information stored in the user history table (44) include categories representing questions, answers, negative evaluations, positive evaluations, and browsing, and values corresponding to the categories The value of the category.
- the user ID value of the user who has input the (first) text via the interface (21) is added to the user who posted the new resource information.
- the value of the resource ID of the new resource information, the value of the posting user ID of the new resource information, and any one of the action categories other than browsing User action correspondence information including a value corresponding to the selected category is stored in the user history table (44). Further, any of the resource ID values of the resources included in all the resource information stored in the resource table (42) is designated at a timing designated by an arbitrary user via the interface (21).
- User action correspondence information including an ID value, a user ID value for identifying the designated user, and a value corresponding to a category representing browsing is configured to be stored in the user history table (44). Based on the information stored in each table, reward distribution using the point evaluation payout system according to the present invention can be performed.
- the points in the system described above may be numerical values including a decimal point in terms of calculation.
- these values are all stored in the above-described tables as integer values with values after the decimal point rounded down.
- the user A can make an initial investment for posting the question resource using the initial resource point calculated in the second embodiment described above as the investment resource point (S2301). ).
- the evaluation resources are posted by the users C1 and C2, and the answer acceptance deadline is over, all the resources in the community including the posted answer resources and the evaluation resources Pricing is performed (not shown).
- a given ratio of investment resource points is paid as a direct payout point (direct payout) and distributed to the accounts of the users B1, B2, C1, and C2 ( S2302 and S2303).
- the user D when the user D has not posted the answer resource and the posted resource directly to the question resource, but is a user who has posted a resource that is accidentally related to the resource at another opportunity, the user D's The posted resource is also subject to a dividend of investment resource points (indirect dividend), and the account of the user D is also paid a given percentage of the investment resource points as an indirect dividend point (S2304). Further, the fractional resource points generated through the calculation of the direct dividend and the indirect dividend are collected in the operator account (S2305).
- FIG. 24 shows a list (1514) of suitable functions in this embodiment, and further, reward distribution from function 31 to function 39 included in the program 1513 of the point evaluation payout system in FIG. 19 in the third embodiment described above.
- a function 40 is added.
- the reward distribution function 40 accepts the investment of resource points by the user when registering the question questions, calculates the distribution destination of the investment resource points and the dividend points to the distribution destination at the end of the answer reception, and the account of each related user ⁇ Increase or decrease points.
- the account points are points that the user's account (account) stored in the user table 41 has, and the investment at the time of posting the question resource by the user and the reward distribution in direct dividend and indirect dividend It is a point that sometimes increases or decreases.
- a given ratio at the time of calculating the direct payout points and / or the indirect payout points can be set in advance by the community operator by the community operation management function 37 described above.
- FIG. 25 shows a flow (25) related to the response resource registration flow to the point evaluation payout server by the client terminal A.
- an account withdrawal process S2503 by the processing device 14 is added, and the user stored in the user table 44 at this timing A's account points can be subtracted and stored.
- the “formal resource input” of the question resource input is only given when the user sees the resource points and decides to invest. If “registration” is performed and it is determined not to invest, “provisional registration” can be canceled without performing “formal registration”.
- the reward distribution process in the present embodiment can include a direct payout process, an indirect payout process, and a fraction collection process.
- the point investment step (S2503) the user who has the value of the posting user ID of the new resource information as the value of the user ID of the user account information stored in the user table (41).
- the initial resource point of the new resource information stored in the resource table (42) is subtracted from the account point value of the account information, and the subtracted result is further added to the account account of the user account information.
- the step (S2503, S2504) is characterized by increasing or decreasing the account point value by storing it in the user table (41) as the point value.
- all the tag information stored in the tag table (43) further includes a tag point, and the tag point of one tag information indicates the value of the tag ID of one tag information.
- One or more resource ID values of the resource tag correspondence information that have as tag ID values of the resource tag correspondence information stored in the resource tag association table (45) are further stored in the resource table (42). It is possible to store a value obtained by summing up the resource point values of the resource information that have as resource ID values of the stored resource information.
- the method includes a step of calculating points for all tag information and storing them as tag point values of tag information in the tag table, and a reward distribution step described below. It is characterized by that.
- the reward distribution step in the present embodiment is as described above at the (second) timing specified when (i) the (first) text of the resource of the new resource information is input via the interface (21).
- the resource ID value of the new resource information to be evaluated is selected in the selection step, and (ii) the number of hops for the resource ID of the new resource information is set to 1 in the first resource list generation storage step (1603).
- Each resource ID value of the resource list is included as the resource ID value of the resource tag correspondence information stored in the resource tag association table (45).
- One or more tag ID values of the resource tag correspondence information are further stored in a tag table (4 ) Of the tag information of the tag information stored in (), the tag point values of the tag information respectively included in the tag information stored in The sum of the values is calculated and stored in the temporary memory (153). (Iv) The sum of the tag point values is calculated from the initial resource point values of the new resource information stored in the resource table (42). Based on the ratio, the payout points for each resource ID included in the resource list are calculated and stored in the temporary memory (153), and (iv) each payout point stored in the resource list is stored in the resource list.
- the pricing process is executed for all the resources in the community by the pricing in the second embodiment described above. (S2601), and thereafter reward distribution processing is started.
- an answer resource or an evaluation resource is registered for the question resource, that is, when an answer resource or an evaluation resource related to the question resource is included in the resource association table 46 (S2602), Each resource is directly subject to distribution of dividend points.
- the processing device 14 starts payout processing directly by the reward distribution function 40 (S2603).
- a point that is a given ratio for “direct dividend” out of the investment resource points and that is a given ratio for “response resource dividend” (For example, for an investment resource point of 1000 points, 500 points, which is 50%, are for direct dividends, and among them, 300 points, which is 60%, are for response resource dividends)
- proportional distribution according to the resource point value of each answer resource is performed (S2604).
- the resource classification link includes answer resources V and W
- the payout point for resource V is 100 points
- resource W Dividend points will be 200 points.
- a point that is a given percentage for “direct dividend” out of investment resource points and a given percentage for “evaluation resource dividend” For example, for an investment resource point of 1000 points, 500 points, which is 50%, are used for direct dividends, and among them, 200 points, which is 40%, are used for evaluation resource dividends.
- Even distribution is performed by the number of evaluation resources included in the resource classification link (S2605). In the case of this example, if the evaluation resource X, Y is included in the resource classification link, the payout point for each resource is 100 points.
- the allocation of evaluation resources is equal in the present embodiment, but for example, in the same manner as the above-mentioned allocation of answer resources, a mode of proportional distribution according to the resource point value of each resource may be adopted.
- the direct payout process is completed by adding each direct payout point to the account point of the user having each resource (S2606).
- tags are extracted from the resource group included in the resource classification link (S2701).
- the tag extraction process is not limited to the timing after the reception of the answer, but may be performed at the same time as the event of storing the resource in the resource table 42 and / or periodically such as one day / times. It may be a regular process.
- the tag extraction target is a resource group in the present embodiment, it is not limited to this, and it may be, for example, only a question resource. Whether there is a resource associated with the same tag as the extracted tag using the resource tag relation table, that is, whether there is a resource linked in one hop through the extracted tag in the tag link described above. It judges for every tag (S2702).
- indirect payout processing is started (S2703).
- the total value of the resource points possessed by the resource associated with the tag is calculated as a tag point, and stored in the tag point of the tag table 43 related to each extracted tag (S2704). ).
- use a certain percentage of the “indirect dividend” of the investment resource points for example, 500 points, which is 50% of the investment resource points of 1000 points, are for indirect dividends
- proportional distribution is made to these resources in accordance with the total value of the tag points of the tags related to each resource to obtain indirect payout points (S2705).
- the tag link includes an evaluation resource XX having tags A and B, and YY having a tag C.
- the tag point of tag A is 300 points
- the tag point of tag B is 500 points
- 500 payout points are proportionally distributed to each resource at a ratio of (300 + 500): 200. That is, the payout point for the resource XX is 400 points, and the resource YY is 100 points.
- the proportionally distributed points are further redistributed using the resource classification link. That is, with respect to a resource related to the same tag as the extracted tag, it is possible to further target up to the resource included in the resource classification link of the resource (S2706).
- the indirect payout points are given percentages set for each resource category (for example, 40% for “question resource”, 40% for “answer resource”, and “evaluation resource”). In accordance with 20% in total (100%), allocation is made to the resource, and the final indirect payout point is obtained (S2707).
- 100 points proportionally distributed to the resource YY (question resource) are further distributed again by the answer resource ZZ and the evaluation resource ZZZ included in the resource classification link, and are assigned to the question resource YY, the answer resource ZZ, and the evaluation resource ZZZ. Will be allocated 40 points, 40 points and 20 points, respectively.
- the direct dividend point and / or the indirect dividend point may be a decimal value because of proportional distribution and equal distribution calculation. In this case, rounding to an integer value is performed by rounding down the fractional part (fraction).
- fraction collection processing for collecting fractional points can be executed so that inconsistency does not occur in the total value of resource points distributed in the community. If it is determined that a fraction has been generated in the calculation of the direct dividend point and / or indirect dividend point (S2709), the sum of these fractions, that is, the difference between the investment resource points and the total dividend points rounded to an integer value is It is collected by the operator (S2710).
- the collected points are managed by using an operation management table 48, which will be described later in the fifth embodiment, and can be used for reuse of later points.
- the operator collects fractions in this way, it is possible to prevent inconsistency in the total value of the resource points distributed in the community, and to ensure the stability of the community. Furthermore, the operator can also redistribute in the form of transferring to a specific user account using the points.
- indirect payout processing in addition to direct payout processing, by implementing indirect payout processing, not only point distribution between resources by resource classification links but also between resources sharing tags by tag links It will be possible to distribute points. Furthermore, not only the direct resource communicative relationship by the resource classification link, but also the indirect resource communicative relationship and its degree through the tag can be explicitly shown to the user who posted the resource. Become.
- the point evaluation payout system realized by using all the embodiments from the first embodiment to the fourth embodiment is a resource in the community.
- the pricing process executed when calculating resource points the flow rate of points calculated from the occurrence of point movement within the community within a certain period can be applied as a parameter at the time of calculation.
- a new pricing process can be provided.
- “point movement” refers to an account that includes point investment at the time of posting the question resource in the fourth embodiment described above, direct dividends and indirect dividends of points after acceptance of responses, and collection by the operator at the time of dividends Point movement between them, and collection of points by the operator at a given timing using a negative interest rate set in advance by the operation manager.
- Points collected at the negative interest rate will be collected at the given time from the account points of all users in the community at the given time for each user's account points x interest rate (however, the fraction is rounded down to an integer value) ) Is subtracted and used as a recovery point for the operator.
- the value of the negative interest rate and the timing of collection by the operator can be set by the community operation management function 37 described in the second embodiment.
- the negative interest rate means a given point interest rate for the operator to collect points from the user account at a given timing. For the user, the account points will be reduced, so the interest rate is negative.
- the resource point values of all resource information stored in the resource table (42), the tag point values of all tag information stored in the tag table (43), and the user table (41) are all integer values obtained by rounding down values after the decimal point.
- the database 152 of the point evaluation dividend server is further an operation management table (48), and the amount of movement points such as the time when point movement occurs, collection points and expenditure points are shown.
- a table for storing the starting point movement record is provided.
- the point distribution management table (49) is provided with a table for storing distribution information including the total distribution point amount for a certain period, and can be used for managing the point distribution within the community (28).
- the value of the initial resource point of the new resource information stored in the resource table (42) is used as the value of the expenditure point, and the value of the resource point of the new resource information and the temporary memory (153)
- the management information (48) is stored in the management table (48) with the difference from the total value of the payout points stored in the point as the value of the collection point and the (second) timing time as the point movement time value. ing.
- the value of each account point included in all user account information stored in the user table (41) is multiplied by a given ratio, and the multiplication is performed.
- the value obtained by rounding off the decimal point from the result is subtracted from the value of each account point, and the subtracted result is used as the account point value of the user account information in the user table (41).
- Managing the management information with the storage step and the integer value as the value of the expenditure point and the recovery point of the management information stored in the operation management table (48), and the time at the timing as the value of the point movement time A step of storing in the management table (48) is provided.
- the database (152) further includes a point distribution management table (49) for storing two or more point distribution information including the total distribution points.
- the management information stored in the operation management table (48) by the two steps of storing the management information described above at the first timing has Step (S301) of calculating the total value of the expenditure points and storing the calculated total value in the point distribution management table (49) as the value of the total distribution points, (ii) of the stored total distribution points Value and the point distribution information stored immediately before the point distribution information that has already been stored.
- the expenditure point means a point invested by the user when posting the question resource, a point collected by a negative interest rate, that is, a point spent from the user account.
- the collection point means a point collected in the manager account for this expenditure.
- produce it is recorded on the said operation management table (48).
- the same value can be simultaneously set to the said collection
- FIG. 29 shows an example of a pricing flow in the present embodiment.
- the processing device 14 of the point evaluation payout server 13 calculates a point flow rate (increase rate) in the community. Have been added.
- the flow ratio calculated in this process can be used as one of the input parameters in the resource point calculation process in S292.
- the pricing (resource point calculation function) 38 it is possible to provide a function of calculating the total circulation amount of these points for a certain time.
- FIG. 30 shows an example of a specific processing flow related to the “community point flow ratio (increase rate) calculation process” (S291) described in S291 of FIG. 29 in the present embodiment.
- the total points spent from the user's account points during a certain period are calculated and set to Tep (S301). This Tep is calculated as the total distribution point Tp (n) (S302).
- the intra-community total distribution point increase rate lp can be calculated based on the ratio with the previously calculated total distribution point Tp (n ⁇ 1) (S303).
- the community point flow ratio (increase rate) calculation process is thus completed.
- the above-mentioned total distribution point increase rate lp in the community is used as described in the above-mentioned “tag link resource list”.
- the resource point value is calculated by multiplying it with the resource point calculated using the resource center value calculation by the tag and / or the resource center value calculation by the user action using the action link resource list. Can be updated.
- the value calculated in this way reflects the point distribution status of the entire community during the pricing process.
- the stability may be controlled by forcibly setting it to a given value.
- the user table mainly stores the user ID and the user center value associated with the user ID
- the user association table (311) stores one of the user IDs and one of the user IDs.
- One or more user-related information including a user ID of the user ID and a user-related type for identifying the relationship between one of the user IDs and another user ID is stored, and processing is performed based on the information. .
- “resource central value by tag” (first resource central value) and “resource central value by user action” (second resource central value) are used as resource central values representing the centrality of resources.
- the resource points were calculated based on this assumption.
- the concept of “user link” indicating a link between users is newly taken into consideration in the above-mentioned “calculation of resource center value by user action”.
- a value obtained by dividing the “resource central value by tag” and the “resource central value by the user's action considering the user link” is defined as “resource supply / demand value”, and based on the “resource supply / demand value” It is characterized by performing “resource pricing” and calculating final resource points.
- the resource point calculation function 38 has a module for calculating the value of the user central value stored in the user table (41) for one user ID (S3306), and is stored in the user table (41).
- the user center value is the value of each user center value further associated by the user table (41) with each of the other user IDs associated with the one user ID stored in the user association table (311). And each user-related type for identifying the relationship between the one user ID and the other user ID.
- the resource point calculation function 38 further responds to the user behavior associated with one resource ID stored in the above-described user history table (44), with the second resource central value of the one resource ID described above being further stored. It is characterized by comprising a module for calculating based on each value of the user center value further associated with each user ID of information by the user table (41).
- FIG. 31 shows a list of suitable tables and relationships (31) in this embodiment, which is an improvement of FIG. 4 shown in the first embodiment.
- a user related table 311 is added, “resource supply / demand value”, “first resource center value” and “second resource center value” are stored in the resource table 42, and “user center” is stored in the user table 41. Value has been added.
- the user relation table 311 is a table that stores user relation information, that is, information that associates one user ID and another user ID (user ID) together with a “relation type” indicating a relation between users. .
- the “relationship type” includes, for example, “register with favorite user (F)” and “register with reject user (D)”.
- a link (hereinafter referred to as a “user link”) between a plurality of users configured by information included in the user-related table 311 described above is shown.
- the user link between the user 1, the user 2, the user 3, and the user 4 illustrated in FIG. 32A is configured by storing information in the user association table 311 in the form illustrated in FIG. 32B.
- the user with the user ID “2” is “registered as a favorite user” from the user with the user ID “4”, and the user with the user ID “3” is “from the user with the user ID“ 1 ”. “Registered as a refusal user (D)” and registered as a favorite user from the user with the user ID “2”.
- the user with the user ID “4” is “registered as a favorite user” from the users with the user IDs “1” and “2”, and “registered as a rejected user” with the user with the user ID “3”. ing.
- the centrality of each user in the user link can be objectively evaluated. This is because the more users who are registered as “favorite users” for a certain user in the community, the higher the centrality of the users, and the more users who are “registered as rejected users” This is based on the consideration that the centrality is low.
- FIG. 33 is a processing flow showing the steps executed by the processing device of the server in order to calculate the user center value of such a user ID. That is, first, a user ID that is a user center value calculation target is specified (S3301). Next, all user IDs associated with the target user ID and their associated types are extracted from the user association table 311 (S3302). When the user ID associated with the target user ID is not extracted (S3303), the user central value of the target user ID is stored as “1” in the “user central value” of the user table 41 (S3304). When the user ID associated with the target user ID is extracted (S3303), the user center value of all the extracted target user IDs is extracted using the user table 41 (S3305).
- the center value of the user ID “4” is calculated (S3301).
- the user IDs “1” and “2” of the relationship type “F” and the user ID “3” of the relationship type “D” are extracted from the user relation table (S3302 and S3303).
- the user center value of the user ID “1” in the user table 41 2.0
- the user center value of the user ID “2” 0.5
- the user center value of the user ID “3” 1. If it is 0, these values extract the user table (S3305)
- Each of the plurality of resources stored in the resource table 42 has a first resource central value, a second resource central value, a resource supply / demand value, and a resource point. Then, the system calculates the first resource center value, the second resource center value, the supply and demand value, and the resource point for a specific resource and / or all resources in the community by the pricing process, and is calculated respectively. Each item in the resource table 42 is updated with the obtained value.
- the processing device 14 of the point evaluation payout server 13 can first calculate the center value of each resource in the community using the tag link and the action link by the resource point calculation function. it can.
- “resource central value calculation by tag using tag link resource list” (S3401) and / or “user using behavior link resource list considering user link” "Resource center value calculation based on action” (S3402) is used.
- step S3403 a value obtained by dividing these “resource central value by action” (second resource central value) and “resource central value by tag” (first resource central value) is calculated as a supply and demand value and stored in the resource table 42 (
- the resource point of each resource is determined by normalizing the resource supply and demand value with a preset point gap (S3404).
- the “central value” refers to a value that relatively indicates the objective centrality of a specific resource as viewed from the entire resource group having one or more resources, and includes the tag link and / or the above-described tag link and / or Alternatively, it can be calculated by using action links and these resource lists. That is, as the specific resource and many other resources are directly / indirectly linked and have a relationship, the central value becomes higher, and conversely, the direct / indirect relationship The smaller the value, the smaller the central value.
- the “supply and demand value” is calculated based on these “resource center value by action” (second resource center value) and “resource center value by tag” (first resource center value). The value is stored in the resource table 42 in association with one resource ID.
- the resource point calculation function 38 includes a module for calculating supply and demand values based on the first resource central value and the second resource central value.
- a suitable “supply / demand value” a value obtained by dividing these “resource center value by action” and “resource center value by tag” can be used.
- the “resource center value by action” indicates how much the resource is required by the users in the community, and is considered to be “the amount of resource demand in the community”.
- the “resource central value by tag” indicates how scarce the resource is in the community, and is considered to be “the supply amount of the resource in the community”. Therefore, the balance between the demand and supply, that is, the “supply / demand value” by dividing, is based on the consideration that the true value of the resource in the community is shown.
- the “supply / demand value” is merely a value indicating a balance between the demand amount and the supply amount, and therefore when the resource interface is actually presented on the user interface, the resource supply / demand difference (for example, Normalized to give a difference of 1/10 to 10 times within the range of a given resource point with respect to the average value of supply and demand values of the entire community, that is, all resources stored in the resource table
- the value may be adopted as a resource point (S3404), and for example, a graph (D142) as shown in FIG. 14 may be created and presented.
- the graph (D142) is a table (not shown) that stores the resource point identified by the resource ID and the date and time when the resource point was calculated.
- the date and time is the date and time when the resource was input.
- the presenting means provided in the point evaluation payout server 13 is further identified by one resource ID stored in the table, based on a table that includes the date and time including regular, scheduled, and / or arbitrarily set timing. Created based on the date and time associated with the resource being played and presented to the interface.
- the resource point identified by one resource ID is obtained by assigning the resource supply / demand value associated with the one resource ID in the resource table 42 to all resource IDs stored in the resource table 42. It is calculated based on normalizing the value of all the resource supply-and-demand values associated with a given range.
- FIG. 37 is an example of a processing flow related to “resource center value calculation by tag using tag / link resource list” (S3401) in FIG.
- This flow is stored in the resource table 42 for the resource IDs included in the created resource list in step S3704 in the processing flow related to “resource center value calculation using tags” shown in FIG.
- Other processes are the same as those described in the second embodiment and FIG.
- FIG. 35 is an example of a processing flow related to “Calculation of resource center value by user action using action link resource list considering user link” (S3402) of FIG. This flow is the processing flow related to “resource center value calculation by user action” shown in FIG. 18A.
- the resource point of the resource in the community calculated in the present embodiment is related to the resource.
- the value of the user can also be reflected.
- the “resource center value by user action considering user link” is calculated by the resource center value calculation process.
- the resource to be evaluated here is “resource A”.
- the user list of the hop number 1 from the resource A is “user (1, 2)”.
- the resource list corresponding to “user 1” is “resource source (E, F)”, and the resource list corresponding to “user 2” is “resource source (B, C, D)”.
- S1801 The user list “user (1, 2)” and section I (A, + R) with one hop is extracted.
- the second embodiment is improved, the “user center value” by “user link”, and the “resource center value by tag” and “resource center by user action considering user link”
- a specific value for resource pricing characterized by defining a new "resource supply and demand value” that is a value divided by "value” and performing "resource pricing” based on the "resource supply and demand value”
- Points can also be distributed to users who have previously posted resources related to. That is, for a user who posts a question resource, it is possible to regard the spending behavior required at the time of resource posting as an investment behavior, and to encourage a high-quality resource posting by the question resource contributor.
- the relationship between the questioned resources, which has been estranged in the past, is strengthened, high-quality resources centered on tags can be collected, and the concept of groups with the same theme of tags can be formed.
- users who post resources and receive dividends can be expected to cultivate a sense of belonging to the group, which leads to high-quality resource posting.
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Accounting & Taxation (AREA)
- Theoretical Computer Science (AREA)
- Economics (AREA)
- Marketing (AREA)
- Finance (AREA)
- Development Economics (AREA)
- Human Resources & Organizations (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- Data Mining & Analysis (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
Description
(S1601)リソースAに対応するタグ、「タグ1およびタグ2」を抽出する。
(S1603)「タグ1およびタグ2」を用いてリソースを検索し、ホップ数1のリソース・リスト、「リソース(B、C、D、E、F)」を生成する。
(S1604)リンク強度[1]=1/(40+50+60+10+40)、すなわち1/200と算出される。
(S1605)リンク強度=1/200となる。
(S1606)ホップ数2にインクリメントする。
(S1607)リソースGがまだヒットしていないため、S1609へ進む。
(S1609)ホップ数1のリソース・リストに関連するタグ、「タグ1、タグ2およびタグ3」を抽出してリソース検索を行い、新規に抽出されたリソースGに対して、ホップ数2のリソース・リスト、「リソース(G)」を抽出する。
(S1604)’リンク強度[2]=2/70と算出される。
(S1605)’強度=1/200+2/70と算出される。
(S1606)ホップ数3にインクリメントする。
(S1607)’全リソースがヒットしたため、S1608へ進む。
(S1608)’タグによるリソース中心値=1/(1/200+2/70)(≒52)と出力して処理が完了する。
(S1801)ホップ数1のユーザ・リスト「ユーザ(1、2)」および区分I(A、+R)を抽出する。
(S1803)ホップ数1のユーザ・リスト「ユーザ(1、2)」を用いてリソースを検索し、「ユーザ1」に対応するリソース・リスト「リソース(E、F)」、「ユーザ2」に対応するリソース・リスト「リソース(B、C、D)」を生成する。また、区分II(+R、Q、V、V、Q)を各々抽出する。
(S1805およびS1806)ユーザ1の評価値=(Eの評価値+Fの評価値)={(10×(+2)×3)+(20×4×3)}=300、
ユーザ2の評価値 = (Bの評価値+Cの評価値+Dの評価値)={(40×1×(+2))+(50×1×(+2))+(60×4×(+2))}=660
と算出される。
(S1807)リンク強度[1]=1/(300+660)、と算出される。
(S1808)リンク強度=1/960、と算出される。
(S1809)ホップ数2にインクリメントする。
(S1811) ホップ数1のユーザ・リスト「ユーザ(1、2)」を用いてリソースを検索し、ホップ数2のユーザ・リスト「ユーザ3」および区分I(A)を生成する。
(S1803)’ ホップ数2のユーザ・リスト「ユーザ(3)」を用いてリソースを検索し、「ユーザ3」に対応するリソース・リスト「リソース(G)」を生成する。また、区分II(ーR)を抽出する。
(S1805およびS1806)’ユーザ3の評価値=(Gの評価値)=(70×0.5×3)=105、と算出される。
(S1807)’リンク強度[2]=2/105、と算出される。
(S1808)’リンク強度=1/960+2/105、と算出される。
(S1815)ユーザ行動によるリソース中心値=1/(1/960+2/105)(=約50)、と算出し、出力して処理が完了する。
第六の実施の形態は、第一の実施形態および第二の実施形態で示した構成を改良し、新たな「リソースの値付け」処理を示すものである。ユーザ・テーブルには、主にユーザIDと当該ユーザIDに関連付けられるユーザ中心値とが格納され、ユーザ関連テーブル(311)には、当該ユーザIDの1つと当該ユーザIDの1つに関連付けられる他のユーザIDと当該ユーザIDの1つおよび他のユーザIDの関係を識別するためのユーザ関連種別とを含む1つ以上のユーザ関連情報が格納され、これらの情報に基づいて、処理が行われる。
対象ユーザIDのユーザ中心値 =(1+関係種別「F」で関係付けられるユーザIDのユーザ中心値の和) / (1+関係種別ユーザIDのユーザ中心値の和)
として対象ユーザIDのユーザ中心値を算出し、ユーザ・テーブル41の「ユーザ中心値」に格納する(ステップS3306)。
ユーザID「4」の中心値=(1+2.0+0.5)/(1+1.0) = 1.75
を算出し、ユーザ・テーブル41に格納する(S3306)。
「リンク強度[ホップ数]=ホップ数/タグによるリソース中心値(第1リソース中心値)の合計」
を算出する点で異なっている。それ以外の処理については、第2の実施形態および図16で説明したとおりである。
「(ユーザの行動によるリソース中心値(第2リソース中心値))×(区分IIの重み)×(算出されたユーザ中心値)×(区分Iの重み)」
として評価する点(S3502)、の2点において異なっている。それ以外の処理については、第2の実施形態で説明したとおりである。
(S1801)ホップ数1のユーザ・リスト「ユーザ(1、2)」および区分I(A、+R)を抽出する。
(S3501)ユーザ1のユーザ中心値 = (1+0.0)/(1+0.0)=1.0、およびユーザ2のユーザ中心値 = (1+1.75)/(1+0.0)=2.75、を算出し、それぞれユーザ・テーブル41に格納する。
(S1803)ホップ数1のユーザ・リスト「ユーザ(1、2)」を用いてリソースを検索し、「ユーザ1」に対応するリソース・リスト「リソース(E、F)」、「ユーザ2」に対応するリソース・リスト「リソース(B、C、D)」を生成する。また、区分II(+R、Q、V、V、Q)を各々抽出する。
(S3502およびS1806)ユーザ1の評価値=(Eの評価値+Fの評価値)={(10×(+2)×1.0×3)+(20×4×1.0×3)}=300、
ユーザ2の評価値 =(Bの評価値+Cの評価値+Dの評価値)={(40×1×2.75×(+2))+(50×1×2.75×(+2))+(60×4×2.75×(+2))}=1815、と算出される。
(S1807)リンク強度[1]=1/(300+1815)、と算出される。
(S1808)リンク強度=1/2115、と算出される。
(S1815)ユーザ・リンクを考慮したユーザ行動によるリソース中心値=1/(1/2115)=2115、と算出し、出力して処理が完了する。
Claims (21)
- インターフェイスを介してユーザによって入力されるリソースについて、前記リソースのポイントを計算して出力するシステムであって、
前記リソースと、前記リソースを識別するためのリソースIDと、該リソースIDに関連付けられる第1リソース中心値と、を格納する第1格納手段と、
前記リソースIDの1つと、前記リソースIDの1つに関連付けられるタグIDであって、前記リソースIDで識別される前記リソースから抽出されるタグを識別するためのタグIDと、を含む1つ以上のリソース・タグ関連情報を格納する第2格納手段と、
前記第2格納手段に格納された前記1つ以上のリソース・タグ関連情報に基づいて、1の前記リソースIDについてホップ数の値に対応するリソース・リストを、前記ホップ数の値を1から順にインクリメントしながら繰り返し生成する第1生成手段であって、前記生成されるリソース・リストの各々は、1つ以上の前記リソースIDを含んでおり、直前に生成された前記リソース・リストに含まれる各前記リソースIDに関連付けられた各前記タグIDを、さらに関連付けている前記リソース・タグ関連情報に含まれる前記リソースIDに基づく、手段と、
前記ホップ数の値と、前記ホップ数の値に対応するリソース・リストに含まれる各前記リソースIDに前記第1格納手段によりそれぞれ関連付けられた前記第1リソース中心値の値とに基づいて、前記1のリソースIDの第1リソース中心値を計算する第1計算手段と、
前記第1計算手段で計算された第1リソース中心値に基づいて、さらに前記1のリソースIDで識別される前記リソースの前記ポイントを計算する第2計算手段と、
前記第2計算手段により計算された前記ポイントを前記インターフェイスに提示する提示手段と、を備えるシステム。 - 請求項1に記載のシステムであって、
前記第1生成手段で生成される前記ホップ数の値を1とする前記リソース・リストは、前記第2格納手段により前記1のリソースIDに関連付けられた各前記タグIDをさらに関連付けている前記リソース・タグ関連情報に含まれる前記リソースIDの和集合から、前記1のリソースIDを除くことで生成され、
前記第1生成手段で生成される前記ホップ数の値を2以上とする前記リソース・リストの各々は、前記直前に生成された前記リソース・リストに含まれる前記リソースIDに各々関連付けられた各前記タグIDをさらに関連付けている前記リソース・タグ関連情報に含まれる前記リソースIDの和集合から、既に生成されたいずれの前記ホップ数の値に対応する前記リソース・リストにも含まれない新たな前記リソースIDを抽出することで生成される、システム。 - 請求項2に記載のシステムであって、さらに
前記第1生成手段において、前記新たなリソースIDが抽出されなくなるまで、または、前記ホップ数の値が、インクリメントされた結果所与の値に達するまで、前記リソース・リストを繰り返し生成する、システム。 - 請求項1から3のいずれか1項に記載のシステムであって、さらに、
前記第1格納手段は、前記リソースIDに関連付けられる第2リソース中心値を格納することができ、
前記リソースIDの1つと、前記リソースIDの1つに関連付けられるユーザIDであって前記ユーザを識別するためのユーザIDと、前記リソースIDの1つおよび前記ユーザIDの関係を識別するための行動区分と、を含む1つ以上のユーザ行動対応情報を格納する第3格納手段と、
前記第3格納手段に格納された前記1つ以上のユーザ行動対応情報に基づいて、前記1のリソースIDに関連付けられる前記ユーザIDのそれぞれについてユーザ評価値を計算する第3計算手段であって、前記ユーザIDのそれぞれについて、前記ユーザIDを関連付けている前記ユーザ行動対応情報のリソースIDに、さらに前記第1格納手段により関連付けられた前記第2リソース中心値の値と、前記ユーザIDを関連付けている前記ユーザ行動対応情報のリソースIDおよび前記ユーザIDの関係を識別するための前記行動区分を示す値と、前記第3格納手段において前記1のリソースIDおよび前記ユーザIDの関係を識別するための前記行動区分を示す値と、に基づいて前記ユーザIDのユーザ評価値を計算する第3計算手段と、
前記第3計算手段で計算された、前記ユーザIDのぞれぞれの前記ユーザ評価値に基づいて、前記1のリソースIDの第2リソース中心値を計算する第4計算手段と、を備える、システム。 - 請求項4に記載のシステムであって、さらに、
前記ユーザIDと、前記ユーザIDに関連付けられるユーザ中心値とを格納する第4格納手段と、
第5格納手段であって、前記ユーザIDの1つと、前記ユーザIDの1つに関連付けられる他の前記ユーザIDと、前記ユーザIDの1つおよび前記他のユーザIDの関係を識別するためのユーザ関連種別と、を含む1つ以上のユーザ関連情報を格納する手段と、
1の前記ユーザIDについて前記第4格納手段に格納される前記ユーザ中心値の値を計算する第5計算手段であって、前記格納されるユーザ中心値の値は、前記第5格納手段に格納された前記1のユーザIDに関連付けられる前記他のユーザIDのそれぞれに、前記第4格納手段によりさらに関連付けられる各前記ユーザ中心値の値と、前記1のユーザIDおよび前記他のユーザIDのそれぞれの関係を識別するための各前記ユーザ関連種別と、に基づいて計算される手段と、を備えており、
前記第4計算手段で計算される前記1のリソースIDの第2リソース中心値は、さらに、前記第3格納手段に格納された、前記1のリソースIDに関連付けられた前記ユーザ行動対応情報のそれぞれのユーザIDに、前記第4格納手段によりさらに関連付けられた前記ユーザ中心値のそれぞれの値に基づいて計算される、システム。 - 請求項4に記載のシステムであって、前記行動区分は、出題、回答、ネガティブ評価、ポジティブ評価、および/または閲覧を含んでおり、前記行動区分を示す値は、各前記行動区分に対応して重み付けがされて設定される、システム。
- 請求項5に記載のシステムであって、前記ユーザ関連種別は、お気に入りユーザ登録、および/または拒否ユーザ登録を含んでいる、システム。
- 請求項4から7のいずれか1項に記載のシステムであって、さらに、
前記第1格納手段は、前記リソースIDに関連付けられるリソース需給値を格納することができ、
前記1のリソースIDについて、前記第1計算手段で計算された前記第1リソース中心値および前記第4計算手段で計算された前記第2リソース中心値に基づいて、前記第1格納手段に格納される、前記1のリソースIDに関連付けられる前記リソース需給値の値を計算する第6計算手段を備える、システム。 - 請求項8に記載のシステムであって、前記第6計算手段によって計算され格納される前記リソース需給値の値は、前記第2中心値と前記第1中心値との除算値に基づく、システム。
- 請求項9に記載のシステムであって、前記第2計算手段によって計算される前記1のリソースIDで識別される前記リソースのポイントは、前記第1格納手段において前記1のリソースIDに関連付けられた前記リソース需給値の値を、前記第1格納手段に格納された全ての前記リソースIDに関連付けられる全ての前記リソース需給値の値を所与の範囲で正規化することに基づいて計算される、システム。
- 請求項1~10のいずれか1項に記載のシステムであって、
前記第2計算手段によって、前記リソースIDで識別される前記リソースのポイントと前記リソースのポイントが計算された日時とを格納する第6格納手段であって、前記ポイントが計算された日時は、前記リソースが入力された日時並びに定期、定時および/または任意の設定されたタイミングを含む日時である手段を備え、
前記提示手段において、さらに、前記1のリソースIDで識別されるリソースについてのリソース・ポイント遷移グラフであって、前記第6格納手段に格納された前記1のリソースIDに関連した前記日時および前記ポイントに基づくリソース・ポイント遷移グラフを作成して前記インターフェイスに提示することを特徴とする、システム。 - サーバが備える記憶装置内のデータベースに、リソースと前記リソースを一意に識別するリソースIDとリソース・ポイントとを含む2つ以上のリソース情報を記憶するリソース・テーブルと、タグと該タグを一意に識別するタグIDとを含む2以上のタグ情報を記憶するタグ・テーブルと、前記リソース情報が有するリソースIDの1つと該リソースIDに関連付けられる1つ以上のタグIDとを含む1つ以上のリソース・タグ対応情報を記憶するリソース・タグ関連テーブルとが含まれており、一時メモリを備える前記サーバがさらに備える処理装置が、1つの前記リソース情報のリソース・ポイントの値を、他の前記リソース情報のリソース・ポイントの値に基づいて算出および格納して、前記アカウント・ポイントを増減させる方法であって、
前記リソース・テーブルに格納された1つの前記リソース情報の前記リソースIDの値を選択する選択ステップと、
前記選択されたリソースIDの値を前記リソース・タグ対応情報のリソースIDの値として有する該リソース・タグ対応情報の前記タグIDの値を抽出し、該抽出されたタグIDの値を前記リソース・タグ対応情報のタグIDの値として有している該リソース・タグ対応情報のリソースIDをさらに抽出し、前記抽出されたリソースIDの値の和集合から、前記選択されたリソースIDの値を削除した前記リソースIDの値からなるリストを、前記選択されたリソースIDについてのホップ数の値を1とする、該ホップ数に対応したリソース・リストとして生成して前記一時メモリに格納する、第1のリソース・リスト生成格納ステップと、
前記ホップ数の値を2以上の整数とする、前記ホップ数対応リソース・リストを、所与の条件を満たすまで、前記ホップ数の値を2からインクリメントしながら繰り返し生成して、前記一時メモリに格納する第2のリソース・リスト生成格納ステップであって、直前に生成された前記ホップ数対応リソース・リストが有している前記リソースIDの値を、前記リソース・タグ対応情報のリソースIDの値として有している該リソース・タグ対応情報のタグIDの値を抽出し、該抽出されたタグIDの値を前記リソース・タグ対応情報のタグIDの値として有する該リソース・タグ対応情報のリソースIDの値をさらに抽出し、該抽出されたリソースIDの値の和集合から、前記一時メモリに格納されているすべての第1リソース・リストがそれぞれ有している前記リソースIDの値を削除したリソースIDの値からなるリストを、前記ホップ数対応リソース・リストとして生成するステップと、
前記ホップ数の値と、前記ホップ数の値に対応したそれぞれの前記ホップ数対応リソース・リストが有する各前記リソースIDの値を、前記リソース・テーブルに格納された前記リソース情報のリソースIDの値として有する該リソース情報のリソース・ポイントの値に基づいて、前記1つのリソース情報についての第1リソース中心値を計算する第1の計算ステップと、
前記計算された第1リソース中心値に基づいて、前記1つのリソース情報についての第1ポイントを計算して、前記1つのリソース情報のリソース・ポイントの値として前記リソース・テーブルに格納する第2の計算ステップと、
を備えており、第1のタイミングで前記処理装置により実行される方法。 - 請求項12に記載の方法において、
前記リソース・テーブルに格納される前記リソース情報は、前記リソースIDに関連付けられる初期リソース・ポイントを含んでおり、さらに、
インターフェイスを介して新たに入力された1つ以上の第1のテキストをそれぞれ新たな前記リソース情報のリソースとして、前記新たなリソース情報のリソースIDの値と前記初期リソース・ポイントの値ともに前記リソース・テーブルに新たに格納するリソース格納ステップと、
前記リソース格納ステップにより前記新たに格納された1つ以上の第1テキストからそれぞれ抽出される第2のテキストであって、前記タグ・テーブルに格納された前記タグ情報のタグとして格納されていない新たな第2テキストを、新たな前記タグ情報のタグとして、前記新たなタグ情報のタグIDの値とともに、前記タグ・テーブルに新たに格納するタグ抽出格納ステップと、
前記リソース格納ステップにより格納された前記新たなリソース情報のリソースIDの値と前記タグ抽出格納ステップにより格納された前記新たなタグ情報のタグIDの値とを含む新たな前記リソース・タグ対応情報を前記リソース・タグ関連テーブルに格納するステップと、を備え、
前記リソース格納ステップにより格納された前記新たなリソース情報の初期リソース・ポイントの値は、前記インターフェイスを介して入力されたタイミングを前記第1タイミングとして、前記選択ステップにおいて前記新たなリソース情報のリソースIDの値を選択し、次いで、前記第1リソース・リスト生成格納ステップと、前記第2リソース・リスト生成格納ステップと、前記第1計算ステップと、前記第2計算ステップとにより計算されることを特徴とする、前記処理装置により実行される方法。 - 請求項13記載の方法において、前記タグ抽出格納ステップによって前記第1テキストから抽出される前記第2テキストは、
前記第1テキストから、1つ以上の第1のキーワードを含む第1のキーワード群を抽出し、
ネットワーク上に構成される第2のサーバの記憶装置に格納される第2のデータベースであって、前記サーバのデータベースとアプリケーション・インターフェースによって連携する第2データベースに格納される、ワードとその説明との組を複数備えるテキスト集合に対し、前記抽出された第1キーワード群の各第1キーワードを用いて、前記各第1キーワードに対応する前記ワードを検索することで、前記第1キーワードに一致する前記ワードの説明を取得し、
前記取得された説明から、さらに、1つ以上の第2のキーワードを含む第2のキーワード群を抽出し、および
前記抽出された第2キーワード群に含まれる各前記第2キーワードを用いて前記リソース・テーブルのリソース情報のリソースを検索し、すでに所与の数以上格納されている前記第2キーワードを前記第2キーワード群から削除することにより抽出されることを特徴とする、方法。 - 請求項13または請求項14に記載の方法において、さらに、前記データベースが、前記リソース・テーブルのリソース情報が有する前記リソースIDの1つと、前記リソースIDの1つに関連付けられる1つ以上のユーザIDおよび対応する行動区分と、を含む2つ以上のユーザ行動対応情報を格納するユーザ履歴テーブルを含んでおり、
前記選択ステップにより選択された前記1つのリソース情報のリソースIDの値を前記ユーザ履歴テーブルに格納された前記ユーザ行動対応情報のリソースIDの値として有している該ユーザ行動対応情報の前記1つ以上のユーザIDの値、および前記対応する第1の行動区分の値を抽出して一時メモリに格納する行動区分抽出ステップと、
前記抽出された1つ以上のユーザIDの値ごとに1つの前記ユーザIDの評価値を繰り返し計算して一時メモリに格納する第3計算ステップであって、
前記1つのユーザIDの値を前記ユーザ履歴テーブルに格納された前記ユーザ行動対応情報のユーザIDの値として有する該ユーザ行動対応情報が有する、1つ以上のリソースIDの値および前記対応する第2の行動区分の値を抽出し、前記抽出された1つ以上のリソースIDの値の和集合から、前記選択されたリソースIDの値を削除したリストを、前記選択されたリソースIDについての第2リソース・リストとして生成して前記一時メモリに格納することと、
前記行動区分抽出ステップで抽出された前記第1行動区分の値と、前記生成された第2リソース・リストが有する各前記リソースIDの値を前記リソース・テーブルに格納された前記リソース情報のリソースIDの値として有する該リソース情報のリソース・ポイントの値と、前記リソース情報のリソースIDの値についての、前記抽出された第2行動区分の値と、に基づいて、前記1つのユーザIDの評価値を計算して一時メモリに格納すること、とを含む第3計算ステップと、
前記抽出された1つ以上のユーザIDの各前記評価値に基づいて、前記1つのリソース情報についての第2リソース中心値を計算するステップと、
前記1つのリソース情報についての前記計算された第1リソース中心値と前記計算された第2リソース中心値とに基づいて、さらに前記1つのリソース情報についての第2ポイントを計算して、前記1つのリソース情報のリソース・ポイントの値として前記リソース・テーブルに格納するステップと、
を備えており、前記第1タイミングで前記処理装置により実行される方法。 - 請求項15記載の方法において、さらに、
前記リソース・テーブルに格納された全てのリソース情報のリソースIDの値のそれぞれについて、前記選択ステップにおいて前記1つのリソース情報のリソースIDとして選択し、次いで、前記第1リソース・リスト生成格納ステップと、前記第2リソース・リスト生成格納ステップと、前記第1計算ステップと、前記第2計算ステップとによって、前記全てのリソース情報の第1リソース中心値の値および全てのリソース情報の第2リソース中心値をそれぞれ計算し、該計算された前記第1リソース中心値の合計値と前記第2リソース中心値の合計値との比率に基づいて、前記全てのリソース情報の第3ポイントをそれぞれ計算して一時メモリに格納し、該それぞれ計算された第3ポイントを、前記全てのリソース情報のリソース・ポイントの値としてそれぞれ前記リソース・テーブルに格納する、第3ポイント格納ステップを備え、前記第1タイミングで前記処理装置により実行される方法。 - 請求項16記載の方法において、さらに、ユーザを一意に識別する前記ユーザIDおよび該ユーザIDに関連付けられるアカウント・ポイントを含む2つ以上のユーザ・アカウント情報を格納するユーザ・テーブルを備え、
前記リソース・テーブルに格納される前記2つ以上のリソース情報は、さらに前記リソース情報のリソースIDに関連付けられる1つの投稿ユーザIDであって、該投稿ユーザIDの値は、前記リソース情報のリソースとして、前記第1テキストを入力した前記ユーザの前記ユーザIDの値である投稿ユーザIDをそれぞれ含み、
前記ユーザ履歴テーブルに格納された前記2つ以上のユーザ行動対応情報の前記行動区分は、出題、回答、ネガティブ評価、ポジティブ評価および閲覧を表わす区分を含み、前記区分に応じた値を前記行動区分の値としており、
前記リソース格納ステップにおいて、さらに、前記インターフェイスを介して前記第1テキストを入力したユーザの前記ユーザIDの値を、前記新たなリソース情報の前記投稿ユーザIDの値として格納し、同時に、
前記新たなリソース情報の前記リソースIDの値と、前記新たなリソース情報の前記投稿ユーザIDの値と、前記行動区分のうち閲覧以外のいずれか1つの区分であって前記ユーザに選択された区分に応じた値と、を含む前記ユーザ行動対応情報を前記ユーザ履歴テーブルに格納するステップと、
前記リソース・テーブルに格納された前記全てのリソース情報が有するリソースの前記リソースIDの値のいずれかが、任意の前記ユーザにより前記インターフェイスを介して指定されたタイミングで、前記指定されたリソースIDの値と、前記指定した前記ユーザを識別する前記ユーザIDの値と、前記閲覧を表わす前記区分に応じた値と、を含む前記ユーザ行動対応情報を前記ユーザ履歴テーブルに格納するステップと、
を備え、前記処理装置により実行される方法。 - 請求項17に記載の方法において、さらに、
ポイント投資ステップであって、前記新たなリソース情報の前記投稿ユーザIDの値を前記ユーザ・テーブルに格納された前記ユーザ・アカウント情報のユーザIDの値として有する該ユーザ・アカウント情報のアカウント・ポイントの値から、前記リソース・テーブルに格納された前記新たなリソース情報の初期リソース・ポイントを減算して、該減算された結果をさらに前記ユーザ・アカウント情報のアカウント・ポイントの値として前記ユーザ・テーブルに格納することで、前記アカウント・ポイントの値を増減させることを特徴とするステップを備えており、
前記タグ・テーブルに格納された全てのタグ情報はさらに、それぞれタグ・ポイントを備えており、1つの前記タグ情報のタグ・ポイントは、1つの前記タグ情報のタグIDの値を、前記リソース・タグ関連テーブルに格納された前記リソース・タグ対応情報のタグIDの値として有する該リソース・タグ対応情報の1つ以上のリソースIDの値を、さらに前記リソース・テーブルに格納された前記リソース情報のリソースIDの値として有する該リソース情報のリソース・ポイントの値を合計した値を格納することができ、さらに、前記方法において、
前記第1タイミングで、前記全てのタグ情報についての第4ポイントを計算して前記タグ・テーブルの前記タグ情報のタグ・ポイントの値としてそれぞれ格納する第4ポイント計算格納ステップと、
報酬分配ステップであって、前記新たなリソース情報のリソースの前記第1テキストが前記インターフェイスを介して入力された際に指定された第2のタイミングにおいて、
前記選択ステップにより前記新たなリソース情報のリソースIDの値を選択し、
前記第1リソース・リスト生成格納ステップにより前記新たなリソース情報の前記リソースIDについての前記ホップ数を1とする前記ホップ数対応リソース・リストを生成し、
該ホップ数対応リソース・リストが有する各リソースIDの値を、前記リソース・タグ関連テーブルに格納された前記リソース・タグ対応情報のリソースIDの値としてそれぞれ有する該リソース・タグ対応情報の1つ以上のタグIDの値を、さらに前記タグ・テーブルに格納された前記タグ情報のタグIDの値としてそれぞれ有する該タグ情報のタグ・ポイントの値を合計することで、前記ホップ数を1とする前記ホップ数対応リソース・リストが有する各リソースIDについての前記タグ・ポイントの値の合計をそれぞれ計算して前記一時メモリに格納し、
前記リソース・テーブルに格納された前記新たなリソース情報の前記初期リソース・ポイントの値から、前記格納されたタグ・ポイントの値の合計の比に基づいて、前記ホップ数対応リソース・リストが有する前記各リソースIDについての各配当ポイントを計算してそれぞれ前記一時メモリに格納し、および
前記格納された各配当ポイントを、前記ホップ数対応リソース・リストが有する前記各リソースIDの値を前記リソース・テーブルに格納された前記リソース情報のリソースIDの値として有する該リソース情報の投稿ユーザIDの値をさらに前記ユーザ・テーブルの前記ユーザ・アカウント情報のユーザIDの値として有する該ユーザ・アカウント情報のアカウント・ポイントの値にそれぞれ加算して、該加算した結果を、前記ユーザ・アカウント情報のアカウント・ポイントの値として前記ユーザ・テーブルにそれぞれ格納する、報酬分配ステップとを備え、前記処理装置により実行される方法。 - 請求項18に記載の方法において、前記データベースはさらに、報酬分配における支出ポイントと回収ポイントとポイント移動時刻とを含む2以上の管理情報を格納する運営管理テーブルを備えており、
前記リソース・テーブルに格納された前記新たなリソース情報の前記初期リソース・ポイントの値を前記支出ポイントの値とし、前記新たなリソース情報の前記リソース・ポイントの値と前記一時メモリに格納された配当ポイントの合計値との差を前記回収ポイントの値とし、前記第2タイミングの時刻をポイント移動時刻の値とする前記管理情報を、前記運営管理テーブルに格納する第1管理情報格納ステップと、
を備え、前記処理装置により実行される方法。 - 請求項19に記載の方法において、さらに、第3のタイミングにおいて、
前記ユーザ・テーブルに格納された全ての前記ユーザ・アカウント情報が有する各アカウント・ポイントの値に対して、所与の割合を乗算し、該乗算した結果から小数点以下を切り捨てることにより整数値とした値を、前記各アカウント・ポイントの値から減算し、該減算された結果を前記ユーザ・アカウント情報のアカウント・ポイントの値として、前記ユーザ・テーブルに格納するステップと、
前記整数値を前記運営管理テーブルに格納される前記管理情報の前記支出ポイントの値および前記回収ポイントの値とし、前記第3タイミングの時刻をポイント移動時刻の値とする前記管理情報を、前記運営管理テーブルに格納する第2管理情報格納ステップと、
を備え、前記処理装置により実行されることを特徴とする、方法。 - 請求項20に記載の方法において、前記データベースは、さらに、総流通ポイントを含む2以上のポイント流通情報を格納するポイント流通管理テーブルを備えており、前記第1タイミングにおいて、
前記第1管理情報格納ステップおよび/または前記第2管理情報格納ステップにより前記運営管理テーブルに格納された前記管理情報のうち、前記ポイント移動時刻の値が所与の範囲内である前記管理情報が有する支出ポイントの値の合計値を計算し、該計算された合計値を総流通ポイントの値として、前記ポイント流通管理テーブルに格納するステップと、
前記格納された前記総流通ポイントの値と、既に格納されていた前記ポイント流通情報のうち最後に格納された前記ポイント流通情報の総流通ポイントとの比をとることにより、総流通ポイント増加率を計算して、前記一時メモリに格納するステップと、
前記新たなリソース情報についての第5ポイントを計算および格納するステップであって、前記第4ポイント計算格納ステップにより、前記新たなリソース情報ついて計算された第4ポイントと前記一時メモリに格納された総流通ポイント増加率とに基づいて、第5ポイントを計算して、前記新たに入力された1つのリソース情報のリソース・ポイントの値として前記リソース・テーブルに格納するステップとを備え、前記処理装置により実行される方法。
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2010516901A JPWO2009151134A1 (ja) | 2008-06-13 | 2009-06-15 | リソース情報のリソース・ポイント算出、およびポイント流通方法 |
US12/997,745 US20110093457A1 (en) | 2008-06-13 | 2009-06-15 | Method for calculating resource points of resource information and distributing points |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2008155841 | 2008-06-13 | ||
JP2008-155841 | 2008-06-13 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2009151134A1 true WO2009151134A1 (ja) | 2009-12-17 |
Family
ID=41416835
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2009/060839 WO2009151134A1 (ja) | 2008-06-13 | 2009-06-15 | リソース情報のリソース・ポイント算出、およびポイント流通方法 |
Country Status (3)
Country | Link |
---|---|
US (1) | US20110093457A1 (ja) |
JP (1) | JPWO2009151134A1 (ja) |
WO (1) | WO2009151134A1 (ja) |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2011080950A1 (ja) * | 2009-12-29 | 2011-07-07 | Imaizumi Takateru | Webサイトの管理用サーバ、管理方法及び管理プログラム |
WO2011089757A1 (ja) * | 2010-01-25 | 2011-07-28 | Imaizumi Takateru | Webサイトの管理用サーバ、管理方法及び管理プログラム |
JPWO2012132631A1 (ja) * | 2011-03-31 | 2014-07-24 | 九州日本電気ソフトウェア株式会社 | 情報処理システム、情報処理方法および記憶媒体 |
JP7527701B1 (ja) | 2024-03-07 | 2024-08-05 | 株式会社スナップ新潟 | 情報処理システム、情報処理方法及びプログラム |
Families Citing this family (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8539597B2 (en) * | 2010-09-16 | 2013-09-17 | International Business Machines Corporation | Securing sensitive data for cloud computing |
US8868618B2 (en) * | 2010-12-14 | 2014-10-21 | Microsoft Corporation | Usage-optimized tables |
US20140236857A1 (en) * | 2013-02-21 | 2014-08-21 | Bank Of America Corporation | Data Communication and Analytics Platform |
US10496692B1 (en) | 2015-03-17 | 2019-12-03 | Amazon Technologies, Inc. | Resource tagging and grouping |
US11977711B1 (en) | 2015-03-17 | 2024-05-07 | Amazon Technologies, Inc. | Resource tagging and grouping |
US9934269B1 (en) | 2015-03-17 | 2018-04-03 | Amazon Technologies, Inc. | Resource tagging and grouping |
US10425452B2 (en) * | 2015-09-25 | 2019-09-24 | International Business Machines Corporation | Identifying changes in multiple resources related to a problem |
US10120552B2 (en) | 2015-09-25 | 2018-11-06 | International Business Machines Corporation | Annotating collaborative content to facilitate mining key content as a runbook |
US10320797B2 (en) | 2015-09-25 | 2019-06-11 | International Business Machines Corporation | Enabling a multi-dimensional collaborative effort system |
JP2017123624A (ja) * | 2016-01-08 | 2017-07-13 | 株式会社Nttドコモ | ユーザ装置、基地局、信号受信方法及び信号送信方法 |
EP3422185A4 (en) * | 2016-03-28 | 2019-07-31 | Hitachi, Ltd. | PROCESSING SYSTEM AND PROCESSING METHOD |
CN117215799A (zh) * | 2023-11-03 | 2023-12-12 | 天津市职业大学 | 一种软件模块的管理方法、系统、计算机设备及存储介质 |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2002342368A (ja) * | 2001-05-21 | 2002-11-29 | Nippon Telegr & Teleph Corp <Ntt> | 情報提供方法、装置、プログラム、および同プログラムを記録した記録媒体 |
JP2003006748A (ja) * | 2001-06-19 | 2003-01-10 | Seiko Instruments Inc | 注文管理システム |
JP2007280000A (ja) * | 2006-04-06 | 2007-10-25 | Hitachi Ltd | 人脈分析検索方法及び人脈分析検索システム |
JP2007317177A (ja) * | 2006-04-28 | 2007-12-06 | Nec Corp | ネットワーク広告配信システム、ネットワーク広告配信装置、方法及びプログラム |
Family Cites Families (20)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6285999B1 (en) * | 1997-01-10 | 2001-09-04 | The Board Of Trustees Of The Leland Stanford Junior University | Method for node ranking in a linked database |
AU2003300900A1 (en) * | 2002-12-13 | 2004-07-09 | Internap Network Services Corporation | Topology aware route control |
WO2004109985A1 (ja) * | 2003-06-02 | 2004-12-16 | Fujitsu Limited | ノード装置及びrprネットワーク |
US20060184473A1 (en) * | 2003-11-19 | 2006-08-17 | Eder Jeff S | Entity centric computer system |
US8010459B2 (en) * | 2004-01-21 | 2011-08-30 | Google Inc. | Methods and systems for rating associated members in a social network |
US8572221B2 (en) * | 2004-05-26 | 2013-10-29 | Facebook, Inc. | System and method for managing an online social network |
US7788260B2 (en) * | 2004-06-14 | 2010-08-31 | Facebook, Inc. | Ranking search results based on the frequency of clicks on the search results by members of a social network who are within a predetermined degree of separation |
US7616575B2 (en) * | 2004-06-23 | 2009-11-10 | Microsoft Corporation | System and method for link quality routing using a weighted cumulative expected transmission time metric |
US7506052B2 (en) * | 2005-04-11 | 2009-03-17 | Microsoft Corporation | Network experience rating system and method |
US20060248573A1 (en) * | 2005-04-28 | 2006-11-02 | Content Guard Holdings, Inc. | System and method for developing and using trusted policy based on a social model |
US20080005064A1 (en) * | 2005-06-28 | 2008-01-03 | Yahoo! Inc. | Apparatus and method for content annotation and conditional annotation retrieval in a search context |
JP2007074564A (ja) * | 2005-09-08 | 2007-03-22 | Oki Electric Ind Co Ltd | ネットワーク経路設定方法及び無線局 |
US7856411B2 (en) * | 2006-03-21 | 2010-12-21 | 21St Century Technologies, Inc. | Social network aware pattern detection |
US8775261B2 (en) * | 2006-04-28 | 2014-07-08 | Nec Corporation | Network advertisement delivery system |
US7991800B2 (en) * | 2006-07-28 | 2011-08-02 | Aprimo Incorporated | Object oriented system and method for optimizing the execution of marketing segmentations |
US8595348B2 (en) * | 2006-08-09 | 2013-11-26 | Aol Inc. | Content distribution tracking through wireless mesh networks |
US20080071929A1 (en) * | 2006-09-18 | 2008-03-20 | Yann Emmanuel Motte | Methods and apparatus for selection of information and web page generation |
US20090198562A1 (en) * | 2008-01-31 | 2009-08-06 | Guenter Wiesinger | Generating social graph using market data |
US20090306996A1 (en) * | 2008-06-05 | 2009-12-10 | Microsoft Corporation | Rating computation on social networks |
US20090307129A1 (en) * | 2008-06-06 | 2009-12-10 | Jonathan Matkowsky | Community-based work value system and method |
-
2009
- 2009-06-15 US US12/997,745 patent/US20110093457A1/en not_active Abandoned
- 2009-06-15 WO PCT/JP2009/060839 patent/WO2009151134A1/ja active Application Filing
- 2009-06-15 JP JP2010516901A patent/JPWO2009151134A1/ja not_active Withdrawn
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2002342368A (ja) * | 2001-05-21 | 2002-11-29 | Nippon Telegr & Teleph Corp <Ntt> | 情報提供方法、装置、プログラム、および同プログラムを記録した記録媒体 |
JP2003006748A (ja) * | 2001-06-19 | 2003-01-10 | Seiko Instruments Inc | 注文管理システム |
JP2007280000A (ja) * | 2006-04-06 | 2007-10-25 | Hitachi Ltd | 人脈分析検索方法及び人脈分析検索システム |
JP2007317177A (ja) * | 2006-04-28 | 2007-12-06 | Nec Corp | ネットワーク広告配信システム、ネットワーク広告配信装置、方法及びプログラム |
Non-Patent Citations (1)
Title |
---|
MIZUKI KANADA: "A Study on Recommender System using User Profile Clustering for Mobile Application", IPSJ SIG NOTES, vol. 2004, no. 25, 5 March 2004 (2004-03-05), pages 19 - 24 * |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2011080950A1 (ja) * | 2009-12-29 | 2011-07-07 | Imaizumi Takateru | Webサイトの管理用サーバ、管理方法及び管理プログラム |
WO2011089757A1 (ja) * | 2010-01-25 | 2011-07-28 | Imaizumi Takateru | Webサイトの管理用サーバ、管理方法及び管理プログラム |
JP2011170394A (ja) * | 2010-01-25 | 2011-09-01 | Takateru Imaizumi | Webサイトの管理用サーバ、管理方法及び管理プログラム |
JPWO2012132631A1 (ja) * | 2011-03-31 | 2014-07-24 | 九州日本電気ソフトウェア株式会社 | 情報処理システム、情報処理方法および記憶媒体 |
JP5676750B2 (ja) * | 2011-03-31 | 2015-02-25 | Necソリューションイノベータ株式会社 | 情報処理システム、情報処理方法および記憶媒体 |
JP7527701B1 (ja) | 2024-03-07 | 2024-08-05 | 株式会社スナップ新潟 | 情報処理システム、情報処理方法及びプログラム |
Also Published As
Publication number | Publication date |
---|---|
JPWO2009151134A1 (ja) | 2011-11-17 |
US20110093457A1 (en) | 2011-04-21 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2009151134A1 (ja) | リソース情報のリソース・ポイント算出、およびポイント流通方法 | |
US20110196927A1 (en) | Social Networking Application Using Posts to Determine Compatibility | |
KR100952391B1 (ko) | 인터넷 네트워크에서 콘텐츠의 평가에 따른 가치 분석시스템, 방법 및 이를 구현할 수 있는 컴퓨터로 읽을 수있는 기록 매체 | |
US20120143718A1 (en) | Optimization of a web-based recommendation system | |
CN108650532B (zh) | 有线电视点播节目推荐方法及系统 | |
CN102957969A (zh) | 为iptv终端用户推荐节目的装置及方法 | |
CN103577593A (zh) | 一种基于微博热门话题的视频聚合方法及系统 | |
US10776738B1 (en) | Natural experiment finder | |
US20140278796A1 (en) | Identifying Target Audience for a Product or Service | |
Negoiță et al. | Research on online promoting methods used in a technological society | |
Jiao et al. | Expertrank: An expert user ranking algorithm in online communities | |
CN114218482A (zh) | 信息推送方法及装置 | |
Fradkin | A simulation approach to designing digital matching platforms | |
JP2010517132A (ja) | 情報広告表示方法および情報広告表示システム | |
Li et al. | Capitalize your data: Optimal selling mechanisms for IoT data exchange | |
Auditianto et al. | Discovering the influencing factors of physical gig economy usage: Quantitative approach on clients9 perception | |
Zhang et al. | Research on movie box office forecasting based on internet data | |
Anderson | Library website visits and enrollment trends | |
Lu | Research on movie box office prediction model with AHP method | |
JP4962950B2 (ja) | ネットワーク上のユーザに対するレコメンデーションの方法、レコメンデーションサーバ及びプログラム | |
Shi et al. | Audience size forecasting: Fast and smart budget planning for media buyers | |
JP6122138B2 (ja) | インタラクションの類似性によってリンクされるコミュニティの間の情報拡散を最適化するための方法およびデバイス | |
Kpiebaareh et al. | User-connection behaviour analysis in service management using bipartite labelled property graph | |
US10878357B1 (en) | Natural experiment finder system and method | |
CN109919811A (zh) | 基于大数据的保险代理人培养方案生成方法及相关设备 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 09762564 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2010516901 Country of ref document: JP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 12997745 Country of ref document: US |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 09762564 Country of ref document: EP Kind code of ref document: A1 |