Sciweavers

5046 search results - page 925 / 1010
» Non-redundant data clustering
Sort
View
SPIRE
2005
Springer
14 years 1 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
WINE
2005
Springer
109views Economy» more  WINE 2005»
14 years 1 months ago
New Algorithms for Mining the Reputation of Participants of Online Auctions
The assessment of credibility and reputation of contractors in online auctions is the key issue in providing reliable environment for customer-to-customer e-commerce. Confident re...
Mikolaj Morzy
WINE
2005
Springer
143views Economy» more  WINE 2005»
14 years 1 months ago
An Analysis of Search Engine Switching Behavior Using Click Streams
In this paper, we propose a simple framework to characterize the switching behavior between search engines based on click streams. We segment users into a number of categories bas...
Yun-Fang Juan, Chi-Chao Chang
GECCO
2005
Springer
150views Optimization» more  GECCO 2005»
14 years 1 months ago
A GA for maximum likelihood phylogenetic inference using neighbour-joining as a genotype to phenotype mapping
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the t...
Leon Poladian
DOLAP
2004
ACM
14 years 1 months ago
Developing a characterization of business intelligence workloads for sizing new database systems
Computer system sizing involves estimating the amount of hardware resources needed to support a new workload not yet deployed in a production environment. In order to determine th...
Ted J. Wasserman, Patrick Martin, David B. Skillic...