Sciweavers

1913 search results - page 301 / 383
» Using Data Mining in MURA Graphic Problems
Sort
View
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
16 years 8 days ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
DILS
2005
Springer
15 years 5 months ago
PLATCOM: Current Status and Plan for the Next Stages
We have been developing a system for comparing multiple genomes, PLATCOM, where users can choose genomes of their choice freely and perform analysis of the selected genomes with a...
Kwangmin Choi, Jeong-Hyeon Choi, Amit Saple, Zhipi...
KDD
2010
ACM
235views Data Mining» more  KDD 2010»
15 years 3 months ago
New perspectives and methods in link prediction
This paper examines important factors for link prediction in networks and provides a general, high-performance framework for the prediction task. Link prediction in sparse network...
Ryan Lichtenwalter, Jake T. Lussier, Nitesh V. Cha...
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
16 years 8 days ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 3 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing