<reponame>UMBC-DREAM-Lab/UMBC-DREAM-Lab.github.io<gh_stars>1-10
---
---
@inproceedings{eren2021DocEng21,
 abstract = {The unprecedented outbreak of Severe Acute Respiratory Syndrome Coronavirus-2 (SARS-CoV-2), or COVID-19, continues to be a significant worldwide problem. As a result, a surge of new COVID-19 related research has followed suit. The growing number of publications requires document organization methods to identify relevant information. In this paper, we expand upon our previous work with clustering the CORD-19 dataset by applying multi-dimensional analysis methods. Tensor factorization is a powerful unsupervised learning method capable of discovering hidden patterns in a document corpus. We show that a higher-order representation of the corpus allows for the simultaneous grouping of similar articles, relevant journals, authors with similar research interests, and topic keywords. These groupings are identified within and among the latent components extracted via tensor decomposition. We further demonstrate the application of this method with a publicly available interactive visualization of the dataset.},
author = {Eren, <NAME> and Solovyev, Nick and Hamer, Chris and McDonald, Renee and Alexandrov, Boian and <NAME>},
booktitle = {Proceedings of the ACM Symposium on Document Engineering 2021},
doi = {10.1145/3469096.3474927},
pages = {1--4},
title = {COVID-19 Multidimensional Kaggle Literature Organization},
pdf = {https://arxiv.org/pdf/2107.08190.pdf},
url = {https://doi.org/10.1145/3469096.3474927},
year = {2021}
}

@article{eren2021RFoT,
      title={Random Forest of Tensors (RFoT)}, 
      author={Eren, <NAME> and Nicholas, Charles and McDonald, Renee and Hamer, Chris},
      abstract={Machine learning has become an invaluable tool in the fight against malware. Traditional supervised and unsupervised methods are not designed to capture the multi-dimensional details that are often present in cyber data. In contrast, tensor factorization is a powerful unsupervised data analysis method for extracting the latent patterns that are hidden in a multi-dimensional corpus. In this poster we explore the application of tensors to classification, and we describe a hybrid model that leverages the strength of multi-dimensional analysis combined with clustering. We introduce a novel semi-supervised ensemble classifier named Random Forest of Tensors (RFoT) that is based on generating a forest of tensors in parallel, which share the same first dimension, and randomly selecting the remainder of the dimensions and entries of each tensor from the features set.},
      year={2021},
      note={Presented at the 12th Annual Malware Technical Exchange Meeting, Online, 2021},
      url = {https://www.maksimeren.com/publication/eren_rfot_mtem2021/},
      pdf= {https://www.maksimeren.com/poster/Random_Forest_of_Tensors_RFoT_MTEM.pdf},
      journal={Presented at the 12th Annual Malware Technical Exchange Meeting, Online.}
}

@article{boutsikas2021evading,
  title={Evading Malware Classifiers via Monte Carlo Mutant Feature Discovery},
  author={<NAME> Eren, <NAME> Varga, <NAME> Raff, <NAME> Matuszek, Cynthia and <NAME>},
  abstract = {The use of Machine Learning has become a significant part of malware detection efforts due to the influx of new malware, an ever changing threat landscape, and the ability of Machine Learning methods to discover meaningful distinctions between malicious and benign software. Antivirus vendors have also begun to widely utilize malware classifiers based on dynamic and static malware analysis features. Therefore, a malware author might make evasive binary modifications against Machine Learning models as part of the malware development life cycle to execute an attack successfully. This makes the studying of possible classifier evasion strategies an essential part of cyber defense against malice. To this extent, we stage a grey box setup to analyze a scenario where the malware author does not know the target classifier algorithm, and does not have access to decisions made by the classifier, but knows the features used in training. In this experiment, a malicious actor trains a surrogate model using the EMBER-2018 dataset to discover binary mutations that cause an instance to be misclassified via a Monte Carlo tree search. Then, mutated malware is sent to the victim model that takes the place of an antivirus API to test whether it can evade detection.},
  url = {https://arxiv.org/abs/2106.07860},
  pdf={https://arxiv.org/pdf/2106.07860.pdf},
  journal={Presented at the 12th Annual Malware Technical Exchange Meeting, Online.},
  year={2021}
}
@string{aps = {American Physical Society,}}

@article{raff_ngram_2016,
abstract = {Malware classification using machine learning algorithms is a difficult task, in part due to the absence of strong natural features in raw executable binary files. Byte n-grams previously have been used as features, but little work has been done to explain their performance or to understand what concepts are actually being learned. In contrast to other work using n-gram features, in this work we use orders of magnitude more data, and we perform feature selection during model building using Elastic-Net regularized Logistic Regression. We compute a regularization path and analyze novel {\{}$\backslash$em multi-byte identifiers{\}}. Through this process, we discover significant previously unreported issues with byte n-gram features that cause their benefits and practicality to be overestimated. Three primary issues emerged from our work. First, we discovered a flaw in how previous corpora were created that leads to an over-estimation of classification accuracy. Second, we discovered that most of the information contained in n-grams stem from string features that could be obtained in simpler ways. Finally, we demonstrate that n-gram features promote overfitting, even with linear models and extreme regularization.},
author = {<NAME>, <NAME> Sylvester, <NAME> <NAME>, <NAME> <NAME>},
doi = {10.1007/s11416-016-0283-1},
issn = {2263-8733},
journal = {Journal of Computer Virology and Hacking Techniques},
keywords = {byte n-grams,elastic-net,malware classification,multi-byte identifier},
month = {sep},
title = {{An investigation of byte n-gram features for malware classification}},
url = {http://link.springer.com/10.1007/s11416-016-0283-1},
pdf={https://www.edwardraff.com/publications/investigation_byte_ngrams.pdf},
year = {2016}
}
@inproceedings{raff2017peheader,
abstract = {Many efforts have been made to use various forms of domain knowledge in malware detection. Currently there exist two common approaches to malware detection without domain knowledge, namely byte n-grams and strings. In this work we explore the feasibility of applying neural networks to malware detection and feature learning. We do this by restricting ourselves to a minimal amount of domain knowledge in order to extract a portion of the Portable Executable (PE) header. By doing this we show that neural networks can learn from raw bytes without explicit feature construction, and perform even better than a domain knowledge approach that parses the PE header into explicit features.},
address = {New York, NY, USA},
author = {<NAME> and <NAME> and <NAME>},
booktitle = {Proceedings of the 10th ACM Workshop on Artificial Intelligence and Security},
doi = {10.1145/3128572.3140442},
isbn = {978-1-4503-5202-4},
keywords = {cyber security,deep learning,malware detection},
pages = {121--132},
publisher = {ACM},
series = {AISec '17},
title = {{Learning the PE Header, Malware Detection with Minimal Domain Knowledge}},
url = {http://doi.acm.org/10.1145/3128572.3140442},
pdf={https://arxiv.org/pdf/1709.01471},
year = {2017}
}
@inproceedings{Zak2017,
abstract = {Recent work has shown that byte n-grams learn mostly low entropy features, such as function imports and strings, which has brought into question whether byte n-grams can learn information corresponding to higher entropy levels, such as binary code. We investigate that hypothesis in this work by performing byte n-gram analysis on only specific sub-sections of the binary file, and compare to results ob- tained by n-gram analysis on assembly code generated from disassembled binaries. We do this by leveraging the change in model performance and ensembles to glean insights about the data. In doing so we discover that byte n-grams can learn from the code regions, but do not necessarily learn any new information. We also discover that assembly n-grams may not be as effective as previously thought and that disam- biguating instructions by their binary opcode, an approach not previously used for malware detection, is critical for model generalization.},
author = {<NAME> and <NAME> and <NAME>},
booktitle = {2017 12th International Conference on Malicious and Unwanted Software (MALWARE)},
doi = {10.1109/MALWARE.2017.8323963},
isbn = {978-1-5386-1436-5},
month = {oct},
pages = {109--118},
publisher = {IEEE},
title = {{What can N-grams learn for malware detection?}},
url = {http://ieeexplore.ieee.org/document/8323963/},
pdf={https://www.edwardraff.com/publications/what_can_ngrams_learn.pdf},
year = {2017}
}
@inproceedings{raff_lzjd_2017,
abstract = {The Normalized Compression Distance (NCD) has been used in a number of domains to compare objects with varying feature types. This flexibility comes from the use of general purpose compression algorithms as the means of computing distances between byte sequences. Such flexibility makes NCD particularly attractive for cases where the right features to use are not obvious, such as malware classification. However, NCD can be computationally demanding, thereby restricting the scale at which it can be applied. We introduce an alternative metric also inspired by compression, the Lempel-Ziv Jaccard Distance (LZJD). We show that this new distance has desirable theoretical properties, as well as comparable or superior performance for malware classification, while being easy to implement and orders of magnitude faster in practice.},
address = {New York, New York, USA},
author = {<NAME> and <NAME>},
booktitle = {Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD '17},
doi = {10.1145/3097983.3098111},
isbn = {9781450348874},
pages = {1007--1015},
publisher = {ACM Press},
title = {{An Alternative to NCD for Large Sequences, Lempel-Ziv Jaccard Distance}},
url = {http://dl.acm.org/citation.cfm?doid=3097983.3098111},
pdf={https://www.edwardraff.com/publications/alternative-ncd-lzjd.pdf},
year = {2017},
selected={true}
}
@article{JMLR:v18:16-131,
abstract = {Java Statistical Analysis Tool (JSAT) is a Machine Learning library written in pure Java. It works to fill a void in the Java ecosystem for a general purpose library that is relatively high performance and flexible, which is not adequately fulfilled by Weka (Hall et al., 2009) and Java-ML (Abeel et al., 2009). Almost all of the algorithms are independently implemented using an Object- Oriented framework. JSAT is made available under the GNU GPL license here: github.com/EdwardRaff/JSAT.},
author = {<NAME>},
journal = {Journal of Machine Learning Research},
number = {23},
pages = {1--5},
title = {{JSAT: Java Statistical Analysis Tool, a Library for Machine Learning}},
url = {http://jmlr.org/papers/v18/16-131.html},
pdf = {http://www.jmlr.org/papers/volume18/16-131/16-131.pdf},
html = {http://jmlr.org/papers/v18/16-131.html},
volume = {18},
year = {2017}
}
@inproceedings{raff_shwel,
abstract = {There are currently few methods that can be applied to malware classification problems which don't require domain knowledge to apply. In this work, we develop our new SHWeL feature vector representation, by extending the recently proposed Lempel-Ziv Jaccard Distance. These SHWeL vectors improve upon LZJD's accuracy, outperform byte n-grams, and allow us to build efficient algorithms for both training (a weakness of byte n-grams) and inference (a weakness of LZJD). Furthermore, our new SHWeL method also allows us to directly tackle the class imbalance problem, which is common for malware-related tasks. Compared to existing methods like SMOTE, SHWeL provides significantly improved accuracy while reducing algorithmic complexity to O(N). Because our approach is developed without the use of domain knowledge, it can be easily re-applied to any new domain where there is a need to classify byte sequences.},
address = {New York, NY, USA},
author = {<NAME> and <NAME>},
booktitle = {Proceedings of the 10th ACM Workshop on Artificial Intelligence and Security},
doi = {10.1145/3128572.3140446},
isbn = {978-1-4503-5202-4},
keywords = {cyber security,lzjd,malware classification,shwel},
pages = {111--120},
publisher = {ACM},
series = {AISec '17},
title = {{Malware Classification and Class Imbalance via Stochastic Hashed LZJD}},
url = {http://doi.acm.org/10.1145/3128572.3140446},
pdf={https://www.edwardraff.com/publications/raff_shwel.pdf},
year = {2017}
}
@inproceedings{MalConv,
abstract = {In this work we introduce malware detection from raw byte sequences as a fruitful research area to the larger machine learning community. Building a neural network for such a problem presents a number of interesting challenges that have not occurred in tasks such as image processing or NLP. In particular, we note that detection from raw bytes presents a sequence problem with over two million time steps and a problem where batch normalization appear to hinder the learning process. We present our initial work in building a solution to tackle this problem, which has linear complexity dependence on the sequence length, and allows for interpretable sub-regions of the binary to be identified. In doing so we will discuss the many challenges in building a neural network to process data at this scale, and the methods we used to work around them.},
archivePrefix = {arXiv},
arxivId = {1710.09435},
author = {<NAME> and <NAME> Sylvester, Jared and <NAME> <NAME> and <NAME>},
booktitle = {AAAI Workshop on Artificial Intelligence for Cyber Security},
eprint = {1710.09435},
month = {oct},
title = {{Malware Detection by Eating a Whole EXE}},
url = {http://arxiv.org/abs/1710.09435},
pdf = {http://arxiv.org/pdf/1710.09435},
year = {2018},
selected={true}
}
@inproceedings{Fleshman2018,
abstract = {As machine-learning (ML) based systems for malware detection become more prevalent, it becomes necessary to quantify the benefits compared to the more traditional anti-virus (AV) systems widely used today. It is not practical to build an agreed upon test set to benchmark malware detection systems on pure classification performance. Instead we tackle the problem by creating a new testing methodology, where we evaluate the change in performance on a set of known benign {\&} malicious files as adversarial modifications are performed. The change in performance combined with the evasion techniques then quantifies a system's robustness against that approach. Through these experiments we are able to show in a quantifiable way how purely ML based systems can be more robust than AV products at detecting malware that attempts evasion through modification, but may be slower to adapt in the face of significantly novel attacks.},
archivePrefix = {arXiv},
arxivId = {1806.04773},
author = {<NAME> <NAME> <NAME> McLean, <NAME> <NAME>},
booktitle = {2018 13th International Conference on Malicious and Unwanted Software (MALWARE)},
doi = {10.1109/MALWARE.2018.8659360},
eprint = {1806.04773},
isbn = {978-1-7281-0155-2},
month = {oct},
pages = {1--10},
publisher = {IEEE},
title = {{Static Malware Detection {\&} Subterfuge: Quantifying the Robustness of Machine Learning and Current Anti-Virus}},
url = {https://ieeexplore.ieee.org/document/8659360/},
pdf={http://arxiv.org/pdf/1806.04773},
year = {2018}
}
@inproceedings{scws_18,
address = {New York, NY, USA},
author = {<NAME> and <NAME> and <NAME>},
booktitle = {Proceedings of the 27th ACM International Conference on Information and Knowledge Management},
doi = {10.1145/3269206.3271690},
isbn = {978-1-4503-6014-2},
keywords = {consistent weighted sampling,jaccard similarity,min-hashing},
pages = {1203--1212},
publisher = {ACM},
series = {CIKM '18},
title = {{Engineering a Simplified 0-Bit Consistent Weighted Sampling}},
url = {http://doi.acm.org/10.1145/3269206.3271690},
pdf={http://arxiv.org/pdf/1804.00069},
year = {2018}
}
@inproceedings{NEURIPS2019_c429429b,
 author = {<NAME>},
 abstract = {What makes a paper independently reproducible? Debates on reproducibility center around intuition or assumptions but lack empirical results. Our field focuses on releasing code, which is important, but is not sufficient for determining reproducibility. We take the first step toward a quantifiable answer by manually attempting to implement 255 papers published from 1984 until 2017, recording features of each paper, and performing statistical analysis of the results. For each paper, we did not look at the authors code, if released, in order to prevent bias toward discrepancies between code and paper.},
 booktitle = {Advances in Neural Information Processing Systems},
 pages = {},
 publisher = {Curran Associates, Inc.},
 title = {A Step Toward Quantifying Independently Reproducible Machine Learning Research},
 url = {https://proceedings.neurips.cc/paper/2019/file/c429429bf1f2af051f2021dc92a8ebea-Paper.pdf},
 pdf = {https://proceedings.neurips.cc/paper/2019/file/c429429bf1f2af051f2021dc92a8ebea-Paper.pdf},
 volume = {32},
 year = {2019}
}


@inproceedings{grad_dsaa,
author = {<NAME> and <NAME>},
booktitle = {The 5th IEEE International Conference on Data Science and Advanced Analytics (DSAA)},
title = {{Gradient Reversal Against Discrimination : A Fair Neural Network Learning Approach}},
year = {2018},
pdf={https://www.edwardraff.com/publications/grad_dsaa.pdf},
}

@article{raff_lzjd_digest,
abstract = {Recent work has proposed the Lempel-Ziv Jaccard Distance (LZJD) as a method to measure the similarity between binary byte sequences for malware classification. We propose and test LZJD's effectiveness as a similarity digest hash for digital forensics. To do so we develop a high performance Java implementation with the same command-line arguments as sdhash, making it easy to integrate into existing work-flows. Our testing shows that LZJD is effective for this task, and significantly outperforms sdhash and ssdeep in its ability to match related file fragments and is faster at comparison time.},
archivePrefix = {arXiv},
arxivId = {1708.03346},
author = {<NAME> Nicholas, <NAME>.},
doi = {10.1016/j.diin.2017.12.004},
eprint = {1708.03346},
issn = {17422876},
journal = {Digital Investigation},
month = {feb},
title = {{Lempel-Ziv Jaccard Distance, an effective alternative to ssdeep and sdhash}},
url = {https://doi.org/10.1016/j.diin.2017.12.004},
pdf={https://arxiv.org/pdf/1708.03346},
year = {2018}
}
@inproceedings{hashgram_2018,
abstract = {N-grams have long been used as features for classification problems, and their distribution often allows selection of the top-k occurring n-grams as a reliable first-pass to feature selection. However, this top-k selection can be a performance bottleneck, especially when dealing with massive item sets and corpora. In this work we introduce Hash-Grams, an approach to perform top-k feature mining for classification problems. We show that the Hash-Gram approach can be up to three orders of magnitude faster than exact top-k selection algorithms. Using a malware corpus of over 2 TB in size, we show how Hash-Grams retain comparable classification accuracy, while dramatically reducing computational requirements.},
address = {Halifax, NS, Canada},
author = {<NAME> and <NAME>},
booktitle = {Proceedings of the ACM Symposium on Document Engineering 2018},
doi = {10.1145/3209280.3229085},
publisher = {ACM},
title = {{Hash-Grams: Faster N-Gram Features for Classification and Malware Detection}},
url = {http://doi.acm.org/10.1145/3209280.3229085},
pdf = {https://www.edwardraff.com/publications/Hash_Grams_On_Many_Cores_and_Skewed_Distributions.pdf},
year = {2018}
}
@inproceedings{pylzjd-proc-scipy-2019,
author = {<NAME> and <NAME> and <NAME>},
booktitle = {Proceedings of the 18th Python in Science Conference},
doi = {10.25080/Majora-7ddc1dd1-00e},
editor = {Calloway, Chris and Lippa, David and Niederhut, Dillon and Shupe, David},
pages = {97--102},
title = {{PyLZJD: An Easy to Use Tool for Machine Learning}},
url = {http://conference.scipy.org/proceedings/scipy2019/pylzjd.html},
html = {http://conference.scipy.org/proceedings/scipy2019/pylzjd.html},
pdf = {http://conference.scipy.org/proceedings/scipy2019/pdfs/pylzjd.pdf},
year = {2019}
}
@inproceedings{Kilograms_2019,
abstract = {N-grams have been a common tool for information retrieval and machine learning applications for decades. In nearly all previous works, only a few values ofn are tested, with n {\textgreater} 6 being exceed- ingly rare. Larger values ofn are not tested due to computational burden or the fear of overfitting. In this work, we present a method to find the top-k most frequent n-grams that is 60× faster for small n, and can tackle large n ≥ 1024. Despite the unprecedented size ofn considered, we show how these features still have predictive ability for malware classification tasks. More important, large n- grams provide benefits in producing features that are interpretable by malware analysis, and can be used to create general purpose signatures compatible with industry standard tools like Yara. Fur- thermore, the counts of common n-grams in a file may be added as features to publicly available human-engineered features that rival efficacy of professionally-developed features when used to train gradient-boosted decision tree models on the EMBER dataset.},
author = {<NAME> <NAME> <NAME> Finlayson, <NAME> <NAME>. and <NAME>},
booktitle = {Proceedings of KDD 2019 Workshop on Learning and Mining for Cybersecurity (LEMINCS'19)},
title = {{KiloGrams: Very Large N-Grams for Malware Classification}},
url = {https://arxiv.org/abs/1908.00200},
pdf = {https://arxiv.org/pdf/1908.00200},
year = {2019}
}
@inproceedings{Raff2019d,
abstract = {Defenses against adversarial examples, when using the ImageNet dataset, are historically easy to defeat. The common understanding is that a combination of simple image transformations and other various defenses are insufficient to provide the necessary protection when the obfuscated gradient is taken into account. In this paper, we explore the idea of stochastically combining a large number of individually weak defenses into a single barrage of randomized transformations to build a strong defense against adversarial attacks. We show that, even after accounting for obfuscated gradients, the Barrage of Random Transforms (BaRT) is a resilient defense against even the most difficult attacks, such as PGD. BaRT achieves up to a 24x improvement in accuracy compared to previous work, and has even extended effectiveness out to a previously untested maximum adversarial perturbation of ϵ=32.},
author = {<NAME>. and <NAME>. and <NAME>. and <NAME>.},
booktitle = {Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition},
doi = {10.1109/CVPR.2019.00669},
isbn = {9781728132938},
issn = {10636919},
keywords = {Big Data,Categorization,Deep Learning,Large Scale Methods,Recognition: Detection,Retrieval},
title = {{Barrage of random transforms for adversarially robust defense}},
pdf={https://openaccess.thecvf.com/content_CVPR_2019/papers/Raff_Barrage_of_Random_Transforms_for_Adversarially_Robust_Defense_CVPR_2019_paper.pdf},
volume = {2019-June},
year = {2019}
}
@article{Fleshman2018a,
abstract = {Adversarial attacks against Neural Networks are a problem of considerable importance, for which effective defenses are not yet readily available. We make progress toward this problem by showing that non-negative weight constraints can be used to improve resistance in specific scenarios. In particular, we show that they can provide an effective defense for binary classification problems with asymmetric cost, such as malware or spam detection. We also show how non-negativity can be leveraged to reduce an attacker's ability to perform targeted misclassification attacks in other domains such as image processing.},
archivePrefix = {arXiv},
arxivId = {1806.06108},
author = {<NAME> <NAME> <NAME> <NAME> <NAME>},
eprint = {1806.06108},
journal = {AAAI-2019 Workshop on Artificial Intelligence for Cyber Security},
title = {{Non-Negative Networks Against Adversarial Attacks}},
url = {http://arxiv.org/abs/1806.06108},
pdf = {http://arxiv.org/pdf/1806.06108},
year = {2019}
}
@inproceedings{Nguyen2019_filename_malicious,
author = {<NAME> <NAME> <NAME>},
booktitle = {2019 IEEE International Conference on Big Data (Big Data)},
doi = {10.1109/BigData47090.2019.9006132},
isbn = {978-1-7281-0858-2},
month = {dec},
pages = {1322--1331},
publisher = {IEEE},
title = {{Would a File by Any Other Name Seem as Malicious?}},
url = {https://ieeexplore.ieee.org/document/9006132/},
pdf={https://arxiv.org/pdf/1910.04753.pdf},
year = {2019}
}
@inproceedings{Zhang2020a,
abstract = {Artificial intelligence (AI)-based decision-making systems are employed nowadays in an ever growing number of online as well as offline services–some of great importance. Depending on sophisticated learning algorithms and available data, these systems are increasingly becoming automated and data-driven. However, these systems can impact individuals and communities with ethical or legal consequences. Numerous approaches have therefore been proposed to develop decision making systems that are discrimination-conscious by-design. However, these methods assume the underlying data distribution is stationary without drift, which is counterfactual in many real world applications. In addition, their focus has been largely on minimizing discrimination while maximizing prediction performance without necessary flexibility in customizing the tradeoff according to different applications. To this end, we propose a learning algorithm for fair classification that also adapts to evolving data streams and further allows for a flexible control on the degree of accuracy and fairness. The positive results on a set of discriminated and non-stationary data streams demonstrate the effectiveness and flexibility of this approach.},
author = {<NAME> <NAME> and <NAME> and <NAME> and <NAME> and <NAME> and <NAME> and <NAME>},
booktitle = {2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI)},
doi = {10.1109/ICTAI50040.2020.00069},
isbn = {978-1-7281-9228-4},
keywords = {ai fairness,flexible fairness,online classification},
month = {nov},
pages = {399--406},
publisher = {IEEE},
title = {{Flexible and Adaptive Fairness-aware Learning in Non-stationary Data Streams}},
url = {https://ieeexplore.ieee.org/document/9288346/},
pdf={https://mdsoar.org/bitstream/handle/11603/20072/ICTAI20.pdf?sequence=1&isAllowed=y},
year = {2020}
}
@inproceedings{Pillai2020,
abstract = {Ordering the selection of training data using active learning can lead to improvements in learning efficiently from smaller corpora. We present an exploration of active learning approaches applied to three grounded language problems of varying complexity in order to analyze what methods are suitable for improving data efficiency in learning. We present a method for analyzing the complexity of data in this joint problem space, and report on how characteristics of the underlying task, along with design decisions such as feature selection and classification model, drive the results. We observe that representativeness, along with diversity, is crucial in selecting data samples.},
archivePrefix = {arXiv},
arxivId = {2011.08021},
author = {<NAME> and <NAME> <NAME> <NAME>},
booktitle = {2020 IEEE International Conference on Big Data (Big Data)},
eprint = {2011.08021},
title = {{Sampling Approach Matters: Active Learning for Robotic Language Acquisition}},
url = {http://arxiv.org/abs/2011.08021},
pdf = {http://arxiv.org/pdf/2011.08021},
year = {2020}
}
@inproceedings{Eren2020,
abstract = {The world has faced the devastating outbreak of Severe Acute Respiratory Syndrome Coronavirus-2 (SARS-CoV-2), or COVID-19, in 2020. Research in the subject matter was fast-tracked to such a point that scientists were struggling to keep up with new findings. With this increase in the scientific literature, there arose a need for organizing those documents. We describe an approach to organize and visualize the scientific literature on or related to COVID-19 using machine learning techniques so that papers on similar topics are grouped together. By doing so, the navigation of topics and related papers is simplified. We implemented this approach using the widely recognized CORD-19 dataset to present a publicly available proof of concept.},
author = {Eren, <NAME> and Solovyev, Nick and Raff, Edward and Nicholas, Charles and Johnson, Ben},
booktitle = {Proceedings of the ACM Symposium on Document Engineering 2020},
doi = {10.1145/3395027.3419591},
keywords = {acm reference format,charles nicholas,clustering,covid-19,dimensionality reduction,document visualization,edward raff,maksim ekin eren,nick solovyev},
pages = {1--4},
title = {{COVID-19 Kaggle Literature Organization}},
pdf={https://arxiv.org/pdf/2008.13542},
url = {https://dl.acm.org/doi/10.1145/3395027.3419591},
year = {2020}
}
@inproceedings{Raff2020a,
abstract = {Malware classification is a difficult problem, to which machine learning methods have been applied for decades. Yet progress has often been slow, in part due to a number of unique difficulties with the task that occur through all stages of the developing a machine learning system: data collection, labeling, feature creation and selection, model selection, and evaluation. In this survey we will review a number of the current methods and challenges related to malware classification, including data collection, feature extraction, and model construction, and evaluation. Our discussion will include thoughts on the constraints that must be considered for machine learning based solutions in this domain, and yet to be tackled problems for which machine learning could also provide a solution. This survey aims to be useful both to cybersecurity practitioners who wish to learn more about how machine learning can be applied to the malware problem, and to give data scientists the necessary background into the challenges in this uniquely complicated space.},
archivePrefix = {arXiv},
arxivId = {2006.09271},
author = {<NAME> and <NAME>},
booktitle = {NeurIPS 2020 Workshop: ML Retrospectives, Surveys {\&} Meta-Analyses (ML-RSA)},
eprint = {2006.09271},
keywords = {68t01,68t99,ams subject classifications,cyber security,machine learning,malware detection},
title = {{A Survey of Machine Learning Methods and Challenges for Windows Malware Classification}},
url = {http://arxiv.org/abs/2006.09271},
pdf = {http://arxiv.org/pdf/2006.09271},
year = {2020}
}
@inproceedings{Ordun2020a,
abstract = {With the increased attention on thermal imagery for Covid-19 screening, the public sector may believe there are new opportunities to exploit thermal as a modality for computer vision and AI. Thermal physiology research has been ongoing since the late nineties. This research lies at the intersections of medicine, psychology, machine learning, optics, and affective computing. We will review the known factors of thermal vs. RGB imaging for facial emotion recognition. But we also propose that thermal imagery may provide a semi-anonymous modality for computer vision, over RGB, which has been plagued by misuse in facial recognition. However, the transition to adopting thermal imagery as a source for any human-centered AI task is not easy and relies on the availability of high fidelity data sources across multiple demographics and thorough validation. This paper takes the reader on a short review of machine learning in thermal FER and the limitations of collecting and developing thermal FER data for AI training. Our motivation is to provide an introductory overview into recent advances for thermal FER and stimulate conversation about the limitations in current datasets.},
archivePrefix = {arXiv},
arxivId = {2009.10589},
author = {<NAME> <NAME> <NAME>},
booktitle = {AAAI FSS-20: Artificial Intelligence in Government and Public Sector},
eprint = {2009.10589},
title = {{The Use of AI for Thermal Emotion Recognition: A Review of Problems and Limitations in Standard Design and Data}},
url = {http://arxiv.org/abs/2009.10589},
pdf = {http://arxiv.org/pdf/2009.10589},
year = {2020}
}
@inproceedings{Rahnama2020,
abstract = {Deep neural networks (DNNs) are vulnerable to subtle adversarial perturbations applied to the input. These adversarial perturbations, though imperceptible, can easily mislead the DNN. In this work, we take a control theoretic approach to the problem of robustness in DNNs. We treat each individual layer of the DNN as a nonlinear dynamical system and use Lyapunov theory to prove stability and robustness locally. We then proceed to prove stability and robustness globally for the entire DNN. We develop empirically tight bounds on the response of the output layer, or any hidden layer, to adversarial perturbations added to the input, or the input of hidden layers. Recent works have proposed spectral norm regularization as a solution for improving robustness against l2 adversarial attacks. Our results give new insights into how spectral norm regularization can mitigate the adversarial effects. Finally, we evaluate the power of our approach on a variety of data sets and network architectures and against some of the well-known adversarial attacks.},
archivePrefix = {arXiv},
arxivId = {1911.04636},
author = {<NAME> <NAME>. and <NAME>},
booktitle = {The IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)},
eprint = {1911.04636},
pages = {8178--8187},
title = {{Robust Design of Deep Neural Networks against Adversarial Attacks based on Lyapunov Theory}},
url = {http://arxiv.org/abs/1911.04636},
pdf = {http://arxiv.org/pdf/1911.04636},
year = {2020}
}
@inproceedings{Raff2020autoyara,
abstract = {Yara rules are a ubiquitous tool among cybersecurity practitioners and analysts. Developing high-quality Yara rules to detect a malware family of interest can be labor- and time-intensive, even for expert users. Few tools exist and relatively little work has been done on how to automate the generation of Yara rules for specific families. In this paper, we leverage large n-grams ({\$}n \backslashgeq 8{\$}) combined with a new biclustering algorithm to construct simple Yara rules more effectively than currently available software. Our method, AutoYara, is fast, allowing for deployment on low-resource equipment for teams that deploy to remote networks. Our results demonstrate that AutoYara can help reduce analyst workload by producing rules with useful true-positive rates while maintaining low false-positive rates, sometimes matching or even outperforming human analysts. In addition, real-world testing by malware analysts indicates AutoYara could reduce analyst time spent constructing Yara rules by 44-86{\%}, allowing them to spend their time on the more advanced malware that current tools can't handle. Code will be made available at https://github.com/NeuromorphicComputationResearchProgram .},
archivePrefix = {arXiv},
arxivId = {2009.03779},
author = {<NAME> and <NAME> and Munoz, <NAME> and <NAME> and <NAME>. and <NAME> and <NAME> and <NAME>},
booktitle = {13th ACM Workshop on Artificial Intelligence and Security (AISec'20)},
doi = {10.1145/3411508.3421372},
eprint = {2009.03779},
title = {{Automatic Yara Rule Generation Using Biclustering}},
url = {http://arxiv.org/abs/2009.03779},
pdf = {http://arxiv.org/pdf/2009.03779},
year = {2020}
}
@inproceedings{Raff2020,
abstract = {Prior work inspired by compression algorithms has described how the Burrows Wheeler Transform can be used to create a distance measure for bioinformatics problems. We describe issues with this approach that were not widely known, and introduce our new Burrows Wheeler Markov Distance (BWMD) as an alternative. The BWMD avoids the shortcomings of earlier efforts, and allows us to tackle problems in variable length DNA sequence clustering. BWMD is also more adaptable to other domains, which we demonstrate on malware classification tasks. Unlike other compression-based distance metrics known to us, BWMD works by embedding sequences into a fixed-length feature vector. This allows us to provide significantly improved clustering performance on larger malware corpora, a weakness of prior methods.},
archivePrefix = {arXiv},
arxivId = {1912.13046},
author = {<NAME> Nicholas, <NAME> <NAME>},
booktitle = {The Thirty-Fourth AAAI Conference on Artificial Intelligence},
doi = {10.1609/aaai.v34i04.5994},
eprint = {1912.13046},
pages = {5444--5453},
title = {{A New Burrows Wheeler Transform Markov Distance}},
url = {http://arxiv.org/abs/1912.13046},
url = {http://arxiv.org/pdf/1912.13046.pdf},
year = {2020}
}
@inproceedings{Nolet2020,
abstract = {The Uniform Manifold Approximation and Projection (UMAP) algorithm has become widely popular for its ease of use, quality of results, and support for exploratory, unsupervised, supervised, and semi-supervised learning. While many algorithms can be ported to a GPU in a simple and direct fashion, such efforts have resulted in inefficent and inaccurate versions of UMAP. We show a number of techniques that can be used to make a faster and more faithful GPU version of UMAP, and obtain speedups of up to 100x in practice. Many of these design choices/lessons are general purpose and may inform the conversion of other graph and manifold learning algorithms to use GPUs. Our implementation has been made publicly available as part of the open source RAPIDS cuML library(https://github.com/rapidsai/cuml).},
archivePrefix = {arXiv},
arxivId = {2008.00325},
author = {Nolet, <NAME>. and Lafargue, <NAME> Raff, <NAME> Oates, <NAME>, <NAME>},
booktitle = {The Thirty-Fifth AAAI Conference on Artificial Intelligence},
eprint = {2008.00325},
title = {{Bringing UMAP Closer to the Speed of Light with GPU Acceleration}},
url = {http://arxiv.org/abs/2008.00325},
year = {2021},
pdf={https://arxiv.org/pdf/2008.00325.pdf}
}
@inproceedings{Raff2020c,
abstract = {There has been increasing concern within the machine learning community that we are in a reproducibility crisis. As many have begun to work on this problem, all work we are aware of treat the issue of reproducibility as an intrinsic binary property: a paper is or is not reproducible. Instead, we consider modeling the reproducibility of a paper as a survival analysis problem. We argue that this perspective represents a more accurate model of the underlying meta-science question of reproducible research, and we show how a survival analysis allows us to draw new insights that better explain prior longitudinal data. The data and code can be found at https://github.com/EdwardRaff/Research-Reproducibility-Survival-Analysis},
archivePrefix = {arXiv},
arxivId = {2012.09932},
author = {<NAME>},
booktitle = {The Thirty-Fifth AAAI Conference on Artificial Intelligence},
eprint = {2012.09932},
title = {{Research Reproducibility as a Survival Analysis}},
url = {http://arxiv.org/abs/2012.09932},
pdf = {http://arxiv.org/pdf/2012.09932},
year = {2021}
}
@inproceedings{Raff2020b,
abstract = {Recent works within machine learning have been tackling inputs of ever-increasing size, with cybersecurity presenting sequence classification problems of particularly extreme lengths. In the case of Windows executable malware detection, inputs may exceed {\$}100{\$} MB, which corresponds to a time series with {\$}T=100,000,000{\$} steps. To date, the closest approach to handling such a task is MalConv, a convolutional neural network capable of processing up to {\$}T=2,000,000{\$} steps. The {\$}\backslashmathcal{\{}O{\}}(T){\$} memory of CNNs has prevented further application of CNNs to malware. In this work, we develop a new approach to temporal max pooling that makes the required memory invariant to the sequence length {\$}T{\$}. This makes MalConv {\$}116\backslashtimes{\$} more memory efficient, and up to {\$}25.8\backslashtimes{\$} faster to train on its original dataset, while removing the input length restrictions to MalConv. We re-invest these gains into improving the MalConv architecture by developing a new Global Channel Gating design, giving us an attention mechanism capable of learning feature interactions across 100 million time steps in an efficient manner, a capability lacked by the original MalConv CNN. Our implementation can be found at https://github.com/NeuromorphicComputationResearchProgram/MalConv2},
archivePrefix = {arXiv},
arxivId = {2012.09390},
author = {<NAME> <NAME> and <NAME>. and <NAME> and <NAME>},
booktitle = {The Thirty-Fifth AAAI Conference on Artificial Intelligence},
eprint = {2012.09390},
title = {{Classifying Sequences of Extreme Length with Constant Memory Applied to Malware Detection}},
url = {http://arxiv.org/abs/2012.09390},
pdf = {http://arxiv.org/pdf/2012.09390},
year = {2021}
}
@inproceedings{Ordun2020,
abstract = {This paper illustrates five different techniques to assess the distinctiveness of topics, key terms and features, speed of information dissemination, and network behaviors for Covid19 tweets. First, we use pattern matching and second, topic modeling through Latent Dirichlet Allocation (LDA) to generate twenty different topics that discuss case spread, healthcare workers, and personal protective equipment (PPE). One topic specific to U.S. cases would start to uptick immediately after live White House Coronavirus Task Force briefings, implying that many Twitter users are paying attention to government announcements. We contribute machine learning methods not previously reported in the Covid19 Twitter literature. This includes our third method, Uniform Manifold Approximation and Projection (UMAP), that identifies unique clustering-behavior of distinct topics to improve our understanding of important themes in the corpus and help assess the quality of generated topics. Fourth, we calculated retweeting times to understand how fast information about Covid19 propagates on Twitter. Our analysis indicates that the median retweeting time of Covid19 for a sample corpus in March 2020 was 2.87 hours, approximately 50 minutes faster than repostings from Chinese social media about H7N9 in March 2013. Lastly, we sought to understand retweet cascades, by visualizing the connections of users over time from fast to slow retweeting. As the time to retweet increases, the density of connections also increase where in our sample, we found distinct users dominating the attention of Covid19 retweeters. One of the simplest highlights of this analysis is that early-stage descriptive methods like regular expressions can successfully identify high-level themes which were consistently verified as important through every subsequent analysis.},
archivePrefix = {arXiv},
arxivId = {2005.03082},
author = {<NAME> <NAME> <NAME>},
booktitle = {epiDAMIK 2020: 3rd epiDAMIK ACM SIGKDD International Workshop on Epidemiology meets Data Mining and Knowledge Discovery},
eprint = {2005.03082},
title = {{Exploratory Analysis of Covid-19 Tweets using Topic Modeling, UMAP, and DiGraphs}},
url = {http://arxiv.org/abs/2005.03082},
pdf = {http://arxiv.org/pdf/2005.03082},
year = {2020}
}

@inproceedings{DBLP:conf/dsaa/ShahapureN20,
  author    = {<NAME> and
               <NAME>},
  editor    = {<NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME>},
  title     = {Cluster Quality Analysis Using Silhouette Score},
  booktitle = {7th {IEEE} International Conference on Data Science and Advanced Analytics,
               {DSAA} 2020, Sydney, Australia, October 6-9, 2020},
  pages     = {747--748},
  publisher = {{IEEE}},
  year      = {2020},
  url       = {https://doi.org/10.1109/DSAA49011.2020.00096},
  doi       = {10.1109/DSAA49011.2020.00096},
  timestamp = {Tue, 24 Nov 2020 12:27:16 +0100},
  biburl    = {https://dblp.org/rec/conf/dsaa/ShahapureN20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2005-02911,
  author    = {<NAME> and
               <NAME>},
  title     = {A Quantum Algorithm To Locate Unknown Hashes For Known N-Grams Within
               {A} Large Malware Corpus},
  journal   = {CoRR},
  volume    = {abs/2005.02911},
  year      = {2020},
  url       = {https://arxiv.org/abs/2005.02911},
  archivePrefix = {arXiv},
  eprint    = {2005.02911},
  timestamp = {Sun, 10 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2005-02911.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/doceng/Nicholas17,
  author    = {<NAME>},
  editor    = {<NAME> and
               <NAME>},
  title     = {Document Engineering Issues in Malware Analysis},
  booktitle = {Proceedings of the 2017 {ACM} Symposium on Document Engineering, DocEng
               2017, Valletta, Malta, September 4-7, 2017},
  pages     = {3},
  publisher = {{ACM}},
  year      = {2017},
  url       = {https://doi.org/10.1145/3103010.3103027},
  doi       = {10.1145/3103010.3103027},
  timestamp = {Tue, 06 Nov 2018 16:57:31 +0100},
  biburl    = {https://dblp.org/rec/conf/doceng/Nicholas17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/doceng/NicholasB16,
  author    = {<NAME> and
               <NAME>},
  editor    = {<NAME> and
               <NAME>},
  title     = {Document Engineering Issues in Malware Analysis},
  booktitle = {Proceedings of the 2016 {ACM} Symposium on Document Engineering, DocEng
               2016, Vienna, Austria, September 13 - 16, 2016},
  pages     = {3},
  publisher = {{ACM}},
  year      = {2016},
  url       = {https://doi.org/10.1145/2960811.2967174},
  doi       = {10.1145/2960811.2967174},
  timestamp = {Tue, 06 Nov 2018 16:57:33 +0100},
  biburl    = {https://dblp.org/rec/conf/doceng/NicholasB16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/doceng/NicholasB15,
  author    = {<NAME> and
               <NAME>},
  editor    = {<NAME> and
               <NAME>{\`{e}}s},
  title     = {Document Engineering Issues in Document Analysis},
  booktitle = {Proceedings of the 2015 {ACM} Symposium on Document Engineering, DocEng
               2015, Lausanne, Switzerland, September 8-11, 2015},
  pages     = {229--230},
  publisher = {{ACM}},
  year      = {2015},
  url       = {https://doi.org/10.1145/2682571.2801033},
  doi       = {10.1145/2682571.2801033},
  timestamp = {Tue, 06 Nov 2018 16:57:32 +0100},
  biburl    = {https://dblp.org/rec/conf/doceng/NicholasB15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/sigweb/NicholasM13,
  author    = {<NAME> and
               <NAME>},
  title     = {Document engineering education: workshop report},
  journal   = {{SIGWEB} Newsl.},
  volume    = {2013},
  number    = {Winter},
  pages     = {1:1--1:5},
  year      = {2013},
  url       = {https://doi.org/10.1145/2430733.2430734},
  doi       = {10.1145/2430733.2430734},
  timestamp = {Thu, 16 Jul 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/sigweb/NicholasM13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/vizsec/LeschkeN13,
  author    = {<NAME> and
               <NAME>},
  editor    = {<NAME> and
               Kwan{-}<NAME> and
               <NAME> and
               <NAME>},
  title     = {Change-link 2.0: a digital forensic tool for visualizing changes to
               shadow volume data},
  booktitle = {10th Workshop on Visualization for Cyber Security, VizSec 2013, Atlanta,
               GA, USA, October 14, 2013},
  pages     = {17--24},
  publisher = {{ACM}},
  year      = {2013},
  url       = {https://doi.org/10.1145/2517957.2517960},
  doi       = {10.1145/2517957.2517960},
  timestamp = {Wed, 24 Feb 2021 16:44:20 +0100},
  biburl    = {https://dblp.org/rec/conf/vizsec/LeschkeN13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/naacl/McNameeMN09,
  author    = {<NAME> and
               <NAME> and
               <NAME>},
  title     = {Translation Corpus Source and Size in Bilingual Retrieval},
  booktitle = {Human Language Technologies: Conference of the North American Chapter
               of the Association of Computational Linguistics, Proceedings, May
               31 - June 5, 2009, Boulder, Colorado, USA, Short Papers},
  pages     = {25--28},
  publisher = {The Association for Computational Linguistics},
  year      = {2009},
  url       = {https://www.aclweb.org/anthology/N09-2007/},
  timestamp = {Wed, 18 Sep 2019 12:15:54 +0200},
  biburl    = {https://dblp.org/rec/conf/naacl/McNameeMN09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sigir/McNameeNM09,
  author    = {<NAME> and
               <NAME> and
               <NAME>},
  editor    = {<NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME>},
  title     = {Addressing morphological variation in alphabetic languages},
  booktitle = {Proceedings of the 32nd Annual International {ACM} {SIGIR} Conference
               on Research and Development in Information Retrieval, {SIGIR} 2009,
               Boston, MA, USA, July 19-23, 2009},
  pages     = {75--82},
  publisher = {{ACM}},
  year      = {2009},
  url       = {https://doi.org/10.1145/1571941.1571957},
  doi       = {10.1145/1571941.1571957},
  timestamp = {Wed, 14 Nov 2018 10:58:10 +0100},
  biburl    = {https://dblp.org/rec/conf/sigir/McNameeNM09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cikm/WilsonN08,
  author    = {<NAME> and
               <NAME>},
  editor    = {<NAME> and
               <NAME> and
               <NAME>},
  title     = {Topological analysis of an online social network for older adults},
  booktitle = {Proceeding of the 2008 {ACM} Workshop on Search in Social Media, {SSM}
               2008, Napa Valley, California, USA, October 30, 2008},
  pages     = {51--58},
  publisher = {{ACM}},
  year      = {2008},
  url       = {https://doi.org/10.1145/1458583.1458596},
  doi       = {10.1145/1458583.1458596},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/cikm/WilsonN08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sigir/McNameeNM08,
  author    = {<NAME> and
               <NAME> and
               <NAME>},
  editor    = {Sung{-}<NAME> and
               <NAME> and
               <NAME> and
               Tat{-}<NAME> and
               Mun{-}<NAME>},
  title     = {Don't have a stemmer?: be un+concern+ed},
  booktitle = {Proceedings of the 31st Annual International {ACM} {SIGIR} Conference
               on Research and Development in Information Retrieval, {SIGIR} 2008,
               Singapore, July 20-24, 2008},
  pages     = {813--814},
  publisher = {{ACM}},
  year      = {2008},
  url       = {https://doi.org/10.1145/1390334.1390518},
  doi       = {10.1145/1390334.1390518},
  timestamp = {Tue, 06 Nov 2018 11:07:25 +0100},
  biburl    = {https://dblp.org/rec/conf/sigir/McNameeNM08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eor/VolkovichKN07,
  author    = {<NAME> and
               <NAME> and
               <NAME>},
  title     = {Building initial partitions through sampling techniques},
  journal   = {Eur. J. Oper. Res.},
  volume    = {183},
  number    = {3},
  pages     = {1097--1105},
  year      = {2007},
  url       = {https://doi.org/10.1016/j.ejor.2005.12.045},
  doi       = {10.1016/j.ejor.2005.12.045},
  timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/eor/VolkovichKN07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@incollection{DBLP:books/daglib/p/VolkovichKN06,
  author    = {<NAME> and
               <NAME> and
               <NAME>},
  editor    = {<NAME> and
               <NAME> and
               <NAME>},
  title     = {Sampling Methods for Building Initial Partitions},
  booktitle = {Grouping Multidimensional Data - Recent Advances in Clustering},
  pages     = {161--185},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/3-540-28349-8\_6},
  doi       = {10.1007/3-540-28349-8\_6},
  timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/books/daglib/p/VolkovichKN06.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@book{DBLP:books/daglib/0015184,
  editor    = {<NAME> and
               <NAME> and
               <NAME>},
  title     = {Grouping Multidimensional Data - Recent Advances in Clustering},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/3-540-28349-8},
  doi       = {10.1007/3-540-28349-8},
  isbn      = {978-3-540-28348-5},
  timestamp = {Tue, 16 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/books/daglib/0015184.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ir/KoganTN05,
  author    = {<NAME> and
               <NAME> and
               <NAME>},
  title     = {Data Driven Similarity Measures for \emph{k}-Means Like Clustering
               Algorithms},
  journal   = {Inf. Retr.},
  volume    = {8},
  number    = {2},
  pages     = {331--349},
  year      = {2005},
  url       = {https://doi.org/10.1007/s10791-005-5666-8},
  doi       = {10.1007/s10791-005-5666-8},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/ir/KoganTN05.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dke/BhatOSN04,
  author    = {<NAME> and
               <NAME> and
               <NAME> and
               <NAME>},
  title     = {Finding aliases on the web using latent semantic analysis},
  journal   = {Data Knowl. Eng.},
  volume    = {49},
  number    = {2},
  pages     = {129--143},
  year      = {2004},
  url       = {https://doi.org/10.1016/j.datak.2003.10.006},
  doi       = {10.1016/j.datak.2003.10.006},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/dke/BhatOSN04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cse/KoganNV03,
  author    = {<NAME> and
               <NAME> and
               <NAME>},
  title     = {Text mining with information-theoretic clustering},
  journal   = {Comput. Sci. Eng.},
  volume    = {5},
  number    = {6},
  pages     = {52--59},
  year      = {2003},
  url       = {https://doi.org/10.1109/MCISE.2003.1238704},
  doi       = {10.1109/MCISE.2003.1238704},
  timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/cse/KoganNV03.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/trec/KallurkarSCNJJRSBO03,
  author    = {<NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME>},
  editor    = {<NAME> and
               <NAME>},
  title     = {{UMBC} at {TREC} 12},
  booktitle = {Proceedings of The Twelfth Text REtrieval Conference, {TREC} 2003,
               Gaithersburg, Maryland, USA, November 18-21, 2003},
  series    = {{NIST} Special Publication},
  volume    = {500-255},
  pages     = {699--706},
  publisher = {National Institute of Standards and Technology {(NIST)}},
  year      = {2003},
  url       = {http://trec.nist.gov/pubs/trec12/papers/umbc.web.novelty.pdf},
  timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/trec/KallurkarSCNJJRSBO03.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/expert/CostFJPNSCKPZT02,
  author    = {<NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME>},
  title     = {ITtalks: {A} Case Study in the Semantic Web and {DAML+OIL}},
  journal   = {{IEEE} Intell. Syst.},
  volume    = {17},
  number    = {1},
  pages     = {40--47},
  year      = {2002},
  url       = {https://doi.org/10.1109/5254.988447},
  doi       = {10.1109/5254.988447},
  timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/expert/CostFJPNSCKPZT02.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ir/SoboroffN02,
  author    = {<NAME> and
               <NAME>},
  title     = {Related, but not Relevant: Content-Based Collaborative Filtering in
               {TREC-8}},
  journal   = {Inf. Retr.},
  volume    = {5},
  number    = {2-3},
  pages     = {189--208},
  year      = {2002},
  url       = {https://doi.org/10.1023/A:1015797928606},
  doi       = {10.1023/A:1015797928606},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/ir/SoboroffN02.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cia/CostKMNS02,
  author    = {<NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME>},
  editor    = {<NAME> and
               <NAME> and
               <NAME>},
  title     = {Integrating Distributed Information Sources with {CARROT} {II}},
  booktitle = {Cooperative Information Agents VI, 6th International Workshop, {CIA}
               2002, Madrid, Spain, September 18-20, 2002, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2446},
  pages     = {194--201},
  publisher = {Springer},
  year      = {2002},
  url       = {https://doi.org/10.1007/3-540-45741-0\_17},
  doi       = {10.1007/3-540-45741-0\_17},
  timestamp = {Tue, 14 May 2019 10:00:54 +0200},
  biburl    = {https://dblp.org/rec/conf/cia/CostKMNS02.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/trec/CostKMNS02,
  author    = {<NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME>},
  editor    = {<NAME> and
               <NAME>},
  title     = {{CARROTT} 11 and the {TREC} 11 Web Track},
  booktitle = {Proceedings of The Eleventh Text REtrieval Conference, {TREC} 2002,
               Gaithersburg, Maryland, USA, November 19-22, 2002},
  series    = {{NIST} Special Publication},
  volume    = {500-251},
  publisher = {National Institute of Standards and Technology {(NIST)}},
  year      = {2002},
  url       = {http://trec.nist.gov/pubs/trec11/papers/umbc.kallurkar.pdf},
  timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/trec/CostKMNS02.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wrac/KagalPCTZFJPCN02,
  author    = {<NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME>},
  editor    = {<NAME> and
               <NAME> and
               <NAME>},
  title     = {Agents Making Sense of the Semantic Web},
  booktitle = {Innovative Concepts for Agent-Based Systems, First International Workshop
               on Radical Agent Concepts, {WRAC} 2002, McLean, VA, USA, January 16-18,
               2002, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {2564},
  pages     = {417--433},
  publisher = {Springer},
  year      = {2002},
  url       = {https://doi.org/10.1007/978-3-540-45173-0\_32},
  doi       = {10.1007/978-3-540-45173-0\_32},
  timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/wrac/KagalPCTZFJPCN02.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{10.1145/383952.383961,
author = {<NAME> <NAME> and <NAME>},
title = {Ranking Retrieval Systems without Relevance Judgments},
year = {2001},
isbn = {1581133316},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/383952.383961},
doi = {10.1145/383952.383961},
abstract = {The most prevalent experimental methodology for comparing the effectiveness of information retrieval systems requires a test collection, composed of a set of documents, a set of query topics, and a set of relevance judgments indicating which documents are relevant to which topics. It is well known that relevance judgments are not infallible, but recent retrospective investigation into results from the Text REtrieval Conference (TREC) has shown that differences in human judgments of relevance do not affect the relative measured performance of retrieval systems. Based on this result, we propose and describe the initial results of a new evaluation methodology which replaces human relevance judgments with a randomly selected mapping of documents to topics which we refer to aspseudo-relevance judgments.Rankings of systems with our methodology correlate positively with official TREC rankings, although the performance of the top systems is not predicted well. The correlations are stable over a variety of pool depths and sampling techniques. With improvements, such a methodology could be useful in evaluating systems such as World-Wide Web search engines, where the set of documents changes too often to make traditional collection construction techniques practical.},
booktitle = {Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {66–73},
numpages = {8},
location = {New Orleans, Louisiana, USA},
series = {SIGIR '01},
selected={true}
}



@inproceedings{DBLP:conf/esaw/PerichKCTZFJPCN01,
  author    = {<NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME>},
  editor    = {<NAME> and
               <NAME> and
               <NAME>},
  title     = {{ITTALKS:} An Application of Agents in the Semantic Web},
  booktitle = {Engineering Societies in the Agents World II, Second International
               Workshop, {ESAW} 2001, Prague, Czech Republic, July 7, 2001, Revised
               Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {2203},
  pages     = {175--194},
  publisher = {Springer},
  year      = {2001},
  url       = {https://doi.org/10.1007/3-540-45584-1\_12},
  doi       = {10.1007/3-540-45584-1\_12},
  timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/esaw/PerichKCTZFJPCN01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/semweb/CostFJPNCKPZT01,
  author    = {<NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME>},
  editor    = {<NAME> and
               <NAME> and
               J{\'{e}}r{\^{o}}<NAME> and
               <NAME>},
  title     = {{ITTALKS:} {A} Case Study in the Semantic Web and {DAML}},
  booktitle = {Proceedings of SWWS'01, The first Semantic Web Working Symposium,
               Stanford University, California, USA, July 30 - August 1, 2001},
  pages     = {477--494},
  year      = {2001},
  url       = {http://www.semanticweb.org/SWWS/program/full/paper41.pdf},
  timestamp = {Fri, 19 Sep 2003 08:41:21 +0200},
  biburl    = {https://dblp.org/rec/conf/semweb/CostFJPNCKPZT01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sigir/SoboroffNC01,
  author    = {<NAME> and
               <NAME> and
               <NAME>},
  editor    = {<NAME> and
               <NAME> and
               <NAME> and
               <NAME>},
  title     = {Ranking Retrieval Systems without Relevance Judgments},
  booktitle = {{SIGIR} 2001: Proceedings of the 24th Annual International {ACM} {SIGIR}
               Conference on Research and Development in Information Retrieval, September
               9-13, 2001, New Orleans, Louisiana, {USA}},
  pages     = {66--73},
  publisher = {{ACM}},
  year      = {2001},
  url       = {https://doi.org/10.1145/383952.383961},
  doi       = {10.1145/383952.383961},
  timestamp = {Tue, 06 Nov 2018 11:07:24 +0100},
  biburl    = {https://dblp.org/rec/conf/sigir/SoboroffNC01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/vissym/AtkisonPNEAM01,
  author    = {<NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME>},
  editor    = {<NAME> and
               <NAME> and
               <NAME>},
  title     = {Case Study: Visualization and Information Retrieval Techniques for
               Network Intrusion Detection},
  booktitle = {3rd Joint Eurographics - {IEEE} {TCVG} Symposium on Visualization,
               VisSym 2001, Ascona, Switzerland, May 28-30, 2001},
  pages     = {283--290},
  publisher = {Eurographics Association},
  year      = {2001},
  url       = {https://doi.org/10.1007/978-3-7091-6215-6\_30},
  doi       = {10.1007/978-3-7091-6215-6\_30},
  timestamp = {Mon, 12 Oct 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/vissym/AtkisonPNEAM01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jodi/MillarSLN00,
  author    = {<NAME> and
               <NAME> and
               <NAME> and
               <NAME>},
  title     = {Performance and Scalability of a Large-Scale N-gram Based Information
               Retrieval System},
  journal   = {J. Digit. Inf.},
  volume    = {1},
  number    = {5},
  year      = {2000},
  url       = {http://journals.tdl.org/jodi/article/view/22},
  timestamp = {Tue, 25 Jan 2011 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/jodi/MillarSLN00.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sigir/SoboroffN00,
  author    = {<NAME> and
               <NAME>},
  editor    = {<NAME> and
               <NAME> and
               <NAME> and
               Mun{-}<NAME>},
  title     = {Collaborative filtering and the generalized vector space model},
  booktitle = {{SIGIR} 2000: Proceedings of the 23rd Annual International {ACM} {SIGIR}
               Conference on Research and Development in Information Retrieval, July
               24-28, 2000, Athens, Greece},
  pages     = {351--353},
  publisher = {{ACM}},
  year      = {2000},
  url       = {https://doi.org/10.1145/345508.345646},
  doi       = {10.1145/345508.345646},
  timestamp = {Tue, 06 Nov 2018 11:07:24 +0100},
  biburl    = {https://dblp.org/rec/conf/sigir/SoboroffN00.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jodl/ShawKSENZMR99,
  author    = {<NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME>},
  title     = {Interactive Volumetric Information Visualization for Document Corpus
               Management},
  journal   = {Int. J. Digit. Libr.},
  volume    = {2},
  number    = {2-3},
  pages     = {144--156},
  year      = {1999},
  url       = {https://doi.org/10.1007/s007990050043},
  doi       = {10.1007/s007990050043},
  timestamp = {Fri, 11 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jodl/ShawKSENZMR99.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/sigir/SoboroffNP99,
  author    = {<NAME> and
               <NAME> and
               <NAME>},
  title     = {Workshop on Recommender Systems: Algorithms and Evaluation},
  journal   = {{SIGIR} Forum},
  volume    = {33},
  number    = {1},
  pages     = {36--43},
  year      = {1999},
  url       = {https://doi.org/10.1145/331403.331413},
  doi       = {10.1145/331403.331413},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/sigir/SoboroffNP99.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/pdpta/MillerSLNC99,
  author    = {<NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME>},
  editor    = {<NAME>},
  title     = {Techniques for Gigabyte-Scale N-gram Based Information Retrieval on
               Personal Computers},
  booktitle = {Proceedings of the International Conference on Parallel and Distributed
               Processing Techniques and Applications, {PDPTA} 1999, June 28 - Junlly
               1, 1999, Las Vegas, Nevada, {USA}},
  pages     = {1410--1416},
  publisher = {{CSREA} Press},
  year      = {1999},
  timestamp = {Tue, 20 Apr 2004 14:47:51 +0200},
  biburl    = {https://dblp.org/rec/conf/pdpta/MillerSLNC99.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/ep/NicholasD98,
  author    = {<NAME> and
               <NAME>},
  editor    = {<NAME> and
               <NAME> and
               <NAME>},
  title     = {Spotting Topics with the Singular Value Decomposition},
  booktitle = {Principles of Digital Document Processing, 4th International Workshop,
               PODDP'98, Saint Malo, France, March 29-30, 1998, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1481},
  pages     = {82--91},
  publisher = {Springer},
  year      = {1998},
  url       = {https://doi.org/10.1007/3-540-49654-8\_7},
  doi       = {10.1007/3-540-49654-8\_7},
  timestamp = {Tue, 14 May 2019 10:00:48 +0200},
  biburl    = {https://dblp.org/rec/conf/ep/NicholasD98.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}


@inproceedings{DBLP:conf/atal/CostSLFMN97,
  author    = {<NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME>},
  editor    = {<NAME> and
               <NAME> and
               <NAME>},
  title     = {{TKQML:} {A} Scripting Tool for Building Agents},
  booktitle = {Intelligent Agents IV, Agent Theories, Architectures, and Languages,
               4th International Workshop, {ATAL} '97, Providence, Rhode Island,
               USA, July 24-26, 1997, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1365},
  pages     = {339--343},
  publisher = {Springer},
  year      = {1997},
  url       = {https://doi.org/10.1007/BFb0026770},
  doi       = {10.1007/BFb0026770},
  timestamp = {Tue, 29 Dec 2020 18:27:45 +0100},
  biburl    = {https://dblp.org/rec/conf/atal/CostSLFMN97.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cikm/SoboroffNKE97,
  author    = {<NAME> and
               <NAME> and
               <NAME> and
               <NAME>},
  title     = {Visualizing Document Authorship Using n-grams and Latent Semantic
               Indexing},
  booktitle = {Proceedings of the Workshop on New Paradigms in Information Visualization
               and Manipulation {(NIPV} '97), in conjuction with {CIKM} '97, November
               10-14, 1997, Las Vegas, NV, {USA}},
  pages     = {43--48},
  publisher = {{ACM}},
  year      = {1997},
  url       = {https://doi.org/10.1145/275519.275529},
  doi       = {10.1145/275519.275529},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/cikm/SoboroffNKE97.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/tcltk/CostSLFMN97,
  author    = {<NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME>. Nicholas},
  editor    = {<NAME> and
               <NAME>},
  title     = {Agent Development Support for Tcl},
  booktitle = {Proceedings of the Fifth Annual Tcl/Tk Workshop 1997, Boston, Massachusetts,
               USA, July 14-17, 1997},
  publisher = {{USENIX} Association},
  year      = {1997},
  url       = {https://www.usenix.org/legacy/publications/library/proceedings/tcl97/poster\_cost.html},
  timestamp = {Tue, 02 Feb 2021 08:04:40 +0100},
  biburl    = {https://dblp.org/rec/conf/tcltk/CostSLFMN97.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jasis/PearceN96,
  author    = {<NAME> and
               <NAME>},
  title     = {{TELLTALE:} Experiments in a Dynamic Hypertext Environment for Degraded
               and Multilingual Data},
  journal   = {J. Am. Soc. Inf. Sci.},
  volume    = {47},
  number    = {4},
  pages     = {263--275},
  year      = {1996},
  url       = {https://doi.org/10.1002/(SICI)1097-4571(199604)47:4\&\#60;263::AID-ASI2\&\#62;3.0.CO;2-V},
  doi       = {10.1002/(SICI)1097-4571(199604)47:4\&\#60;263::AID-ASI2\&\#62;3.0.CO;2-V},
  timestamp = {Wed, 13 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/jasis/PearceN96.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cn/RoweN95,
  author    = {<NAME> and
               <NAME>},
  title     = {Reliability of {WWW} Name Servers},
  journal   = {Comput. Networks {ISDN} Syst.},
  volume    = {27},
  number    = {6},
  pages     = {773--780},
  year      = {1995},
  url       = {https://doi.org/10.1016/0169-7552(95)00045-9},
  doi       = {10.1016/0169-7552(95)00045-9},
  timestamp = {Thu, 14 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/cn/RoweN95.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/epodd/NicholasR93,
  author    = {<NAME> and
               <NAME>},
  title     = {Canto: a Hypertext Data Model},
  journal   = {Electron. Publ.},
  volume    = {6},
  number    = {2},
  pages     = {93--113},
  year      = {1993},
  timestamp = {Tue, 01 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/epodd/NicholasR93.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijcis/NicholasY93,
  author    = {<NAME> and
               <NAME>},
  title     = {Information and Knowledge Management: Guest Editors' Introduction},
  journal   = {Int. J. Cooperative Inf. Syst.},
  volume    = {2},
  number    = {2},
  pages     = {105--106},
  year      = {1993},
  url       = {https://doi.org/10.1142/S0218215793000216},
  doi       = {10.1142/S0218215793000216},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/ijcis/NicholasY93.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijcis/MayfieldN93,
  author    = {<NAME> and
               <NAME>},
  title     = {Snitch: Augmenting Hypertext Documents with a Semantic Net},
  journal   = {Int. J. Cooperative Inf. Syst.},
  volume    = {2},
  number    = {3},
  pages     = {335--354},
  year      = {1993},
  url       = {https://doi.org/10.1142/S0218215793000150},
  doi       = {10.1142/S0218215793000150},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/ijcis/MayfieldN93.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cikm/PearceN93,
  author    = {<NAME> and
               <NAME>},
  editor    = {<NAME> and
               <NAME> and
               <NAME>},
  title     = {Generating a Dynamic Hypertext Environment with n-gram Analysis},
  booktitle = {{CIKM} 93, Proceedings of the Second International Conference on Information
               and Knowledge Management, Washington, DC, USA, November 1-5, 1993},
  pages     = {148--153},
  publisher = {{ACM}},
  year      = {1993},
  url       = {https://doi.org/10.1145/170088.170121},
  doi       = {10.1145/170088.170121},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/cikm/PearceN93.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/epodd/NicholasW92,
  author    = {<NAME> and
               <NAME>},
  title     = {On the Interchangeability of {SGML} and {ODA}},
  journal   = {Electron. Publ.},
  volume    = {5},
  number    = {3},
  pages     = {105--130},
  year      = {1992},
  timestamp = {Tue, 01 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/epodd/NicholasW92.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tse/MamrakKNS89,
  author    = {<NAME> and
               <NAME> and
               <NAME> and
               <NAME>},
  title     = {Chameleon: {A} System for Solving the Data-Translation Problem},
  journal   = {{IEEE} Trans. Software Eng.},
  volume    = {15},
  number    = {9},
  pages     = {1090--1108},
  year      = {1989},
  url       = {https://doi.org/10.1109/32.31367},
  doi       = {10.1109/32.31367},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/tse/MamrakKNS89.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cacm/MamrakKNS87,
  author    = {<NAME> and
               <NAME> and
               <NAME> and
               <NAME>},
  title     = {A Software Architecture for Supporting the Exchange of Electronic
               Manuscripts},
  journal   = {Commun. {ACM}},
  volume    = {30},
  number    = {5},
  pages     = {408--414},
  year      = {1987},
  url       = {https://doi.org/10.1145/22899.22905},
  doi       = {10.1145/22899.22905},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/cacm/MamrakKNS87.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icdcs/MamrakMGJN82,
  author    = {<NAME> and
               <NAME> and
               <NAME> and
               <NAME> and
               <NAME>},
  title     = {Guest Layer in Distributed Processing Support on Local Operating Systems},
  booktitle = {Proceedings of the 3rd International Conference on Distributed Computing
               Systems, Miami/Ft. Lauderdale, Florida, USA, October 18-22, 1982},
  pages     = {854--859},
  publisher = {{IEEE} Computer Society},
  year      = {1982},
  timestamp = {Fri, 19 Mar 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/icdcs/MamrakMGJN82.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{Bouthillier2021,
abstract = {Strong empirical evidence that one machine-learning algorithm A outperforms another one B ideally calls for multiple trials optimizing the learning pipeline over sources of variation such as data sampling, data augmentation, parameter initialization, and hyperparameters choices. This is prohibitively expensive, and corners are cut to reach conclusions. We model the whole benchmarking process, revealing that variance due to data sampling, parameter initialization and hyperparameter choice impact markedly the results. We analyze the predominant comparison methods used today in the light of this variance. We show a counter-intuitive result that adding more sources of variation to an imperfect estimator approaches better the ideal estimator at a 51 times reduction in compute cost. Building on these results, we study the error rate of detecting improvements, on five different deep-learning tasks/architectures. This study leads us to propose recommendations for performance comparisons.},
archivePrefix = {arXiv},
arxivId = {2103.03098},
author = {Bouthillier, <NAME>, <NAME> <NAME>, Justin and <NAME> and <NAME> and Madan, Kanika and <NAME> and <NAME> and Serdyuk, Dmitriy and <NAME> and Pal, Chris and Varoquaux, Ga{\"{e}}l and <NAME>},
booktitle = {Machine Learning and Systems (MLSys)},
eprint = {2103.03098},
title = {{Accounting for Variance in Machine Learning Benchmarks}},
url = {http://arxiv.org/abs/2103.03098},
pdf = {http://arxiv.org/pdf/2103.03098},
year = {2021}
}
@inproceedings{Raff2021,
abstract = {K-Means++ and its distributed variant K-Means‖ have become de facto tools for selecting the initialseeds of K-means. While alternatives have been developed, the effectiveness, ease of implementation, and theoretical grounding of the K-means++ and ‖ methods have made them difficult to “best” from a holistic perspective. By considering the limited opportunities within seed selection to perform pruning, we develop specialized triangle inequalitypruning strategies and a dynamic priority queue to show the first acceleration of K-Means++ and K-Means‖ that is faster in run-time while being algorithmicly equivalent. For both algorithms we are able to reduce distance computations by over500×. For K-means++ this results in up to a 17×speedup in run-time and a 551× speedup for K-means‖. We achieve this with simple, but carefully chosen, modifications to known techniques which makes it easy to integrate our approach into existing implementations of these algorithms},
author = {<NAME>},
booktitle = {30th International Joint Conference on Artificial Intelligence (IJCAI-21)},
title = {{Exact Acceleration of K-Means ++ and K-Means}},
url = {https://arxiv.org/abs/2105.02936},
pdf = {https://arxiv.org/pdf/2105.02936},
year = {2021}
}
@inproceedings{Ordun2021,
abstract = {Thermal images reveal medically important physiological information about human stress, signs of inflammation, and emotional mood that cannot be seen on visible images. Providing a method to generate thermal faces from visible images would be highly valuable for the telemedicine community in order to show this medical information. To the best of our knowledge, there are limited works on visible-to-thermal (VT) face translation, and many current works go the opposite direction to generate visible faces from thermal surveillance images (TV) for law enforcement applications. As a result, we introduce favtGAN, a VT GAN which uses the pix2pix image translation model with an auxiliary sensor label prediction network for generating thermal faces from visible images. Since most TV methods are trained on only one data source drawn from one thermal sensor, we combine datasets from faces and cityscapes. These combined data are captured from similar sensors in order to bootstrap the training and transfer learning task, especially valuable because visible-thermal face datasets are limited. Experiments on these combined datasets show that favtGAN demonstrates an increase in SSIM and PSNR scores of generated thermal faces, compared to training on a single face dataset alone.},
archivePrefix = {arXiv},
arxivId = {2106.08091},
author = {<NAME> and <NAME> and <NAME>},
booktitle = {ICIP},
eprint = {2106.08091},
title = {{Generating Thermal Human Faces for Physiological Assessment Using Thermal Sensor Auxiliary Labels}},
url = {http://arxiv.org/abs/2106.08091},
year = {2021}
}
@inproceedings{Nguyen2021,
abstract = {The detection of malware is a critical task for the protection of computing environments. This task often requires extremely low false positive rates (FPR) of 0.01{\%} or even lower, for which modern machine learning has no readily available tools. We introduce the first broad investigation of the use of uncertainty for malware detection across multiple datasets, models, and feature types. We show how ensembling and Bayesian treatments of machine learning methods for static malware detection allow for improved identification of model errors, uncovering of new malware families, and predictive performance under extreme false positive constraints. In particular, we improve the true positive rate (TPR) at an actual realized FPR of 1e-5 from an expected 0.69 for previous methods to 0.80 on the best performing model class on the Sophos industry scale dataset. We additionally demonstrate how previous works have used an evaluation protocol that can lead to misleading results.},
archivePrefix = {arXiv},
arxivId = {2108.04081},
author = {<NAME>. and <NAME> and <NAME> and <NAME>},
booktitle = {IJCAI-21 1st International Workshop on Adaptive Cyber Defense},
eprint = {2108.04081},
file = {:Users/eman7613/Downloads/2108.04081.pdf:pdf},
title = {{Leveraging Uncertainty for Improved Static Malware Detection Under Extreme False Positive Constraints}},
url = {http://arxiv.org/abs/2108.04081},
year = {2021}
}
