CN103020116B - The method of the powerful user of automatic screening on social media network - Google Patents

The method of the powerful user of automatic screening on social media network Download PDF

Info

Publication number
CN103020116B
CN103020116B CN201210455018.1A CN201210455018A CN103020116B CN 103020116 B CN103020116 B CN 103020116B CN 201210455018 A CN201210455018 A CN 201210455018A CN 103020116 B CN103020116 B CN 103020116B
Authority
CN
China
Prior art keywords
user
interest
theme
social media
media network
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201210455018.1A
Other languages
Chinese (zh)
Other versions
CN103020116A (en
Inventor
徐常胜
桑基韬
方全
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Institute of Automation of Chinese Academy of Science
Original Assignee
Institute of Automation of Chinese Academy of Science
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Institute of Automation of Chinese Academy of Science filed Critical Institute of Automation of Chinese Academy of Science
Priority to CN201210455018.1A priority Critical patent/CN103020116B/en
Publication of CN103020116A publication Critical patent/CN103020116A/en
Application granted granted Critical
Publication of CN103020116B publication Critical patent/CN103020116B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The present invention is a kind of method of powerful user of automatic screening on social media network, comprises step as follows: step S1: utilize hypergraph model for the user in interest social media network, object of interest and interaction relationship modeling thereof; Step S2: the regularization theme probability model adopting hypergraph constraint, utilize similarity relationships between the content information of object of interest and content information as constraint, automatic learning obtains the interest topic implied; Step S3: the sequence of theme influence power is carried out to each user and object of interest, similarity propagation model and the user on hypergraph and object of interest and super limit is each other adopted to propagate theme influence power, until stable state, then sequence can obtain the influential user under particular topic.The present invention truly and exactly can reflect the distribution of user force in social media network.

Description

The method of the powerful user of automatic screening on social media network
Technical field
The invention belongs to digital information processing field, be specifically related to a kind of data screening technology of social media network, particularly based on the screening technique of the responsive powerful user of theme of content of multimedia and link analysis.
Background technology
The appearance of social media network and prosperity and development, change the mode of people's acquisition and consumption information.Various social media network be people provide one can convenient creation and the platform sharing interest content.Such as, the news in brief picture of Sina, Tengxun's microblogging is shared, the news in brief of twitter, and the picture of Flickr is shared.But one has problems significantly is that people, while convenient obtaining information, also face the problem of information overload.During people's obtaining information, can tend to obtain oneself interested content and using influential user as information source.From social media network, filter out influential user or object of interest under a certain field or theme, become the focus of current academia and industry member concern.By filtering out the user of theme sensitivity, a kind of " interest intelligent " or " leader of opinion ", thus businessman can carry out influence power promotion, user can obtain interested required knowledge information with having Objective better.
At present for the screening of powerful user, existing method has: one is expert's discover method, and namely a given theme, identifies relevant technical ability or the people of experience.Existing work mainly concentrates on text data, does not relate to multi-medium data, i.e. the interested information carrier of various user, such as audio frequency, picture, video etc.Another kind is the influence power analysis of social media network, namely analyzes social media network and carries out modeling to the influence power in social media network, understands the active development situation of social media network.Existing groundwork be differentiate in social networks influence power existence or in homogenous network quantization influence power.
But, said method can not reflect the distribution of user force in social networks completely truely and accurately, user force is a successional quantifiable variable in social networks, and the influence power of user is theme sensitivity, namely, on different themes, the influence power distribution of user is different.Traditional method, on the one hand large multi-method is confined to text data process measure user influence power, and in fact comprises abundant multi-medium data in social networks, and these information have important effect to user force modeling.Classic method is to the general influence power modeling of user on the other hand, does not consider the influence power modeling of theme sensitivity.
Summary of the invention
(1) technical matters that will solve
Technical matters to be solved by this invention is the user how automatically filtering out influence power from social media network about specific theme, and to overcome current method be only the limitation of customer impact force modeling and the tolerance being only limitted to user's global impact power on text data.
(2) technical scheme
For solving the problems of the technologies described above, the present invention proposes a kind of method of powerful user of automatic screening on social media network, and it is as follows that the method comprising the steps of: step S1: utilize hypergraph model for the user in interest social media network, object of interest and interaction relationship modeling thereof; Step S2: the regularization theme probability model adopting hypergraph constraint, utilize similarity relationships between the content information of object of interest and content information as constraint, automatic learning obtains the interest topic implied; Step S3: the sequence of theme influence power is carried out to each user and object of interest, similarity propagation model and the user on hypergraph and object of interest and super limit is each other adopted to propagate theme influence power, until stable state, then sequence can obtain the influential user under particular topic.
(3) beneficial effect
The present invention utilizes in social media network the various media contents comprised automatically to find potential theme, and the powerful user under analyzing corresponding theme, multi-medium data and various social linking relationship can be utilized in multi-modal heterogeneous network to excavate the user of theme sensitivity.Further, the present invention truly and exactly can reflect the distribution of user force in social media network, filters out the powerful user of theme sensitivity in social media network.
Accompanying drawing explanation
Fig. 1 is the process flow diagram of the present invention's method of the powerful user of automatic screening on social media network;
Fig. 2 is that the homogeneity built according to view-based access control model content of the present invention surpasses limit schematic diagram;
Fig. 3 is that the homogeneity built based on content of text according to the present invention surpasses limit schematic diagram;
Fig. 4 is according to heterogeneous super limit of the present invention schematic diagram;
Fig. 5 is influence power message propagation schematic diagram in hypergraph of the present invention;
Fig. 6 a and Fig. 6 b is the representative user that obtains of method according to an embodiment of the invention and picture.
Embodiment
For making the object, technical solutions and advantages of the present invention clearly understand, below in conjunction with specific embodiment, and with reference to accompanying drawing, the present invention is described in further detail.
Target of the present invention is the powerful user filtering out theme sensitivity in social media network.Social media network in the present invention refers to of providing for user and can create and the platform sharing media information, such as picture sharing website Flickr.User alleged in the present invention refers to agent object in social media network and people, and alleged object of interest refers to be created and the special object shared, as picture, video, music by user.So-called theme refers to the polymerization of object of interest on semantic hierarchies and expresses, and concrete manifestation form is the probability distribution of the word of semantic similarity.Powerful user refer to such as can to forward the network behavior of other users in social networks, user that comment etc. produces directly or indirectly impact, so-called influence power is defined as when the mood of user, suggestion or behavior are subject to a kind of form of expression of other people effect.
Social media network of the present invention refers to centered by object of interest, create and the platform sharing object of interest for one that provides for user, object of interest can be news in brief, picture, video, music etc., abundant multi-medium data is there is in social media network, multi-modal and heterogeneous, such as in Flickr, there is text, picture, video, and exist between user and picture and comment on, forward, the linking relationship such as to like.
Put it briefly, the present invention utilizes in social media network the various media contents comprised automatically to find potential theme, and the powerful user under analyzing corresponding theme.The present invention can utilize multi-medium data and various social linking relationship to excavate the user of theme sensitivity in multi-modal heterogeneous network.Illustrate embodiments of the present invention below.
Figure 1 shows that the process flow diagram of powerful user's screening technique of the present invention.As shown in Figure 1, the present invention includes three step: S1, hypergraph builds (hypergraphconstruction); S2, interest topic Distributed learning (Topicofinterestdistributionlearning); Responsive influence power sequence (Topicsensitiveinfluenceranking) of S3, theme.Each step is described respectively below.
S1, hypergraph build
So-called hypergraph refers to the figure that can represent multistage relation.In hypergraph, comprise node and super limit G=(V, E, w), wherein node represents dissimilar object, and super limit can connect and represents higher order relationship each other more than two nodes.Hypergraph can carry out modeling to the object network comprising higher order relationship.
Step S1 uses hypergraph model to carry out the step of modeling for the user in social media network, object of interest and interaction relationship thereof.In social media network, to similarly being the most basic element, there is multiple linking relationship therebetween in user and interest, such as user can comment on, forwards, likes and comment on an object of interest.
In the present invention, user (user) in social media network and object of interest (objectofinterest, OI) is represented with hypergraph node; Super limit is divided into two types: homogeneity (homogeneous) super limit and heterogeneous (heterogeneous) super limit.
Homogeneity surpasses limit for representing the content similarities between object of interest, comprise vision content similarity and content of text similarity, heterogeneous super limit for representing the social linking relationship of high-order between user and object of interest, as liking and comment relation of existing between user and object of interest.
Fig. 2 is the schematic diagram that the homogeneity building view-based access control model content similarities surpasses limit, and as shown in Figure 2, the present invention adopts the method for k nearest neighbor, namely for each object of interest, find the object of interest of its K arest neighbors, then surpass limit by a homogeneity and connect these nodes, and weight is set to 1.
For content of text similarity, the homogeneity that the present invention builds based on text label surpasses limit, Fig. 3 builds the schematic diagram based on the super limit of text similarity, as shown in Figure 3, first a dictionary is extracted from the text meta-data of all object of interest, then for each word, for all object of interest comprising this word set up a super limit, and weight is set to 1.
For heterogeneous super limit, the present invention mainly considers two kinds:
A kind of heterogeneous super limit is the super limit of " owner-multiple object of interest-sole user " (owner-OIs-user), what it connected is owner (user A) and another user B and the mutual multiple object of interest between them, the multiple object of interest of user B to user A show interest behavior, such as comment on or like; The weight on this super limit is 1.
Another kind of heterogeneous super limit is the super limit of owner-single object of interest-multiple user (owner-OI-users), multiple users of what it connected is owner (user A) and an object of interest and behavior of becoming interested to this object of interest.The weight on this super limit is 1.
Fig. 4 is the schematic diagram on above-mentioned two kinds of heterogeneous super limits, and arrow represents certain linking relationship between user and object of interest.
S2, interest topic Distributed learning
In social media network, each object of interest both included content information, also included context metadata information, and content information comprises the information such as text, audio frequency, video, and context metadata information comprises the information such as label, time, position.This step S2 adopts hypergraph regularization theme probability model, and utilize similarity between the content information of object of interest and content information as constraint, automatic learning obtains the interest topic implied.
Suppose that a set includes N number of object of interest O={o 1, o 2..., o n, enjoy K theme Z={z 1..., z k, each object of interest is expressed as a characteristic vector W based on word bag={ w 1, w 2..., w m.Each object of interest is regarded as a document, word in subsidiary text is as word, the theme jointly enjoyed is as theme, and we adopt probability potential applications index (PLSI) to the generation of each object of interest and symbiosis word rate to carry out modeling, and production process is as follows:
With probability P (o i) select an object of interest o i;
With probability P (z k| o i) select a potential interest topic z k;
With probability P (w j| z k) produce a word w j.
The observation probability of a pair object of interest and word calculates as follows:
P ( o i , w j ) = P ( o i ) P ( w j | o i ) = P ( o i ) Σ k = 1 K P ( w j | z k ) P ( z k | o i ) - - - ( 1 )
Comprising parameter has { P (w j| z k), P (z k| o i), we can obtain by optimizing likelihood,
L ′ = Σ i = 1 N Σ j = 1 M n ( o i , w j ) log Σ k = 1 K P ( w j | z k ) P ( z k | o i ) - - - ( 2 )
The theme distribution of the object of interest gone out to make study keeps local similarity, we add the content of object of interest, comprise text, visual signature and content consistency therebetween as bound term, finally we obtain the theme probability model of hypergraph regularization.Obtain by maximizing plausible goals formula below:
L = L ′ - λR = Σ i = 1 N Σ j = 1 M n ( o i , w j ) log Σ k = 1 K P ( w j | z k ) P ( z k | o i ) - λ Σ k = 1 K f k T L f k - - - ( 3 )
Wherein, L is hypergraph Laplacian Matrix, expresses as follows
R = 1 2 Σ k = 1 K Σ e ∈ E o Σ o i , o j ∈ V o w ( e ) h ( o i , e ) h ( o i , e ) δ ( e ) ( P ( z k | o i ) ) d ( o i ) - P ( z k | o j ) ) d ( o j ) ) = Σ k = 1 K f k T ( I - D v - 1 2 HWD e - 1 H T D v - 1 2 ) f k = Σ k = 1 K f k T Lf - - - ( 4 )
We adopt extensive expectation-maximization algorithm to carry out optimized-type (3) and obtain theme probability model parameter { P (w j| z k), P (z k| o i).Extensive expectation maximization (generalizedEM) algorithm comprises desired step and maximization steps iteration is carried out.In desired step, calculate the posterior probability of hidden variable based on current parameter estimation; In maximization steps, optimize plausible goals formula, undated parameter obtains one and better separates.By extensive maximization algorithm, we obtain each object of interest o itheme distribution P (z k| o i) and each theme z kword probability distribution P (w j| z k).After obtaining the theme distribution of object of interest, the theme distribution that we obtain each user by the object of interest of being polymerized each user is as follows,
P ( z k | u ) = Σ o i ∈ O u P ( z k | o i ) P ( o i | u ) = Σ o i ∈ O u P ( z k | o i ) | O u | - - - ( 5 )
The responsive influence power sequence of S3, theme
After the theme distribution obtaining each user and object of interest, this step S3 carries out the sequence of theme influence power, adopt user on hypergraph of similarity propagation model and object of interest and super limit propagation effect power each other, until stable state, then sequence can obtain the influential user under particular topic.
Fig. 5 is influence power message propagation schematic diagram.As shown in Figure 5, theme influence power at user's node of hypergraph and object of interest node, and between super limit propagate and until convergence.
As previously mentioned, heterogeneous super limit is divided into two kinds, and one is the super limit of owner-multiple object of interest-sole user (owner-OIs-user), and another kind is owner-single object of interest-multiple user.
First, in the responsive influence power of theme of the super limit study user of owner-multiple object of interest-sole user.With represent user u iinfluence power score on theme k, s k(o p) represent object of interest o pinfluence power score on theme k.First two user u are calculated i, u jtopic Similarity f k(i, j) is as follows:
f k ( i , j ) = log g ( u i , u j , k ) Σ z ∈ S g ( u i , u z , k ) , g ( u i , u j , k ) = Σ o p ∈ O uj s k ( o p ) - - - ( 6 )
Topic Similarity f k(i, j) for calculating the influence power of user in similarity propagation introduce two groups of variablees with represent influence power message, r k(i, j) is by user's node u isend to u j, represent from user u iangle see, he consenting user u jtheme k affects his degree; a k(i, j) is by user's node u jsend to u i, represent from user u jangle see, he thinks that he is to user u ieffect on theme k.
By the super limit pass-along message owner-multiple object of interest-sole user, upgrade user force score as follows:
r k ( i , j ) ← f k ( i , j ) - max z ∈ S ( i ) { f k ( i , z ) + a k ( i , z ) } a k ( i , j ) ← min { 0 , r k ( i , j ) + Σ z ∉ { i , j } max { 0 , r k ( z , j ) } } a k ( j , j ) ← Σ i ′ ≠ j max { 0 , r k ( i ′ , j ) } - - - ( 7 )
Wherein S (i) represents user u ithe set having user of interested object of interest.By similar propagation algorithm above, we obtain stable state with based on this, the influence power that we define between user is: use q k(i, j) represents user u jto user u iinfluence power on theme k, is calculated as follows:
q k ( i , j ) = 1 1 + e - ( r k ( i , j ) + a k ( i , j ) ) - - - ( 8 )
Then we calculate the global impact power of user at theme:
s k ( j ) = η Σ i : i → j s k ( i ) p k ( j | i ) + ( 1 - η ) v j k - - - ( 9 )
η is a controling parameters.P k(j|i) user u is represented ito user u jtransition probability calculate as follows:
p k ( j | i ) = q k ( i , j ) Σ j ′ : i → j ′ q k ( i , j ′ ) - - - ( 10 )
user u jinitialization in the influence power of theme k, solving to formula (9) user force obtaining stable state is
s u k = ( 1 - η ) ( I - η Q k ) - 1 v k - - - ( 11 )
For the super limit based on user force and owner-single object of interest-multiple user, the influence power that we calculate each object of interest is as follows:
s o k ( o p ) = P ( z k | o p ) ( β Σ z = 1 C s k ( u z ) + ( 1 - β ) s k ( u h ) ) - - - ( 12 )
Wherein C is to object of interest o pthe user become interested.β is a controling parameters.
Upgrade the influence power iteration of user and object of interest, until reach stable state, finally we obtain the influence power of the theme sensitivity of each user and object of interest
Specific embodiment:
In order to assess the present invention, one embodiment of the present of invention, based on the api interface of the community Media picture sharing website Flickr of interest, have captured 2,314 users, and 556942 pictures altogether.Fig. 6 a show method of the present invention screening four influential representative users of theme.The theme probability model study of each theme hypergraph regularization obtains, and show with the most significant vocabulary, word is more relevant important, and its font is larger.Can find out that four themes are relevant to flower, girl, city, seabeach scenery respectively from Fig. 6 a.Under each theme, point the highest user of influence power and the picture that influence power mark is the highest under this theme of Ta are enumerated out, and as can be seen from the figure, theme vocabulary is relevant to picture.Fig. 6 b show method of the present invention screening at four influential representative pictures of theme.The picture that under each theme, influence power mark is the highest is enumerated out.Four themes are relevant with sky cloud, dark scene, portrait, seashore sunrise respectively, and picture vision content and word keep good consistance to explain.
Above-described specific embodiment; object of the present invention, technical scheme and beneficial effect are further described; be understood that; the foregoing is only specific embodiments of the invention; be not limited to the present invention; within the spirit and principles in the present invention all, any amendment made, equivalent replacement, improvement etc., all should be included within protection scope of the present invention.

Claims (8)

1. the powerful user's of an automatic screening method on social media network, it is characterized in that, it is as follows that the method comprising the steps of:
Step S1: adopt probability potential applications index (PLSI) to carry out modeling to the generation of each object of interest and symbiosis word rate, obtain the observation probability of object of interest and word, add the content of object of interest again, comprise text, visual signature and content consistency therebetween as bound term to obtain the theme probability model of hypergraph constraint regularization;
Step S2: the theme probability model adopting hypergraph constraint regularization, utilize similarity relationships between the content information of object of interest and content information as constraint, automatic learning obtains the interest topic implied;
Step S3: the sequence of theme influence power is carried out to each user and object of interest, similarity propagation model and the user on hypergraph and object of interest and super limit is each other adopted to propagate theme influence power, until stable state, then sequence can obtain the influential user under particular topic.
2. the method for the powerful user of automatic screening on social media network according to claim 1, it is characterized in that, described step S1 comprises: represent user in social media network and object of interest with hypergraph node, surpass limit by homogeneity and represent content similarities between object of interest, represent the social linking relationship of high-order between user and object of interest with heterogeneous super limit.
3. the method for the powerful user of automatic screening on social media network according to claim 2, is characterized in that, the content similarities between described object of interest comprises vision content similarity and content of text similarity, and,
For representing that the super limit construction step of vision content similarity is: for each object of interest, find the object of interest of its K arest neighbors, then surpass limit by a homogeneity and connect these nodes, and weight is set to 1;
For representing that the super limit construction step of content of text similarity is: first extract a dictionary from the text meta-data of all object of interest, then for each word, for all object of interest comprising this word set up a super limit, and weight is set to 1.
4. the method for the powerful user of automatic screening on social media network according to claim 2, is characterized in that, described heterogeneous super limit comprises:
The super limit of owner-multiple object of interest-sole user, the weight on this super limit is set to 1; And,
The super limit of owner-single object of interest-multiple user, the weight on this super limit is set to 1.
5. the method for the powerful user of automatic screening on social media network according to claim 1, is characterized in that, the theme probability model of described hypergraph constraint regularization is: object keeps local similarity in the distribution of theme semantic space.The theme distribution p (z|o) calculating object of interest o is as follows with semantic space theme p (w|z) formula:
L ′ = Σ i = 1 N Σ j = 1 M n ( o i , w j ) log Σ k = 1 K P ( w j | z k ) P ( z k | o i )
P (z|o) and p (w|z) can be obtained by optimizing above formula.Wherein, N is object of interest number, and M is the total number of word, and K is the number of implicit theme.N (o i, w j) be the symbiosis number of word and object of interest, what above formula represented is meant to solve parameter by optimizing likelihood.
6. the method for the powerful user of automatic screening on social media network according to claim 1, it is characterized in that, described step S3 comprises:
Based on the super limit of owner-multiple object of interest-sole user, calculate user force;
Based on the super limit of user force and owner-single object of interest-multiple user, calculate each object of interest influence power;
User force and object of interest influence power iteration are upgraded, until reach stable state, obtains the influence power of each user and object of interest.
7. the method for the powerful user of automatic screening on social media network according to claim 6, is characterized in that, the step of the calculating user force of described step S3 comprises:
Two user u are calculated by following formula i, u jtopic Similarity f k(i, j):
f k ( i , j ) = log g ( u i , u j , k ) Σ z ∈ S g ( u i , u z , k ) , g ( u i , u j , k ) = Σ o p ∈ O u j s k ( o p ) , Wherein, variable with represent influence power message, r k(i, j) is by user's node u isend to u j, represent from user u iangle see, he consenting user u jtheme k affects his degree; a k(i, j) is by user's node u jsend to u i, represent from user u jangle see, he thinks that he is to user u ieffect on theme k; s k(o p) represent object of interest o pinfluence power score on theme k, g (u i, u j, k) be an intermediate variable;
By the super limit pass-along message owner-multiple object of interest-sole user, upgrade user force score as follows:
r k ( i , j ) ← f k ( i , j ) - max z ∈ S ( i ) { f k ( i , z ) + a k ( i , z ) }
a k ( i , j ) ← min { 0 , r k ( j , j ) + Σ z ∉ { i , j } max { 0 , r k ( z , j ) } } ,
a k ( j , j ) ← Σ i ′ ≠ j max { 0 , r k ( i ′ , j ) }
By similar propagation algorithm above, we obtain stable state with wherein S (i) represents user u ithe set having user of interested object of interest;
Influence power between definition user is: use q k(i, j) represents user u jto user u iinfluence power on theme k:
q k ( i , j ) = 1 1 + e - ( r k ( i , j ) + a k ( i , j ) ) ;
Calculate the global impact power of user at theme:
s k ( j ) = η Σ i : i → j s k ( i ) p k ( j | i ) + ( 1 - η ) v j k , Wherein η is a controling parameters,
P k(j|i) user u is represented ito user u jtransition probability, and
wherein user u jinitialization in the influence power of theme k, v j k = Σ o i ∈ O v j P ( z k | o i ) ;
To formula s k ( j ) = η Σ i : i → j s k ( i ) p k ( j | i ) + ( 1 - η ) v j k Solving the user force obtaining stable state is
s u k = ( 1 - η ) ( I - η Q k ) - 1 v k .
8. the method for the powerful user of automatic screening on social media network according to claim 6, is characterized in that, the formula calculating object of interest influence power in described step S3 is:
Utilize s o k ( o p ) = P ( z k | o p ) ( β Σ z = 1 C s k ( u z ) + ( 1 - β ) s k ( u h ) ) , Wherein C is to object of interest o pthe user become interested, β is a controling parameters.
CN201210455018.1A 2012-11-13 2012-11-13 The method of the powerful user of automatic screening on social media network Active CN103020116B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210455018.1A CN103020116B (en) 2012-11-13 2012-11-13 The method of the powerful user of automatic screening on social media network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210455018.1A CN103020116B (en) 2012-11-13 2012-11-13 The method of the powerful user of automatic screening on social media network

Publications (2)

Publication Number Publication Date
CN103020116A CN103020116A (en) 2013-04-03
CN103020116B true CN103020116B (en) 2015-12-16

Family

ID=47968720

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210455018.1A Active CN103020116B (en) 2012-11-13 2012-11-13 The method of the powerful user of automatic screening on social media network

Country Status (1)

Country Link
CN (1) CN103020116B (en)

Families Citing this family (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014193399A1 (en) * 2013-05-31 2014-12-04 Hewlett-Packard Development Company, L.P. Influence score of a brand
CN104239343B (en) 2013-06-20 2018-04-27 腾讯科技(深圳)有限公司 A kind of user inputs the treating method and apparatus of information
CN103838806B (en) * 2013-10-10 2017-04-12 哈尔滨工程大学 Analysis method for subject participation behaviors of user in social network
CN103559320B (en) * 2013-11-21 2016-08-24 北京邮电大学 The method that object in heterogeneous network is ranked up
CN104008182B (en) * 2014-06-10 2017-07-14 盐城师范学院 The assay method and system of social networks exchange influence power
CN105446973B (en) * 2014-06-20 2019-02-26 华为技术有限公司 The foundation of user's recommended models and application method and device in social networks
CN104090971A (en) * 2014-07-17 2014-10-08 中国科学院自动化研究所 Cross-network behavior association method for individual application
CN104598605B (en) * 2015-01-30 2018-01-12 福州大学 A kind of user force appraisal procedure in social networks
CN106156117B (en) * 2015-04-07 2018-05-01 中国科学院信息工程研究所 Hidden community's core communication circle detection towards particular topic finds method and system
CN106203470A (en) * 2016-06-22 2016-12-07 南京航空航天大学 A kind of multi-modal feature selection based on hypergraph and sorting technique
CN106372239A (en) * 2016-09-14 2017-02-01 电子科技大学 Social network event correlation analysis method based on heterogeneous network
WO2018077301A1 (en) * 2016-10-31 2018-05-03 中国科学技术大学先进技术研究院 Account screening method and apparatus
CN107145519B (en) * 2017-04-10 2020-07-03 浙江大学 Image retrieval and annotation method based on hypergraph
CN107391577B (en) * 2017-06-20 2020-04-03 中国科学院计算技术研究所 Work label recommendation method and system based on expression vector
CN109213852B (en) * 2018-07-13 2021-10-22 北京第二外国语学院 Tourist destination picture recommendation method
CN109447261B (en) * 2018-10-09 2023-08-04 北京邮电大学 Network representation learning method based on multi-order proximity similarity
CN110209962B (en) * 2019-06-12 2021-02-26 合肥工业大学 Method and system for acquiring theme-level high-influence user
CN110609816B (en) * 2019-08-30 2022-12-20 维沃移动通信有限公司 Information sharing method, information sharing device and terminal
CN111191882B (en) * 2019-12-17 2022-11-25 安徽大学 Method and device for identifying influential developers in heterogeneous information network
CN112148991A (en) * 2020-10-16 2020-12-29 重庆理工大学 Social network node influence recommendation method for fusion degree discount and local node
CN112511411A (en) * 2020-12-07 2021-03-16 郁剑 Visual transmission method of new media image under 5G background
CN114580427B (en) * 2021-12-29 2024-06-14 北京邮电大学 Self-media user selection method and related equipment

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101390096A (en) * 2006-02-27 2009-03-18 微软公司 Training a ranking function using propagated document relevance
CN101770487A (en) * 2008-12-26 2010-07-07 聚友空间网络技术有限公司 Method and system for calculating user influence in social network

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110072047A1 (en) * 2009-09-21 2011-03-24 Microsoft Corporation Interest Learning from an Image Collection for Advertising

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101390096A (en) * 2006-02-27 2009-03-18 微软公司 Training a ranking function using propagated document relevance
CN101770487A (en) * 2008-12-26 2010-07-07 聚友空间网络技术有限公司 Method and system for calculating user influence in social network

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
Clustering by passing messages between data points;Brendan J.Frey等;《Science》;20070331;全文 *
Twitterrank:Finding topic-sensitive influential twitterers;Jianshu Weng等;《3rd ACM Int.Conf.Web Search and Data Mining》;20100206;全文 *
基于概率潜在语义分析的图像场景分类;陈红娟;《中国优秀硕士学位论文全文数据库》;20111215;全文 *
超图在数据挖掘领域中的几个应用;崔阳等;《计算机科学》;20100630;第37卷(第6期);全文 *

Also Published As

Publication number Publication date
CN103020116A (en) 2013-04-03

Similar Documents

Publication Publication Date Title
CN103020116B (en) The method of the powerful user of automatic screening on social media network
CN103092911B (en) A kind of mosaic society label similarity is based on the Collaborative Filtering Recommendation System of k nearest neighbor
CN102880644B (en) Community discovering method
CN110837578B (en) Video clip recommendation method based on graph convolution network
CN109214454B (en) Microblog-oriented emotion community classification method
CN105843860B (en) A kind of microblogging concern recommended method based on parallel item-based collaborative filtering
CN104462383A (en) Movie recommendation method based on feedback of users' various behaviors
Amplayo Rethinking attribute representation and injection for sentiment classification
CN113626723B (en) Attribute graph community searching method and system based on representation learning
Zhang et al. Dynamical analysis of Hyper-SIR rumor spreading model
CN109947987A (en) A kind of intersection collaborative filtering recommending method
Lei et al. Social diffusion analysis with common-interest model for image annotation
CN110929683B (en) Video public opinion monitoring method and system based on artificial intelligence
CN101894129A (en) Video topic finding method based on online video-sharing website structure and video description text information
CN113761359A (en) Data packet recommendation method and device, electronic equipment and storage medium
Sun et al. Graph force learning
Li et al. Sentiment analysis of Weibo comments based on graph neural network
CN112765490A (en) Information recommendation method and system based on knowledge graph and graph convolution network
Xiong et al. TDCTFIC: a novel recommendation framework fusing temporal dynamics, CNN-based text features and item correlation
CN113744023B (en) Double-channel collaborative filtering recommendation method based on graph convolution network
CN115545098A (en) Node classification method of three-channel graph neural network based on attention mechanism
CN112734519B (en) Commodity recommendation method based on convolution self-encoder network
CN113343121A (en) Lightweight graph convolution collaborative filtering recommendation method based on multi-granularity popularity characteristics
Shaobo et al. A key technology survey and summary of dynamic network visualization
CN117540111B (en) Preference perception socialization recommendation method based on graph neural network

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant