Name
Abstract | ||
|---|---|---|
The link structure of the Web is generally viewed as the webgraph, and web structure mining is a research area that mainly aims to find hidden communities in the Web and so on, by focusing on the webgraph. In this paper, we identify a common frequent substructure by observing the webgraph, and newly define it as an isolated star (i-star). We propose an efficient enumeration algorithm of i-stars, and try structure mining by enumerating them from the real web data. As a result, we observed that most of i-stars correspond to index structures in single domains, while some of them are verified to stand for useful communities, which implies the validity of i-stars as candidate substructure for structure mining. We also suggest that the notion of i-star can be a helpful tool for preprocessing the webgraph to have its succinct representation for further structure mining. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/978-3-540-78808-9_14 | WAW |
Keywords | Field | DocType |
common frequent substructure,structure mining,hidden community,real web data,web structure mining,helpful tool,link structure,efficient enumeration algorithm,isolated stars,index structure,candidate substructure,link analysis,single domain | Data mining,Structure mining,Web mining,Webgraph,Stars,Computer science,Link analysis,Preprocessor,Web community,Substructure | Conference |
Volume | ISSN | Citations |
4936 | 0302-9743 | 2 |
PageRank | References | Authors |
0.39 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| yushi uno | 1 | 222 | 28.80 |
| Yoshinobu Ota | 2 | 3 | 1.09 |
| Akio Uemichi | 3 | 3 | 0.75 |