Searching for authors named "Panayiotis Tsaparas" – sorted by Relevance.
12 documents found, showing 1 through 10.
Next 10 →
-
Nearest Neighbor Search in Multidimensional Spaces
- …The Nearest Neighbor Search problem is defined as follows: given a set P of n points, preprocess the points so as to efficiently answer queries that require finding the closest point in P to a query point q. If we are willing to settle for a point that is almost as close as the nearest neighbor, t…
- Cited by 7 (0 self) – Add To MetaCart
-
Stability and similarity of link analysis ranking algorithms
- …Abstract. Recently, there has been a surge of research activity in the area of Link Analysis Ranking, where hyperlink structures are used to determine the relative authority of Web pages. One of the seminal works in this area is that of Kleinberg [15], who proposed the HITS algorithm. In this paper,…
- Cited by 1 (0 self) – Add To MetaCart
-
Mining the inner structure of the web graph
- …ABSTRACT. The bow-tie picture, presented by Broder et al. [3] in 2000, has been up to now the only strong characterization of the well defined structure of the World Wide Web, namely the hyperlinked graph induced by the links among the static html pages. This evocative picture is a clear abstraction…
- Cited by 5 (1 self) – Add To MetaCart
-
Clustering aggregation
- …We consider the following problem: given a set of clusterings, find a clustering that agrees as much as possible with the given clusterings. This problem, clustering aggregation, appears naturally in various contexts. For example, clustering categorical data is an instance of the problem: each categ…
- Cited by 22 (1 self) – Add To MetaCart
-
Assessing data mining results via swap randomization
- …The problem of assessing the significance of data mining results on high-dimensional 0–1 data sets has been studied extensively in the literature. For problems such as mining frequent sets and finding correlations, significance testing can be done by, e.g., chi-square tests, or many other methods. H…
- Cited by 7 (3 self) – Add To MetaCart
-
Ranked Join Indices
- …be ordered according to a variety of attributes associated with the entities. Such orderings result effectively in a ranking of the entities according to the values in the attribute domain. Commonly, users correlate such sources for query processing purposes through join operations. In query proces…
- Cited by 10 (0 self) – Add To MetaCart
-
Mining Significant Associations in Large Scale Text Corpora
- …Mining large-scale text corpora is an essential step in extracting the key themes in a corpus. We motivate a quantitative measure for significant associations through the distributions of pairs and triplets of co-occurring words. We consider the algorithmic problem of efficiently enumerating such si…
- Add To MetaCart
-
scalable clustering of categorical data
- …Abstract. Clustering is a problem of great practical importance in numerous applications. The problem of clustering becomes more challenging when the data is categorical, that is, when there is no inherent distance measure between data values. We introduce LIMBO, a scalable hierarchical categorical …
- Cited by 12 (3 self) – Add To MetaCart
-
Mining Chains of Relations
- …Traditional data mining applications consider the problem of mining a single relation between two attributes. For example, in a scientific bibliography database, authors are related to papers, and we may be interested in discovering association rules between authors. However, in real life, we often …
- Cited by 1 (0 self) – Add To MetaCart
-
Finding Authorities and Hubs From Link Structures on the World Wide Web
- …Recently, there have been a number of algorithms proposed for analyzing hypertext link structure so as to determine the best "authorities" for a given topic or query. While such analysis is usually combined with content analysis, there is a sense in which some algorithms are deemed to be "more balan…
- Cited by 63 (8 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
