Sciweavers

421 search results - page 45 / 85
» Random Indexing using Statistical Weight Functions
Sort
View
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 9 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
DAWAK
2000
Springer
14 years 25 days ago
COFE: A Scalable Method for Feature Extraction from Complex Objects
Abstract. Feature Extraction, also known as Multidimensional Scaling, is a basic primitive associated with indexing, clustering, nearest neighbor searching and visualization. We co...
Gabriela Hristescu, Martin Farach-Colton
IR
2007
13 years 8 months ago
Searching strategies for the Bulgarian language
This paper reports on the underlying IR problems encountered when indexing and searching with the Bulgarian language. For this language we propose a general light stemmer and demon...
Jacques Savoy
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
13 years 10 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
ISNN
2007
Springer
14 years 2 months ago
Neural-Based Separating Method for Nonlinear Mixtures
A neural-based method for source separation in nonlinear mixture is proposed in this paper. A cost function, which consists of the mutual information and partial moments of the out...
Ying Tan