Sciweavers

728 search results - page 91 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
ICDM
2010
IEEE
226views Data Mining» more  ICDM 2010»
13 years 5 months ago
Edge Weight Regularization over Multiple Graphs for Similarity Learning
The growth of the web has directly influenced the increase in the availability of relational data. One of the key problems in mining such data is computing the similarity between o...
Pradeep Muthukrishnan, Dragomir R. Radev, Qiaozhu ...
SDM
2008
SIAM
139views Data Mining» more  SDM 2008»
13 years 9 months ago
Proximity Tracking on Time-Evolving Bipartite Graphs
Given an author-conference network that evolves over time, which are the conferences that a given author is most closely related with, and how do they change over time? Large time...
Hanghang Tong, Spiros Papadimitriou, Philip S. Yu,...
ICDM
2010
IEEE
122views Data Mining» more  ICDM 2010»
13 years 5 months ago
Interesting Subset Discovery and Its Application on Service Processes
Various real-life datasets can be viewed as a set of records consisting of attributes explaining the records and set of measures evaluating the records. In this paper, we address t...
Maitreya Natu, Girish Keshav Palshikar
ICDM
2003
IEEE
119views Data Mining» more  ICDM 2003»
14 years 1 months ago
A Dynamic Adaptive Self-Organising Hybrid Model for Text Clustering
Clustering by document concepts is a powerful way of retrieving information from a large number of documents. This task in general does not make any assumption on the data distrib...
Chihli Hung, Stefan Wermter
ADMA
2006
Springer
172views Data Mining» more  ADMA 2006»
14 years 1 months ago
Experimental Comparison of Feature Subset Selection Using GA and ACO Algorithm
Abstract. Practical pattern classification and knowledge discovery problems require selecting a useful subset of features from a much larger set to represent the patterns to be cl...
Keunjoon Lee, Jinu Joo, Jihoon Yang, Vasant Honava...