English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  A Neighborhood-Based Approach for Clustering of Linked Document Collections

Angelova, R., & Siersdorfer, S. (2006). A Neighborhood-Based Approach for Clustering of Linked Document Collections. In Proceedings of the Conference on Information and Knowledge Management, CIKM 2006 (pp. 778-779). New York, USA: ACM.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-21FE-0 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-21FF-E
Genre: Conference Paper

Files

show Files
hide Files
:
CIKM418-Angelova.pdf (Any fulltext), 182KB
 
File Permalink:
-
Name:
CIKM418-Angelova.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. CIKM’06, November 5–11, 2006, Arlington, Virginia, USA. Copyright 2006 ACM 1595934332/ 06/0011 ...$5.00.
License:
-

Locators

show

Creators

show
hide
 Creators:
Angelova, Ralitsa1, Author           
Siersdorfer, Stefan1, Author           
Yu, Philip S., Editor
Tsotras, Vassilis J., Editor
Fox, Edward A., Editor
Liu, Bing, Editor
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              

Content

show
hide
Free keywords: -
 Abstract: This paper addresses the problem of automatically structuring linked document collections by using clustering. In contrast to traditional clustering, we study the clustering problem in the light of available link structure information for the data set (e.g., hyperlinks among web documents or co-authorship among bibliographic data entries). Our approach is based on iterative relaxation of cluster assignments, and can be built on top of any clustering algorithm. This technique results in higher cluster purity, better overall accuracy, and make self-organization more robust.

Details

show
hide
Language(s): eng - English
 Dates: 2007-04-272006
 Publication Status: Issued
 Pages: -
 Publishing info: New York, USA : ACM
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 314371
Other: Local-ID: C1256DBF005F876D-498F341B6EEBA286C125726600466CC3-AngelovaCIKM2006
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Arlington, VA, USA
Start-/End Date: 2006-11-06

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the Conference on Information and Knowledge Management, CIKM 2006
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, USA : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 778 - 779 Identifier: ISBN: 1-59593-433-2