Sciweavers

7150 search results - page 1042 / 1430
» Graph-Based Data Mining
Sort
View
DKE
2002
218views more  DKE 2002»
15 years 4 months ago
Computing iceberg concept lattices with T
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas P...
ISB
2002
140views more  ISB 2002»
15 years 4 months ago
Computer system "Gene Discovery" for promoter structure analysis
Data Mining and Knowledge Discovery techniques proved to be efficient tools for variety of complex tasks in biology including DNA research. This paper presents implementation of th...
Eugenii E. Vityaev, Yuri L. Orlov, Oleg V. Vishnev...
124
Voted
PKDD
2010
Springer
128views Data Mining» more  PKDD 2010»
15 years 2 months ago
Learning to Tag from Open Vocabulary Labels
Most approaches to classifying media content assume a fixed, closed vocabulary of labels. In contrast, we advocate machine learning approaches which take advantage of the millions...
Edith Law, Burr Settles, Tom M. Mitchell
PKDD
2010
Springer
183views Data Mining» more  PKDD 2010»
15 years 2 months ago
Fast Active Exploration for Link-Based Preference Learning Using Gaussian Processes
Abstract. In preference learning, the algorithm observes pairwise relative judgments (preference) between items as training data for learning an ordering of all items. This is an i...
Zhao Xu, Kristian Kersting, Thorsten Joachims
PKDD
2010
Springer
158views Data Mining» more  PKDD 2010»
15 years 2 months ago
Learning Sparse Gaussian Markov Networks Using a Greedy Coordinate Ascent Approach
In this paper, we introduce a simple but efficient greedy algorithm, called SINCO, for the Sparse INverse COvariance selection problem, which is equivalent to learning a sparse Ga...
Katya Scheinberg, Irina Rish
« Prev « First page 1042 / 1430 Last » Next »