Special Issue "Selected Papers from Text Mining Workshop at the 2012 SIAM International Conference on Data Mining"
A special issue of Algorithms (ISSN 1999-4893).
Deadline for manuscript submissions: closed (30 June 2012)
Prof. Dr. Michael W. Berry
Department of Electrical Engineering and Computer Science, The University of Tennessee, Min H. Kao Building, Suite 401, 1520 Middle Drive, Knoxville, TN 37996, USA
Phone: +1 865 974 3838
Fax: +1 865 974 4404
Interests: information retrieval, data and text mining, computational science, bioinformatics, and parallel computing
Dr. Jacob Kogan
Department of Mathematics and Statistics, University of Maryland Baltimore County, 1000 Hilltop Circle, Baltimore, Maryland 21250, USA
Phone: +1 410 455 3297
Fax: +1 410 455 1066
Interests: optimal control theory; finite dimensional optimization; robust stability of control systems; computational information retrieval
The proliferation of digital computing devices and their use in communication continues to result in an increased demand for systems and algorithms capable of mining textual data. Thus, the development of techniques for mining unstructured, semi-structured, and fully structured textual data has become quite important in both academia and industry. As a result, a one-day workshop on text mining was held on April 28, 2012 in conjunction with the SIAM Twelfth International Conference on Data Mining to bring together researchers from a variety of disciplines to present their current approaches and results in text mining. The workshop surveyed the emerging field of text mining-the application of techniques of machine learning in conjunction with natural language processing, information extraction and algebraic/mathematical approaches to computational information retrieval. Many issues are being addressed in this field ranging from the development of new document classification and clustering models to novel approaches for topic detection, tracking, and visualization.
Prof. Dr. Michael W. Berry
Dr. Jacob Kogan
Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. Papers will be published continuously (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.
Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are refereed through a peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed Open Access quarterly journal published by MDPI.
Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 300 CHF (Swiss Francs). English correction and/or formatting fees of 250 CHF (Swiss Francs) will be charged in certain cases for those articles accepted for publication that require extensive additional formatting and/or English corrections.
- document ranking and representation
- document classification and clustering
- text summarization and anomaly detection
Algorithms 2012, 5(3), 364-378; doi:10.3390/a5030364
Received: 29 June 2012; in revised form: 13 August 2012 / Accepted: 15 August 2012 / Published: 24 August 2012| Download PDF Full-text (224 KB) | Download XML Full-text
Article: Monitoring Threshold Functions over Distributed Data Streams with Node Dependent Constraints
Algorithms 2012, 5(3), 379-397; doi:10.3390/a5030379
Received: 19 June 2012; in revised form: 8 September 2012 / Accepted: 11 September 2012 / Published: 18 September 2012| Download PDF Full-text (683 KB) | Download XML Full-text
Algorithms 2012, 5(4), 398-420; doi:10.3390/a5040398
Received: 2 July 2012; in revised form: 5 September 2012 / Accepted: 7 September 2012 / Published: 26 September 2012| Download PDF Full-text (401 KB) | Download XML Full-text
Algorithms 2012, 5(4), 469-489; doi:10.3390/a5040469
Received: 20 June 2012; in revised form: 10 October 2012 / Accepted: 11 October 2012 / Published: 19 October 2012| Download PDF Full-text (3733 KB) | Download XML Full-text
Algorithms 2012, 5(4), 490-505; doi:10.3390/a5040490
Received: 1 July 2012; in revised form: 16 August 2012 / Accepted: 9 October 2012 / Published: 22 October 2012| Download PDF Full-text (1308 KB)
Algorithms 2012, 5(4), 506-520; doi:10.3390/a5040506
Received: 2 July 2012; in revised form: 24 September 2012 / Accepted: 17 October 2012 / Published: 23 October 2012| Download PDF Full-text (1199 KB)
Last update: 16 May 2012