Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework(Data Mining)
スポンサーリンク
概要
- 論文の詳細を見る
There are several methods for mining communities on the Web using hyperlinks. One of the well-known ones is a max-flow based method proposed by Flake et al. The method adopts a page-oriented framework, that is, it uses a page on the Web as a unit of information, like other methods including HITS and trawling. Recently, Asano et al. built a site-oriented framework which uses a site as a unit of information, and they experimentally showed that trawling on the site-oriented framework often outputs significantly better communities than trawling on the page-oriented framework. However, it has not been known whether the site-oriented framework is effective in mining communities through the max-flow based method. In this paper, we first point out several problems of the max-flow based method, mainly owing to the page-oriented framework, and then propose solutions to the problems by utilizing several advantages of the site-oriented framework. Computational experiments reveal that our max-flow based method on the site-oriented framework is very effective in mining communities, related to the topics of given pages, in comparison with the original max-flow based method on the page-oriented framework.
- 社団法人電子情報通信学会の論文
- 2006-10-01
著者
-
Nishizeki Takao
Graduate School Of Information Sciences Tohoku University
-
Nishizeki Takao
Graduate School Of Information Sciences
-
KITSUREGAWA Masaru
Institute of Industrial Science, The University of Tokyo
-
ASANO Yasuhito
Department of Information Sciences, Faculty of Science and Engineering, Tokyo Denki University
-
TOYODA Masashi
Institute of Industrial Science, The University of Tokyo
-
Toyoda M
Institute Of Industrial Science The University Of Tokyo
-
Asano Yasuhito
Department Of Information Sciences Faculty Of Science And Engineering Tokyo Denki University
-
Toyoda Masashi
Institute Of Industrial Science The University Of Tokyo
-
Kitsuregawa M
Institute Of Industrial Science The University Of Tokyo
-
Kitsuregawa Masaru
Institute Of Industrial Science The University Of Tokyo
関連論文
- List Edge-Colorings of Series-Parallel Graphs
- Linear Algorithm for Finding List Edge-Colorings of Series-Parallel Graphs (Special Issue on Selected Papers from LA Symposium)
- Quantum Card Dealing
- Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups(Special Issue on Selected Papers from LA Symposium)
- Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs(Discrete Mathematics and Its Applications)
- Algorithms for Drawing Plane Graphs(Foundations of Computer Science)
- 平面グラフの格子短形描画
- On the One-Way Algebraic Homomorphism (Special Section on Cryprography and Information Security)
- Cost Total Colorings of Trees(Foundations of Computer Science)
- Display Wall Empowered Visual Mining for CEOP Data Archive(Coordinated Enhanced Observing Period(CEOP))
- Data Analysis System Attached to the CEOP Centralized Data Archive System(Coordinated Enhanced Observing Period(CEOP))
- QUASUR : Web-based Quality Assurance System for CEOP Reference Data(Coordinated Enhanced Observing Period(CEOP))
- Initial CEOP-based Review of the Prediction Skill of Operational General Circulation Models and Land Surface Models(Coordinated Enhanced Observing Period(CEOP))
- 5ZN-9 A Topical Study on the Web Spam
- Overview of the Super Database Computer (SDC-I) (Special Issue on Super Chip for Intelligent Integrated Systems)
- LA-10 A Linear Algorithm for Rectangular Drawings of Planar Graphs
- LA-9 Rectangle-of-Influence Drawings of Four-Connected Plane Graphs
- Edge-Coloring Problems for Graphs
- Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework(Data Mining)
- Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size(Graph Algorithms,Foundations of Computer Science)
- Algorithms for Multicolorings of Partial ★-Trees (Special Issue on Selected Papers from LA Symposium)
- Convex Drawings of Internally Triconnected Plane Graphs on O(n^2) Grids
- Best Security Index for Digital Fingerprinting(Information Hiding, Cryptography and Information Security)
- Efficient Compression of Web Graphs
- Generalized Edge-Rankings of Trees
- One-Way Functions over Finite Near-Rings
- Compact Encoding of the Web Graph Exploiting Various Power Distributions(Discrete Mathematics and Its Applications)
- Finding Neighbor Communities in the Web Using an Inter-Site Graph(Database)
- Speculative Transaction Processing Approach for Database Systems
- Join Strategies on Grid-Files
- Join Strategies on Multi-Dimensional C1ustered Relations
- An Economic Dynamic Replication Model for Mobile-P2P networks (夏のデータベースワークショップDBWS 2006)
- An Economic Dynamic Replication Model for Mobile-P2P networks
- Performance Evaluation of Flash SSDs in a Transaction Processing System
- Rank Optimization of Personalized Search
- High Performanee Parallel Query Processing on a 100 Node ATM Connected PC Cluster (Special Issue on New Generation Database Technologies)
- Web Community Chart : A Tool for Navigating the Web and Observing Its Evolution
- Detecting Hijacked Sites by Web Spammer Using Link-Based Algorithms
- A Study of Link Farm Evolution Using a Time-series of Web Snapshots
- A Study of Link Farm Evolution Using a Time-series of Web Snapshots
- Efficient Analyzing General Dominant Relationship Based on Partial Order Models
- Examination of Criterion for Choosing a Run Time Method in GN Hash Join Algorithm
- Finding Web Communities by Maximum Flow Algorithm Using Well-Assigned Edge Capacities(Information Processing Technology for Web Utilization)
- D-3 An Link-Contents Coupled Clustering for Web Search Results
- Speculative Transaction Processing in Distributed Database Systems
- Foreword to the Special Issue on Japanese Microprocessors
- Virtual Striping: A Storage Management Scheme with Dynamic Striping (Special Issue on Architectures, Algorithms and Networks for Massively parallel Computing)
- A Study on Characteristics of Topic-Specific Information Cascade in Twitter (データ工学)
- A Study on Efficient Searching Top-k Semantic Similar Sentences (データ工学)
- Efficient Classification with Conjunctive Features
- A Study on Characteristics of Topic-Specific Information Cascade in Twitter
- A Study on Efficient Searching Top-k Semantic Similar Sentences
- A Study on Graph Similarity Search
- Semi-supervised Sentiment Classification in Resource-Scarce Language : A Comparative Study
- A Study on Graph Similarity Search
- Exploration on Efficient Similar Sentences Extraction
- A Study on Similar Words Searching (データ工学)
- Semi-supervised Sentiment Classification in Resource-Scarce Language : A Comparative Study
- A Study on Graph Similarity Search
- Collective Sentiment Classification Based on User Leniency and Product Popularity
- A Study on Similar Words Searching