Sciweavers

    KDD
    2009
    ACM
    611views Data Mining» more  KDD 2009»
    Fast approximate spectral clustering
    14 years 5 months ago
    Fast approximate spectral clustering
    Download  www2.berkeley.intel-research.net
    Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
    Donghui Yan, Ling Huang, Michael I. Jordan
    claim paper
    Read More »
    KDD
    2009
    ACM
    243views Data Mining» more  KDD 2009»
    Exploiting Wikipedia as external knowledge for document clustering
    14 years 5 months ago
    Exploiting Wikipedia as external knowledge for document clustering
    Download  www-ai.cs.uni-dortmund.de
    In traditional text clustering methods, documents are represented as "bags of words" without considering the semantic information of each document. For instance, if two ...
    Xiaohua Hu, Xiaodan Zhang, Caimei Lu, E. K. Park, ...
    claim paper
    Read More »
    KDD
    2009
    ACM
    245views Data Mining» more  KDD 2009»
    Mining rich session context to improve web search
    14 years 5 months ago
    Mining rich session context to improve web search
    Download  www.cc.gatech.edu
    User browsing information, particularly their non-search related activity, reveals important contextual information on the preferences and the intent of web users. In this paper, ...
    Guangyu Zhu, Gilad Mishne
    claim paper
    Read More »
    KDD
    2009
    ACM
    232views Data Mining» more  KDD 2009»
    Classification of software behaviors for failure detection: a discriminative pattern mining approach
    14 years 5 months ago
    Classification of software behaviors for failure detection: a discriminative pattern mining approach
    Download  www.cs.uiuc.edu
    Software is a ubiquitous component of our daily life. We often depend on the correct working of software systems. Due to the difficulty and complexity of software systems, bugs an...
    David Lo, Hong Cheng, Jiawei Han, Siau-Cheng Khoo,...
    claim paper
    Read More »
    KDD
    2009
    ACM
    190views Data Mining» more  KDD 2009»
    Efficient influence maximization in social networks
    14 years 5 months ago
    Efficient influence maximization in social networks
    Download  research.microsoft.com
    Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
    Wei Chen, Yajun Wang, Siyu Yang
    claim paper
    Read More »
    KDD
    2009
    ACM
    178views Data Mining» more  KDD 2009»
    Catching the drift: learning broad matches from clickthrough data
    14 years 5 months ago
    Catching the drift: learning broad matches from clickthrough data
    Download  research.microsoft.com
    Identifying similar keywords, known as broad matches, is an important task in online advertising that has become a standard feature on all major keyword advertising platforms. Eff...
    Sonal Gupta, Mikhail Bilenko, Matthew Richardson
    claim paper
    Read More »
    KDD
    2009
    ACM
    322views Data Mining» more  KDD 2009»
    Mining for the most certain predictions from dyadic data
    14 years 5 months ago
    Mining for the most certain predictions from dyadic data
    Download  velblod.videolectures.net
    Meghana Deodhar, Joydeep Ghosh
    claim paper
    Read More »
    KDD
    2009
    ACM
    187views Data Mining» more  KDD 2009»
    New ensemble methods for evolving data streams
    14 years 5 months ago
    New ensemble methods for evolving data streams
    Download  www.lsi.upc.edu
    Advanced analysis of data streams is quickly becoming a key area of data mining research as the number of applications demanding such processing increases. Online mining when such...
    Albert Bifet, Bernhard Pfahringer, Geoffrey Holmes...
    claim paper
    Read More »
    KDD
    2009
    ACM
    190views Data Mining» more  KDD 2009»
    Named entity mining from click-through data using weakly supervised latent dirichlet allocation
    14 years 5 months ago
    Named entity mining from click-through data using weakly supervised latent dirichlet allocation
    Download  research.microsoft.com
    This paper addresses Named Entity Mining (NEM), in which we mine knowledge about named entities such as movies, games, and books from a huge amount of data. NEM is potentially use...
    Gu Xu, Shuang-Hong Yang, Hang Li
    claim paper
    Read More »
    KDD
    2009
    ACM
    206views Data Mining» more  KDD 2009»
    Ranking-based clustering of heterogeneous information networks with star network schema
    14 years 5 months ago
    Ranking-based clustering of heterogeneous information networks with star network schema
    Download  www.cs.uiuc.edu
    A heterogeneous information network is an information network composed of multiple types of objects. Clustering on such a network may lead to better understanding of both hidden s...
    Yizhou Sun, Yintao Yu, Jiawei Han
    claim paper
    Read More »
    « first‹ previous…67891011121314…next ›last »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.