Sciweavers

237 search results - page 4 / 48
» Finding Metric Structure in Information Theoretic Clustering
Sort
View

Publication
417views
15 years 6 months ago
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
Peter N. Yianilos
BMCBI
2007
168views more  BMCBI 2007»
14 years 9 months ago
GOSim - an R-package for computation of information theoretic GO similarities between terms and gene products
Background: With the increased availability of high throughput data, such as DNA microarray data, researchers are capable of producing large amounts of biological data. During the...
Holger Fröhlich, Nora Speer, Annemarie Poustk...
BCSHCI
2009
14 years 10 months ago
How do people find information on a familiar website?
Previous research has investigated how people either navigate the web as a whole, or find information on websites of which they have little previous knowledge. However, it is now ...
Roy A. Ruddle
78
Voted
WWW
2005
ACM
15 years 3 months ago
Finding the boundaries of information resources on the web
In recent years, many algorithms for the Web have been developed that work with information units distinct from individual web pages. These include segments of web pages or aggreg...
Pavel Dmitriev, Carl Lagoze, Boris Suchkov
ICDM
2007
IEEE
140views Data Mining» more  ICDM 2007»
15 years 3 months ago
Finding Cohesive Clusters for Analyzing Knowledge Communities
Documents and authors can be clustered into “knowledge communities” based on the overlap in the papers they cite. We introduce a new clustering algorithm, Streemer, which fin...
Vasileios Kandylas, S. Phineas Upham, Lyle H. Unga...