S. Tint, and M. Aung. Advanced Computational Intelligence: An International Journal (ACII), 1 (2):
8(October 2014)
Abstract
Now, information is useful for every environment in which time similarity is more important case. The most
of people are strongly interested in Internet. Web pages in the Internet are linked thorough hyperlinks that
contain useful information. By using hyperlinks, web graphs are constructed for time similarity web links in
which webs have been seen by users at past. These activities are needed to use for tracing who used the
websites for something at the time. So this paper provides the history of users who connect the person
started the news. We found that the normalized-cut method with the new similarity metric is particularly
effective, as demonstrated on a web log file
%0 Journal Article
%1 noauthororeditor
%A Tint, San San
%A Aung, May Yi
%D 2014
%J Advanced Computational Intelligence: An International Journal (ACII)
%K Cut Decomposition Eigenvalue Graph Metric Normalized Partitioning Similarity Web Wide World
%N 2
%P 8
%T Web Graph Clustering Using Hyperlink Structure
%U http://airccse.org/journal/acii/papers/1214acii03.pdf
%V 1
%X Now, information is useful for every environment in which time similarity is more important case. The most
of people are strongly interested in Internet. Web pages in the Internet are linked thorough hyperlinks that
contain useful information. By using hyperlinks, web graphs are constructed for time similarity web links in
which webs have been seen by users at past. These activities are needed to use for tracing who used the
websites for something at the time. So this paper provides the history of users who connect the person
started the news. We found that the normalized-cut method with the new similarity metric is particularly
effective, as demonstrated on a web log file
@article{noauthororeditor,
abstract = {Now, information is useful for every environment in which time similarity is more important case. The most
of people are strongly interested in Internet. Web pages in the Internet are linked thorough hyperlinks that
contain useful information. By using hyperlinks, web graphs are constructed for time similarity web links in
which webs have been seen by users at past. These activities are needed to use for tracing who used the
websites for something at the time. So this paper provides the history of users who connect the person
started the news. We found that the normalized-cut method with the new similarity metric is particularly
effective, as demonstrated on a web log file},
added-at = {2018-04-03T04:37:43.000+0200},
author = {Tint, San San and Aung, May Yi},
biburl = {https://www.bibsonomy.org/bibtex/283cbca5b46b727262e4ec9fd68d0280f/janakirob},
interhash = {c33a59800405f1756fbb7f6a7a242b2c},
intrahash = {83cbca5b46b727262e4ec9fd68d0280f},
issn = {2454 - 3934},
journal = {Advanced Computational Intelligence: An International Journal (ACII)},
keywords = {Cut Decomposition Eigenvalue Graph Metric Normalized Partitioning Similarity Web Wide World},
language = {English},
month = {October},
number = 2,
pages = 8,
timestamp = {2018-04-03T04:37:43.000+0200},
title = {Web Graph Clustering Using Hyperlink Structure },
url = {http://airccse.org/journal/acii/papers/1214acii03.pdf},
volume = 1,
year = 2014
}