Alexander A. Balinsky

Prof. Alexander A. Balinsky

orcid

Research Focus & Metrics

Academic Career Length

28Years (1999-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2001 in Journal of Functional Analysis
Verified
Journal Article
Closed access
PDF file
ABAlexander A. Balinsky
Alexander A. Balinsky
WEW.D Evans
W.D Evans

1 August 2004 in Journal of Statistical Physics
Verified
Journal Article
Closed access
PDF file
ABAlexander A. Balinsky
Alexander A. Balinsky
ALAri Laptev
Ari Laptev
ASAlexander V. Sobolev
Alexander V. Sobolev

31 October 2019 in JMIR Medical Informatics
Verified
Journal Article
Open access
Irena SpasicIrena Spasic
Irena Spasic
DKDominik Krzeminski
Dominik Krzeminski
PCPadraig Corcoran
Padraig Corcoran
ABAlexander A. Balinsky
Alexander A. Balinsky
Background: Clinical trials are an important step in introducing new interventions into clinical practice by generating data on their safety and efficacy. Clinical trials need to ensure that participants are similar so that the findings can be attributed to the interventions studied and not to some other factors. Therefore, each clinical trial defines eligibility criteria, which describe characteristics that must be shared by the participants. Unfortunately, the complexities of eligibility criteria may not allow them to be translated directly into readily executable database queries. Instead, they may require careful analysis of the narrative sections of medical records. Manual screening of medical records is time consuming, thus negatively affecting the timeliness of the recruitment process. Objective: Track 1 of the 2018 National Natural Language Processing Clinical Challenge focused on the task of cohort selection for clinical trials, aiming to answer the following question: Can natural language processing be applied to narrative medical records to identify patients who meet eligibility criteria for clinical trials? The task required the participating systems to analyze longitudinal patient records to determine if the corresponding patients met the given eligibility criteria. We aimed to describe a system developed to address this task. Methods: Our system consisted of 13 classifiers, one for each eligibility criterion. All classifiers used a bag-of-words document representation model. To prevent the loss of relevant contextual information associated with such representation, a pattern-matching approach was used to extract context-sensitive features. They were embedded back into the text as lexically distinguishable tokens, which were consequently featured in the bag-of-words representation. Supervised machine learning was chosen wherever a sufficient number of both positive and negative instances was available to learn from. A rule-based approach focusing on a small set of relevant features was chosen for the remaining criteria. Results: The system was evaluated using microaveraged F measure. Overall, 4 machine algorithms, including support vector machine, logistic regression, naïve Bayesian classifier, and gradient tree boosting (GTB), were evaluated on the training data using 10–fold cross-validation. Overall, GTB demonstrated the most consistent performance. Its performance peaked when oversampling was used to balance the training data. The final evaluation was performed on previously unseen test data. On average, the F measure of 89.04% was comparable to 3 of the top ranked performances in the shared task (91.11%, 90.28%, and 90.21%). With an F measure of 88.14%, we significantly outperformed these systems (81.03%, 78.50%, and 70.81%) in identifying patients with advanced coronary artery disease. Conclusions: The holdout evaluation provides evidence that our system was able to identify eligible patients for the given clinical trial with high accuracy. Our approach demonstrates how rule-based knowledge infusion can improve the performance of machine learning algorithms even when trained on a relatively small dataset.

1 April 1999 in Communications in Mathematical Physics
Verified
Journal Article
Closed access
PDF file
ABAlexander A. Balinsky
Alexander A. Balinsky
WEW. D. Evans
W. D. Evans

1 October 2011
Verified
Conference Paper
Closed access
HBHelen Balinsky
Helen Balinsky
ABAlexander A. Balinsky
Alexander A. Balinsky
SSSteven Simske
Steven Simske
In this paper we describe the possibility of constructing the well-known small world topology for an ordinary document, based on the actual document structure. Sentences in such a graph are represented by nodes, which are connected if and only if the corresponding sentences are neighbors or share at least one common keyword. This graph is built using a carefully selected one-parameter set of keywords. By varying this parameter - the level of meaningfulness - we transition the document-representing graph from a trivial path graph into a large random graph. During such a conversion, as the parameter is varied over its range, the graph becomes a small world. This in turn opens the possibility of applying many well-established ranking algorithms to the problem of ranking sentences and paragraphs in text documents. These rankings are, in turn, crucial for document understanding, summarization and information extraction. These graphs can also serve as a source of interesting small world graphs for the theory of complex networks.

25 January 2001 in Journal of Physics A: General Physics
Verified
Journal Article
Closed access
PDF file
ABAlexander A. Balinsky
Alexander A. Balinsky
WEW D Evans
W D Evans
RLRoger T Lewis
Roger T Lewis
In a previous article, the first two authors have proved that the existence of zero modes of Pauli operators is a rare phenomenon; inter alia, it is proved that for |B|L3/2(3), the set of magnetic fields B which do not yield zero modes contains an open dense subset of [L3/2(3)]3. Here the analysis is taken further, and it is shown that Sobolev, Hardy and Cwikel-Lieb-Rosenbljum (CLR) inequalities hold for Pauli operators for all magnetic fields in the aforementioned open dense set.