Hi Sebastian...
while referring the paper,paper talks about the normalization of L(G)
matrix..Below is the few lines from the paper which talks about it..
Computing Normalization Factors. The ith element of the
diagonal matrix D contains the sum of ith column of L(G).
D is used to columnnormalize L(G) so that the resulting
matrix can be used for the power iteration. The ’./’ in line 5
represents the elementwise inverse operation.
One more question...
Is LineRank algo is applicable to undirected and weighted graph?
Thanks
On Mon, Jan 20, 2014 at 2:40 PM, Sebastian Schelter <ssc@apache.org> wrote:
> Jyoti,
>
> We started with a Matlab implementation on a small example graph and saw
> the algorithm converge. I don't think that the paper mentions that you have
> to normalize the matrix in a certain way.
>
> In the standard power iteration, the vector that estimates the principal
> eigenvector has to be rescaled to unit length. IIRC this is also done in
> the LineRank algorithm in the paper.
>
> sebastian
>
>
>
> On 01/20/2014 10:04 AM, Jyoti Yadav wrote:
>
>> Hi Sebastian..
>> I code this algorithm,but while running,it is not converging..
>> One more question,for power iteration.is it necessary to column normalize
>> the matrix or we can work with row normalized matrix?
>>
>> Thanks
>> Jyoti
>>
>>
>> On Mon, Jan 20, 2014 at 1:45 PM, Sebastian Schelter <ssc@apache.org>
>> wrote:
>>
>> I have a student working on an implementation, do you have questions?
>>>
>>>
>>> On 01/20/2014 08:11 AM, Jyoti Yadav wrote:
>>>
>>> Hi..
>>>> Is there anyone who is working with linerank algorithm??
>>>>
>>>> Thanks
>>>> Jyoti
>>>>
>>>>
>>>>
>>>
>>
>
