Sciweavers

112 search results - page 18 / 23
» Neighborhood based fast graph search in large networks
Sort
View
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 2 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
GECCO
2009
Springer
254views Optimization» more  GECCO 2009»
15 years 4 months ago
Agglomerative genetic algorithm for clustering in social networks
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ļ¬...
Marek Lipczak, Evangelos E. Milios
84
Voted
AAAI
2008
14 years 12 months ago
Markov Blanket Feature Selection for Support Vector Machines
Based on Information Theory, optimal feature selection should be carried out by searching Markov blankets. In this paper, we formally analyze the current Markov blanket discovery ...
Jianqiang Shen, Lida Li, Weng-Keen Wong
MM
2009
ACM
198views Multimedia» more  MM 2009»
15 years 2 months ago
Scalable detection of partial near-duplicate videos by visual-temporal consistency
Following the exponential growth of social media, there now exist huge repositories of videos online. Among the huge volumes of videos, there exist large numbers of near-duplicate...
Hung-Khoon Tan, Chong-Wah Ngo, Richang Hong, Tat-S...
SSDBM
2007
IEEE
172views Database» more  SSDBM 2007»
15 years 3 months ago
Enabling Real-Time Querying of Live and Historical Stream Data
Applications that query data streams in order to identify trends, patterns, or anomalies can often benefit from comparing the live stream data with archived historical stream dat...
Frederick Reiss, Kurt Stockinger, Kesheng Wu, Arie...