Sciweavers

1013 search results - page 117 / 203
» Comparisons Between Data Clustering Algorithms
Sort
View
ICRA
2010
IEEE
150views Robotics» more  ICRA 2010»
13 years 7 months ago
Consistency of the monocular EKF-SLAM algorithm for three different landmark parametrizations
We benchmark in this article three different landmark parametrizations in monocular 6DOF EKF-SLAM. These parametrizations are homogeneous points (HP), inversedistance points (IDP, ...
Joan Solà
PR
2007
189views more  PR 2007»
13 years 8 months ago
Information cut for clustering using a gradient descent approach
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
Robert Jenssen, Deniz Erdogmus, Kenneth E. Hild II...
DAWAK
2000
Springer
14 years 1 months ago
Enhancing Preprocessing in Data-Intensive Domains using Online-Analytical Processing
Abstract The application of data mining algorithms needs a goal-oriented preprocessing of the data. In practical applications the preprocessing task is very time consuming and has ...
Alexander Maedche, Andreas Hotho, Markus Wiese
IEEECIT
2010
IEEE
13 years 7 months ago
The Research on Teaching Method of Basics Course of Computer based on Cluster Analysis
Due to the difference between rural and urban and regional disparity of computer basic education produced at their middle school period, computer application level of the freshmen ...
ZhiXin Tie, Rong Jin, Hong Zhuang, Zhaoqing Wang
BMCBI
2010
149views more  BMCBI 2010»
13 years 9 months ago
KID - an algorithm for fast and efficient text mining used to automatically generate a database containing kinetic information o
Background: The amount of available biological information is rapidly increasing and the focus of biological research has moved from single components to networks and even larger ...
Stephanie Heinen, Bernhard Thielen, Dietmar Schomb...