QuickSearch:   Number of matching entries: 0.

Search Settings

    AuthorTitleYearJournal/ProceedingsReftypeDOI/URL
    Data Clustering: Algorithms and Applications 2014   book URL 
    BibTeX:
    @book{DBLP:books/crc/aggarwal2013,,
      title = {Data Clustering: Algorithms and Applications},
      publisher = {CRC Press},
      year = {2014},
      url = {http://www.charuaggarwal.net/clusterbook.pdf}
    }
    
    Radelaar, J., Boor, A.-J., Vandic, D., van Dam, J.-W., Hogenboom, F. & Frasincar, F. Improving the Exploration of Tag Spaces Using Automated Tag Clustering 2011
    Vol. 6757Web Engineering, pp. 274-288 
    incollection URL 
    BibTeX:
    @incollection{radelaar2011improving,
      author = {Radelaar, Joni and Boor, Aart-Jan and Vandic, Damir and van Dam, Jan-Willem and Hogenboom, Frederik and Frasincar, Flavius},
      title = {Improving the Exploration of Tag Spaces Using Automated Tag Clustering},
      booktitle = {Web Engineering},
      publisher = {Springer Berlin / Heidelberg},
      year = {2011},
      volume = {6757},
      pages = {274-288},
      note = {10.1007/978-3-642-22233-7_19},
      url = {http://dx.doi.org/10.1007/978-3-642-22233-7_19}
    }
    
    Ren, F.-X., Cheng, X.-Q. & Shen, H.-W. Modeling the clustering in citation networks 2011   misc URL 
    Abstract: It has been known for a long time that citation networks are always highly clustered, such as the existences of abundant triangles and high clustering coefficient. In a growth model, one typical way to produce clustering is using the trid formation mechanism. However, we find that this mechanism fails to generate enough triangles in a real-world citation network. By analyzing the network, it is found that one paper always cites papers that are already highly connected. We point out that the highly connected papers may refer to similar research topic and one subsequent paper tends to cite all of them. Based on this assumption, we propose a growth model for citation networks in which a new paper i firstly attaches to one relevant paper j and then with a probability links those papers in the same clique to which j belongs. We compare our model to two real-world citation networks - one on a special research area and the other on multidisciplinary sciences. Results show that for the two networks the in-degree distributions are matched and the clustering features, i.e., the number of triangles and the average clustering coefficient, are well reproduced.
    BibTeX:
    @misc{Ren2011,
      author = {Ren, Fu-Xin and Cheng, Xue-Qi and Shen, Hua-Wei},
      title = {Modeling the clustering in citation networks},
      year = {2011},
      note = {cite arxiv:1104.4209},
      url = {http://arxiv.org/abs/1104.4209}
    }
    
    Duennebeil, S., Sunyaev, A., Blohm, I., Leimeister, J.M. & Krcmar, H. Do German physicians want electronic health services? A characterization of potential adopters and rejectors in German ambulatory care 2010 3. International Conference on Health Informatics (HealthInf) 2010  inproceedings URL 
    BibTeX:
    @inproceedings{ls_leimeister,
      author = {Duennebeil, S. and Sunyaev, A. and Blohm, I. and Leimeister, J. M. and Krcmar, H.},
      title = {Do German physicians want electronic health services? A characterization of potential adopters and rejectors in German ambulatory care},
      booktitle = {3. International Conference on Health Informatics (HealthInf) 2010},
      year = {2010},
      note = {163 (11-10)},
      url = {http://www.uni-kassel.de/fb7/ibwl/leimeister/pub/JML_150.pdf}
    }
    
    Tango, T. Statistical Methods for Disease Clustering 2010   book URL 
    Abstract: The development of powerful computing environment and the geographical information system (GIS) in recent decades has thrust the analysis of geo-referenced disease incidence data into the mainstream of spatial epidemiology. This book offers a modern perspective on statistical methods for detecting disease clustering, an indispensable procedure to find a statistical evidence on aetiology of the disease under study.
    With increasing public health concerns about environmental risks, the need for sophisticated methods for analyzing spatial health events is immediate. Furthermore, the research area of statistical methods for disease clustering now attracts a wide audience due to the perceived need to implement wide-ranging monitoring systems to detect possible health-related events such as the occurrence of the severe acute respiratory syndrome (SARS), pandemic influenza and bioterrorism
    BibTeX:
    @book{tango2010statistical,
      author = {Tango, Toshiro},
      title = {Statistical Methods for Disease Clustering},
      publisher = {Springer New York},
      year = {2010},
      edition = {1},
      url = {http://scans.hebis.de/HEBCGI/show.pl?22114256_aub.html}
    }
    
    Bade, K. Personalized Hierarchical Structuring 2009 School: Otto-von-Guericke-Universitat Magdeburg  phdthesis  
    BibTeX:
    @phdthesis{bade2009personalized,
      author = {Bade, Korinna},
      title = {Personalized Hierarchical Structuring},
      school = {Otto-von-Guericke-Universitat Magdeburg},
      year = {2009}
    }
    
    Carpineto, C., Osiński, S., Romano, G. & Weiss, D. A survey of Web clustering engines 2009 ACM Comput. Surv.
    Vol. 41, pp. 17:1-17:38 
    article DOI URL 
    Abstract: Web clustering engines organize search results by topic, thus offering a complementary view to the flat-ranked list returned by conventional search engines. In this survey, we discuss the issues that must be addressed in the development of a Web clustering engine, including acquisition and preprocessing of search results, their clustering and visualization. Search results clustering, the core of the system, has specific requirements that cannot be addressed by classical clustering algorithms. We emphasize the role played by the quality of the cluster labels as opposed to optimizing only the clustering structure. We highlight the main characteristics of a number of existing Web clustering engines and also discuss how to evaluate their retrieval performance. Some directions for future research are finally presented.
    BibTeX:
    @article{Carpineto:2009:SWC:1541880.1541884,
      author = {Carpineto, Claudio and Osiński, Stanislaw and Romano, Giovanni and Weiss, Dawid},
      title = {A survey of Web clustering engines},
      journal = {ACM Comput. Surv.},
      publisher = {ACM},
      year = {2009},
      volume = {41},
      pages = {17:1--17:38},
      url = {http://doi.acm.org/10.1145/1541880.1541884},
      doi = {http://dx.doi.org/10.1145/1541880.1541884}
    }
    
    Lu, C., Chen, X. & Park, E.K. Exploit the tripartite network of social tagging for web clustering 2009 Proceeding of the 18th ACM conference on Information and knowledge management, pp. 1545-1548  inproceedings DOI URL 
    Abstract: In this poster, we investigate how to enhance web clustering by leveraging the tripartite network of social tagging systems. We propose a clustering method, called "Tripartite Clustering", which cluster the three types of nodes (resources, users and tags) simultaneously based on the links in the social tagging network. The proposed method is experimented on a real-world social tagging dataset sampled from del.icio.us. We also compare the proposed clustering approach with K-means. All the clustering results are evaluated against a human-maintained web directory. The experimental results show that Tripartite Clustering significantly outperforms the content-based K-means approach and achieves performance close to that of social annotation-based K-means whereas generating much more useful information.
    BibTeX:
    @inproceedings{Lu:2009:ETN:1645953.1646167,
      author = {Lu, Caimei and Chen, Xin and Park, E. K.},
      title = {Exploit the tripartite network of social tagging for web clustering},
      booktitle = {Proceeding of the 18th ACM conference on Information and knowledge management},
      publisher = {ACM},
      year = {2009},
      pages = {1545--1548},
      url = {http://doi.acm.org/10.1145/1645953.1646167},
      doi = {http://dx.doi.org/10.1145/1645953.1646167}
    }
    
    Nedjah, N. Intelligent text categorization and clustering 2009   electronic URL 
    Abstract: "Automatic Text Categorization and Clustering are becoming more and more important as the amount of text in electronic format grows and the access to it becomes more necessary and widespread. Well known applications are spam filtering and web search, but a large number of everyday uses exists (intelligent web search, data mining, law enforcement, etc.). Currently, researchers are employing many intelligent techniques for text categorization and clustering, ranging from support vector machines and neural networks to Bayesian inference and algebraic methods, such as Latent Semantic Indexing." "This volume offers a wide spectrum of research work developed for intelligent text categorization and clustering."--Jacket.
    BibTeX:
    @electronic{nedjah2009intelligent,
      author = {Nedjah, Nadia},
      title = {Intelligent text categorization and clustering},
      publisher = {Springer},
      year = {2009},
      url = {http://rave.ohiolink.edu/ebooks/ebc/9783540856443}
    }
    
    Leicht, E.A. & Newman, M.E.J. Community Structure in Directed Networks 2008 Phys. Rev. Lett.
    Vol. 100(11), pp. 118703 
    article DOI  
    BibTeX:
    @article{Leicht08community,
      author = {Leicht, E. A. and Newman, M. E. J.},
      title = {Community Structure in Directed Networks},
      journal = {Phys. Rev. Lett.},
      publisher = {American Physical Society},
      year = {2008},
      volume = {100},
      number = {11},
      pages = {118703},
      doi = {http://dx.doi.org/10.1103/PhysRevLett.100.118703}
    }
    
    Brandes, U., Delling, D., Gaertler, M., Görke, R., Hoefer, M., Nikoloski, Z. & Wagner, D. On Finding Graph Clusterings with Maximum Modularity 2007
    Vol. 4769Graph-Theoretic Concepts in Computer Science, pp. 121-132 
    incollection DOI URL 
    Abstract: Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the complex systems literature, although its properties are not well understood. We study the problem of finding clusterings with maximum modularity, thus providing theoretical foundations for past and present work based on this measure. More precisely, we prove the conjectured hardness of maximizing modularity both in the general case and with the restriction to cuts, and give an Integer Linear Programming formulation. This is complemented by first insights into the behavior and performance of the commonly applied greedy agglomaration approach.
    BibTeX:
    @incollection{springerlink:10.1007/978-3-540-74839-7_12,
      author = {Brandes, Ulrik and Delling, Daniel and Gaertler, Marco and Görke, Robert and Hoefer, Martin and Nikoloski, Zoran and Wagner, Dorothea},
      title = {On Finding Graph Clusterings with Maximum Modularity},
      booktitle = {Graph-Theoretic Concepts in Computer Science},
      publisher = {Springer},
      year = {2007},
      volume = {4769},
      pages = {121-132},
      url = {http://dx.doi.org/10.1007/978-3-540-74839-7_12},
      doi = {http://dx.doi.org/10.1007/978-3-540-74839-7_12}
    }
    
    Grahl, M., Hotho, A. & Stumme, G. Conceptual Clustering of Social Bookmark Sites 2007 Workshop Proceedings of Lernen -- Wissensentdeckung -- Adaptivität (LWA 2007), pp. 50-54  inproceedings URL 
    BibTeX:
    @inproceedings{grahl07conceptualKdml,
      author = {Grahl, Miranda and Hotho, Andreas and Stumme, Gerd},
      title = {Conceptual Clustering of Social Bookmark Sites},
      booktitle = {Workshop Proceedings of Lernen -- Wissensentdeckung -- Adaptivität (LWA 2007)},
      publisher = {Martin-Luther-Universität Halle-Wittenberg},
      year = {2007},
      pages = {50-54},
      url = {http://www.kde.cs.uni-kassel.de/hotho/pub/2007/kdml_recommender_final.pdf}
    }
    
    Newman, M.E.J. Modularity and community structure in networks 2006 Proceedings of the National Academy of Sciences
    Vol. 103(23), pp. 8577-8582 
    article DOI  
    Abstract: Many networks of interest in the sciences, including social networks, computer networks, and metabolic and regulatory networks, are found to divide naturally into communities or modules. The problem of detecting and characterizing this community structure is one of the outstanding issues in the study of networked systems. One highly effective approach is the optimization of the quality function known as “modularity” over the possible divisions of a network. Here I show that the modularity can be expressed in terms of the eigenvectors of a characteristic matrix for the network, which I call the modularity matrix, and that this expression leads to a spectral algorithm for community detection that returns results of demonstrably higher quality than competing methods in shorter running times. I illustrate the method with applications to several published network data sets.
    BibTeX:
    @article{newman2006modularity,
      author = {Newman, M. E. J.},
      title = {Modularity and community structure in networks},
      journal = {Proceedings of the National Academy of Sciences},
      year = {2006},
      volume = {103},
      number = {23},
      pages = {8577--8582},
      doi = {http://dx.doi.org/10.1073/pnas.0601602103}
    }
    
    Schmitz, C., Hotho, A., Jäschke, R. & Stumme, G. Content Aggregation on Knowledge Bases using Graph Clustering 2006
    Vol. 4011The Semantic Web: Research and Applications, pp. 530-544 
    inproceedings URL 
    Abstract: Recently, research projects such as PADLR and SWAP
    have developed tools like Edutella or Bibster, which are targeted at
    establishing peer-to-peer knowledge management (P2PKM) systems. In
    such a system, it is necessary to obtain provide brief semantic
    descriptions of peers, so that routing algorithms or matchmaking
    processes can make decisions about which communities peers should
    belong to, or to which peers a given query should be forwarded.
    This paper provides a graph clustering technique on
    knowledge bases for that purpose. Using this clustering, we can show
    that our strategy requires up to 58% fewer queries than the
    baselines to yield full recall in a bibliographic P2PKM scenario.
    BibTeX:
    @inproceedings{schmitz2006content,
      author = {Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd},
      title = {Content Aggregation on Knowledge Bases using Graph Clustering},
      booktitle = {The Semantic Web: Research and Applications},
      publisher = {Springer},
      year = {2006},
      volume = {4011},
      pages = {530-544},
      url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/schmitz2006content.pdf}
    }
    
    Dhillon, I.S., Modha, D.S. & Spangler, W.S. Class visualization of high-dimensional data with applications 2002 Computational Statistics & Data Analysis
    Vol. 41(1), pp. 59-90 
    article URL 
    Abstract: No abstract is available for this item.
    BibTeX:
    @article{RePEc:eee:csdana:v:41:y:2002:i:1:p:59-90,
      author = {Dhillon, Inderjit S. and Modha, Dharmendra S. and Spangler, W. Scott},
      title = {Class visualization of high-dimensional data with applications},
      journal = {Computational Statistics & Data Analysis},
      year = {2002},
      volume = {41},
      number = {1},
      pages = {59-90},
      url = {http://www.cs.utexas.edu/~inderjit/public_papers/csda.pdf}
    }
    
    Stumme, G., Taouil, R., Bastide, Y. & Lakhal, L. Conceptual Clustering with Iceberg Concept Lattices 2001 Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01)  inproceedings URL 
    BibTeX:
    @inproceedings{stumme01conceptualclustering,
      author = {Stumme, G. and Taouil, R. and Bastide, Y. and Lakhal, L.},
      title = {Conceptual Clustering with Iceberg Concept Lattices},
      booktitle = {Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01)},
      year = {2001},
      url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2001/FGML01.pdf}
    }
    
    Toivonen, J., Visa, A., Vesanen, T., Back, B. & Vanharanta, H. Validation of Text Clustering Based on Document Contents. 2001
    Vol. 2123MLDM, pp. 184-195 
    inproceedings URL 
    BibTeX:
    @inproceedings{conf/mldm/ToivonenVVBV01,
      author = {Toivonen, Jarmo and Visa, Ari and Vesanen, Tomi and Back, Barbro and Vanharanta, Hannu},
      title = {Validation of Text Clustering Based on Document Contents.},
      booktitle = {MLDM},
      publisher = {Springer},
      year = {2001},
      volume = {2123},
      pages = {184-195},
      url = {http://dblp.uni-trier.de/db/conf/mldm/mldm2001.html#ToivonenVVBV01}
    }
    
    Jain, A.K., Murty, M.N. & Flynn, P.J. Data Clustering: A Review 1999 ACM Comput. Surv.
    Vol. 31(3), pp. 264-323 
    article DOI URL 
    Abstract: Clustering is the unsupervised classification of patterns (observations, data items, or feature vectors) into groups (clusters). The clustering problem has been addressed in many contexts and by researchers in many disciplines; this reflects its broad appeal and usefulness as one of the steps in exploratory data analysis. However, clustering is a difficult problem combinatorially, and differences in assumptions and contexts in different communities has made the transfer of useful generic concepts and methodologies slow to occur. This paper presents an overviewof pattern clustering methods from a statistical pattern recognition perspective, with a goal of providing useful advice and references to fundamental concepts accessible to the broad community of clustering practitioners. We present a taxonomy of clustering techniques, and identify cross-cutting themes and recent advances. We also describe some important applications of clustering algorithms such as image segmentation, object recognition, and information retrieval.
    BibTeX:
    @article{Jain:1999:DCR:331499.331504,
      author = {Jain, A. K. and Murty, M. N. and Flynn, P. J.},
      title = {Data Clustering: A Review},
      journal = {ACM Comput. Surv.},
      publisher = {ACM},
      year = {1999},
      volume = {31},
      number = {3},
      pages = {264--323},
      url = {http://doi.acm.org/10.1145/331499.331504},
      doi = {http://dx.doi.org/10.1145/331499.331504}
    }
    
    Jain, A.K., Murty, M.N. & Flynn, P.J. Data clustering: a review 1999 ACM Comput. Surv.
    Vol. 31(3), pp. 264-323 
    article DOI URL 
    BibTeX:
    @article{Jain:1999:DCR:331499.331504,
      author = {Jain, A. K. and Murty, M. N. and Flynn, P. J.},
      title = {Data clustering: a review},
      journal = {ACM Comput. Surv.},
      publisher = {ACM},
      year = {1999},
      volume = {31},
      number = {3},
      pages = {264--323},
      url = {http://doi.acm.org/10.1145/331499.331504},
      doi = {http://dx.doi.org/10.1145/331499.331504}
    }
    
    Zhang, T., Ramakrishnan, R. & Livny, M. BIRCH: An Efficient Data Clustering Method for Very Large Databases 1996 Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, pp. 103-114  inproceedings DOI URL 
    BibTeX:
    @inproceedings{zhang1996birch,
      author = {Zhang, Tian and Ramakrishnan, Raghu and Livny, Miron},
      title = {BIRCH: An Efficient Data Clustering Method for Very Large Databases},
      booktitle = {Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data},
      publisher = {ACM},
      year = {1996},
      pages = {103--114},
      url = {http://doi.acm.org/10.1145/233269.233324},
      doi = {http://dx.doi.org/10.1145/233269.233324}
    }
    

    Created by JabRef on 23/10/2019.