Sciweavers

105 search results - page 12 / 21
» V-Trees - A Storage Method for Long Vector Data
Sort
View
KDD
2010
ACM
249views Data Mining» more  KDD 2010»
13 years 9 months ago
Semi-supervised sparse metric learning using alternating linearization optimization
In plenty of scenarios, data can be represented as vectors mathematically abstracted as points in a Euclidean space. Because a great number of machine learning and data mining app...
Wei Liu, Shiqian Ma, Dacheng Tao, Jianzhuang Liu, ...
CIKM
2008
Springer
13 years 9 months ago
Identifying table boundaries in digital documents via sparse line detection
Most prior work on information extraction has focused on extracting information from text in digital documents. However, often, the most important information being reported in an...
Ying Liu, Prasenjit Mitra, C. Lee Giles
CIKM
2009
Springer
14 years 2 months ago
Maximal metric margin partitioning for similarity search indexes
We propose a partitioning scheme for similarity search indexes that is called Maximal Metric Margin Partitioning (MMMP). MMMP divides the data on the basis of its distribution pat...
Hisashi Kurasawa, Daiji Fukagawa, Atsuhiro Takasu,...
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
14 years 1 months ago
Fast On-line Kernel Learning for Trees
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
ISSAC
2007
Springer
107views Mathematics» more  ISSAC 2007»
14 years 1 months ago
A disk-based parallel implementation for direct condensation of large permutation modules
Through the use of a new disk-based method for enumerating very large orbits, condensation for orbits with tens of billions of elements can be performed. The algorithm is novel in...
Eric Robinson, Jürgen Müller 0004, Gene ...