Multiview Physician-Specific Attributes Fusion for Health Seeking

The Promises and Possibilities of Artificial Intelligence in the Delivery of Behavior Analytic Services

Artificial intelligence (AI) has begun to affect nearly every aspect of our daily lives and nearly every industry and profession. Many readers of this journal likely work in one or more areas of behavioral health. For readers who work in behavioral health and who are interested in AI, the purpose of this article is to highlight the pervasiveness of AI research being conducted around many facets of behavioral health service delivery. To do this, we first provide a brief overview of some of the areas within AI and the types of problems each area of AI attempts to solve. We then outline the prototypical client journey in behavioral healthcare beginning with diagnosis/assessment and ending with intervention withdrawal or ongoing monitoring. Next, for each stage in the client journey, we highlight several areas that parallel existing behavior analytic practice where researchers have begun to use AI, often to improve the efficiency of service delivery or to learn new things that improve the effectiveness of behavioral health services. Finally, for those whose appetite has been whet for getting involved with AI, we close by describing three roles they might consider trying out and that parallel the three main domains of behavior analysis. These three roles are an AI tool designer (akin to EAB), AI tool implementer (akin to ABA), or AI tool supporter (akin to practice).

Self-weighted Robust LDA for Multiclass Classification with Edge Classes

Linear discriminant analysis (LDA) is a popular technique to learn the most discriminative features for multi-class classification. A vast majority of existing LDA algorithms are prone to be dominated by the class with very large deviation from the others, i.e., edge class, which occurs frequently in multi-class classification. First, the existence of edge classes often makes the total mean biased in the calculation of between-class scatter matrix. Second, the exploitation of ℓ 2 -norm based between-class distance criterion magnifies the extremely large distance corresponding to edge class. In this regard, a novel self-weighted robust LDA with ℓ 2,1 -norm based pairwise between-class distance criterion, called SWRLDA, is proposed for multi-class classification especially with edge classes. SWRLDA can automatically avoid the optimal mean calculation and simultaneously learn adaptive weights for each class pair without setting any additional parameter. An efficient re-weighted algorithm is exploited to derive the global optimum of the challenging ℓ 2,1 -norm maximization problem. The proposed SWRLDA is easy to implement and converges fast in practice. Extensive experiments demonstrate that SWRLDA performs favorably against other compared methods on both synthetic and real-world datasets while presenting superior computational efficiency in comparison with other techniques.

Multiview Semantic Representation for Visual Recognition

Due to interclass and intraclass variations, the images of different classes are often cluttered which makes it hard for efficient classifications. The use of discriminative classification algorithms helps to alleviate this problem. However, it is still an open problem to accurately model the relationships between visual representations and human perception. To alleviate these problems, in this paper, we propose a novel multiview semantic representation (MVSR) algorithm for efficient visual recognition. First, we leverage visually based methods to get initial image representations. We then use both visual and semantic similarities to divide images into groups which are then used for semantic representations. We treat different image representation strategies, partition methods, and numbers as different views. A graph is then used to combine the discriminative power of different views. The similarities between images can be obtained by measuring the similarities of graphs. Finally, we train classifiers to predict the categories of images. We evaluate the discriminative power of the proposed MVSR method for visual recognition on several public image datasets. Experimental results show the effectiveness of the proposed method.

Multiview, Few-Labeled Object Categorization by Predicting Labels With View Consistency

The categorization accuracies of objects have been greatly improved in recent years. However, large quantities of labeled images are needed. many methods fail when only few labeled images are available. To tackle the few-labeled object categorization problem, we need to represent and classify them from multiple views. In this paper, we propose a novel multiview, few-labeled object categorization algorithm by predicting the labels of images with view consistency (MVFL-VC). We use labeled images along with other unlabeled images in a unified framework. A mapping function is learned to model the correlations of images with their labels. Since there are no labeling information for unlabeled images, we simultaneously learn the mapping function and image labels by classification error minimization. We make use of multiview information for joint object categorization. Although different views represent different aspects of images, for one image, the predicted categories of multiple views should be consistent with each other. We learn the mapping function by minimizing the summed classification losses along with the discrepancy of predicted labels between different views in an alternative way. We conduct object categorization experiments on five public image datasets and compare with other semi-supervised methods. Experimental results well demonstrate the effectiveness of the proposed MVFL-VC method.

Multi-View Image Classification With Visual, Semantic And View Consistency

Multi-view visual classification methods have been widely applied to use discriminative information of different views. This strategy has been proven very effective by many researchers. On the one hand, images are often treated independently without fully considering their visual and semantic correlations. On the other hand, view consistency is often ignored. To solve these problems, in this paper, we propose a novel multi-view image classification method with visual, semantic and view consistency (VSVC). For each image, we linearly combine multi-view information for image classification. The combination parameters are determined by considering both the classification loss and the visual, semantic and view consistency. Visual consistency is imposed by ensuring that visually similar images of the same view are predicted to have similar values. For semantic consistency, we impose the locality constraint that nearby images should be predicted to have the same class by multiview combination. View consistency is also used to ensure that similar images have consistent multi-view combination parameters. An alternative optimization strategy is used to learn the combination parameters. To evaluate the effectiveness of VSVC, we perform image classification experiments on several public datasets. The experimental results on these datasets show the effectiveness of the proposed VSVC method.

Locally Weighted Fusion of Structural and Attribute Information in Graph Clustering

Attributed graphs have attracted much attention in recent years. Different from conventional graphs, attributed graphs involve two different types of heterogeneous information, i.e., structural information, which represents the links between the nodes, and attribute information on each of the nodes. Clustering on attributed graphs usually requires the fusion of both types of information in order to identify meaningful clusters. However, most of existing works implement the combination of these two types of information in a "global" manner by treating all nodes equally and learning a global weight for the information fusion. To address this issue, this paper proposed a novel weighted K -means algorithm with "local" learning for attributed graph clustering, called adaptive fusion of structural and attribute information (Adapt-SA) and analyzed the convergence property of the algorithm. The key advantage of this model is to automatically balance the structural connections and attribute information of each node to learn a fusion weight, and get densely connected clusters with high attribute semantic similarity. Experimental study of weights on both synthetic and real-world data sets showed that the weights learned by Adapt-SA were reasonable, and they reflected which one of these two types of information was more important to decide the membership of a node. We also compared Adapt-SA with the state-of-the-art algorithms on the real-world networks with varieties of characteristics. The experimental results demonstrated that our method outperformed the other algorithms in partitioning an attributed graph into a community structure or other general structures.