Search

Research paper recommenders emerged over the last decade to ease finding publications relating to researchers’ area of interest. The challenge was not just to provide researchers with very rich publications at any time, any place and in any form but to also offer the right publication to the right researcher in the right way. Several approaches exist in handling paper recommender systems. However, these approaches assumed the availability of the whole contents of the recommending papers to be freely accessible, which is not always true due to factors such as copyright restrictions. This paper presents a collaborative approach for research paper recommender system. By leveraging the advantages of collaborative filtering approach, we utilize the publicly available contextual metadata to infer the hidden associations that exist between research papers in order to personalize recommendations. The novelty of our proposed approach is that it provides personalized recommendations regardless of the research field and regardless of the user’s expertise. Using a publicly available dataset, our proposed approach has recorded a significant improvement over other baseline methods in measuring both the overall performance and the ability to return relevant and useful publications at the top of the recommendation list. [ABSTRACT FROM AUTHOR]

With the rapid development of remote sensing technology, remote sensing products have found increasingly widespread applications across various fields. Nevertheless, as the volume of remote sensing image data continues to grow, traditional data retrieval techniques have encountered several challenges such as substantial query results, data overlap, and variations in data quality. Users need to manually browse and filter a large number of remote sensing datasets, which is a cumbersome and inefficient process. In order to cope with these problems of traditional remote sensing image retrieval methods, this paper proposes a remote sensing image retrieval algorithm for dense data (DD-RSIRA). The algorithm establishes evaluation metrics based on factors like imaging time, cloud coverage, and image coverage. The algorithm utilizes the global grids to create an ensemble coverage relation between images and grids. A locally optimal initial solution is obtained by a greedy algorithm, and then a local search is performed to search for the optimal solution by combining the strategies of weighted gain-loss scheme and novel mechanism. Ultimately, it achieves an optimal coverage of remote sensing images within the region of interest. In this paper, it is shown that the method obtains a smaller number of datasets with lower redundancy and higher data utilization and ensures the data quality to a certain extent in order to accurately meet the requirements of the regional coverage of remote sensing images. [ABSTRACT FROM AUTHOR]

The introduction of ChatGPT 3.5 in November 2022 ignited a sensation in the academic community, leaving many astounded by its capabilities. This new release more closely emulates human responses than its predecessors. Among its remarkable capabilities, it can answer questions, catalog items in MARC21, recommend reading lists, and make suggestions on a wide array of topics. To assess ChatGPT’s efficacy in aiding library users, the authors of this paper conducted an experiment comparing ChatGPT’s performance with that of librarians in answering reference questions. Thirty questions were randomly selected from the transaction log of the reference inquiries between June 1, 2023 to July 31, 2023 at the Rider University Libraries. These queries constituted 34% of the total user questions during this two-month period. The authors compared the answers by ChatGPT and those by reference librarians for their accuracy, relevance, and friendliness. The findings indicate that reference librarians markedly outperformed their robotic counterpart. An evident issue arises from ChatGPT’s deficiency in understanding local policies and practices. This consequently hinders its ability to provide satisfactory answers in those areas. OpenAI posits that ChatGPT’s proficiency can be enhanced through targeted fine-tuning using locally specific information. At the moment, ChatGPT remains a great tool for librarians. [ABSTRACT FROM AUTHOR]

Zero frequency is a fundamental problem in information retrieval using language models and smoothing is applied to deal with this problem. The cluster-based smoothing method is found to be effective for information retrieval using language models. Since the effectiveness of cluster-based smoothing depends on clustering quality, there is scope for improvement by enhancing the clustering algorithm. In this paper, we present a study on how to improve cluster-based smoothing using a histogram-based incremental clustering algorithm and word embeddings. To our knowledge, this is the first study on the cluster-based smoothing method which is integrated with a language model for developing an effective IR system for the Bengali language which is one of the most spoken Indian languages. The proposed method has been tested on two benchmark Bengali IR datasets. The experimental results show that our proposed model for Bengali document retrieval is effective and it outperforms several baseline IR models. [ABSTRACT FROM AUTHOR]

Modern information retrieval systems use keywords within documents as indexing terms for search of relevant documents. As Chinese is an ideographic character-based language, the words in the texts are not delimited by white spaces. Indexing of Chinese documents is impossible without a proper segmentation algorithm. Many Chinese segmentation algorithms have been proposed in the past. Traditional segmentation algorithms cannot operate without a large dictionary or a large corpus of training data. Nowadays, the Web has become the largest corpus that is ideal for Chinese segmentation. Although most search engines have problems in segmenting texts into proper words, they maintain huge databases of documents and frequencies of character sequences in the documents. Their databases are important potential resources for segmentation. In this paper, we propose a segmentation algorithm by mining Web data with the help of search engines. On the other hand, the Romanized pinyin of Chinese language indicates boundaries of words in the text. Our algorithm is the first to utilize the Romanized pinyin to segmentation. It is the first unified segmentation algorithm for the Chinese language from different geographical areas, and it is also domain independent because of the nature of the Web. Experiments have been conducted on the datasets of a recent Chinese segmentation competition. The results show that our algorithm outperforms the traditional algorithms in terms of precision and recall. Moreover, our algorithm can effectively deal with the problems of segmentation ambiguity, new word (unknown word) detection, and stop words. [ABSTRACT FROM AUTHOR]

Objectives: Federal open-data initiatives that promote increased sharing of federally collected data are important for transparency, data quality, trust, and relationships with the public and state, tribal, local, and territorial partners. These initiatives advance understanding of health conditions and diseases by providing data to researchers, scientists, and policymakers for analysis, collaboration, and use outside the Centers for Disease Control and Prevention (CDC), particularly for emerging conditions such as COVID-19, for which data needs are constantly evolving. Since the beginning of the pandemic, CDC has collected person-level, de-identified data from jurisdictions and currently has more than 8 million records. We describe how CDC designed and produces 2 de-identified public datasets from these collected data. Methods: We included data elements based on usefulness, public request, and privacy implications; we suppressed some field values to reduce the risk of re-identification and exposure of confidential information. We created datasets and verified them for privacy and confidentiality by using data management platform analytic tools and R scripts. Results: Unrestricted data are available to the public through Data.CDC.gov, and restricted data, with additional fields, are available with a data-use agreement through a private repository on GitHub.com. Practice Implications: Enriched understanding of the available public data, the methods used to create these data, and the algorithms used to protect the privacy of de-identified people allow for improved data use. Automating data-generation procedures improves the volume and timeliness of sharing data. [ABSTRACT FROM AUTHOR]

Traditional Chinese medicine (TCM) is a summary of the diagnosis and treatment experience formed by the working people in the long-term struggle against diseases, so it is very important to protect the intangible cultural heritage of TCM. How to extract valuable knowledge accurately and conveniently from the massive medical records of TCM is one of the important issues in the current research on the development of TCM. Due to the large amount of data of TCM medical records, many feature attributes, and diverse patterns, the existing classification technology has high computational complexity, low mining efficiency, and poor universality. Therefore, this paper proposed to quantify the medical records of TCM and obtained the main symptoms according to the improved hierarchical clustering feature selection algorithm. This paper also proposed a support vector machine (SVM) classification method using improved particle swarm algorithm to classify TCM information, which not only improves the efficiency and accuracy of TCM information classification but also discovers the potential dialectical and symptom patterns in diagnosis and treatment, so that the intangible cultural heritage protection of TCM can be developed sustainably. This paper showed that the information acquisition accuracy of the improved algorithm was very high. Before the improved algorithm was used, the accuracy of information mining for TCM was 67.90% at the highest and 65.53% at the lowest, but after using the improved algorithm, the accuracy rate of information mining for TCM was 88.02% at the highest and 82.45% at the lowest. It can be seen that using the improved algorithm to mine TCM information can quickly process effective information. [ABSTRACT FROM AUTHOR]

The retrieval of important information from a dataset requires applying a special data mining technique known as data clustering (DC). DC classifies similar objects into a groups of similar characteristics. Clustering involves grouping the data around k-cluster centres that typically are selected randomly. Recently, the issues behind DC have called for a search for an alternative solution. Recently, a nature-based optimization algorithm named Black Hole Algorithm (BHA) was developed to address the several well-known optimization problems. The BHA is a metaheuristic (population-based) that mimics the event around the natural phenomena of black holes, whereby an individual star represents the potential solutions revolving around the solution space. The original BHA algorithm showed better performance compared to other algorithms when applied to a benchmark dataset, despite its poor exploration capability. Hence, this paper presents a multi-population version of BHA as a generalization of the BHA called MBHA wherein the performance of the algorithm is not dependent on the best-found solution but a set of generated best solutions. The method formulated was subjected to testing using a set of nine widespread and popular benchmark test functions. The ensuing experimental outcomes indicated the highly precise results generated by the method compared to BHA and comparable algorithms in the study, as well as excellent robustness. Furthermore, the proposed MBHA achieved a high rate of convergence on six real datasets (collected from the UCL machine learning lab), making it suitable for DC problems. Lastly, the evaluations conclusively indicated the appropriateness of the proposed algorithm to resolve DC issues. [ABSTRACT FROM AUTHOR]

Main path analysis is a popular method for extracting the scientific backbone from the citation network of a research domain. Existing approaches ignored the semantic relationships between the citing and cited publications, resulting in several adverse issues, in terms of coherence of main paths and coverage of significant studies. This paper advocated the semantic main path network analysis approach to alleviate these issues based on citation function analysis. A wide variety of SciBERT‐based deep learning models were designed for identifying citation functions. Semantic citation networks were built by either including important citations, for example, extension, motivation, usage and similarity, or excluding incidental citations like background and future work. Semantic main path network was built by merging the top‐K main paths extracted from various time slices of semantic citation network. In addition, a three‐way framework was proposed for the quantitative evaluation of main path analysis results. Both qualitative and quantitative analysis on three research areas of computational linguistics demonstrated that, compared to semantics‐agnostic counterparts, different types of semantic main path networks provide complementary views of scientific knowledge flows. Combining them together, we obtained a more precise and comprehensive picture of domain evolution and uncover more coherent development pathways between scientific ideas. [ABSTRACT FROM AUTHOR]

Objectives: In order to improve the calculation efficiency of linear octree neighbor grid elements, this paper uses Hilbert code to mark the grid elements and proposes a fast calculation algorithm for neighbor grid elements Hilbert code. Methods: Based on the Hilbert primitive curve, the concept of state vector is introduced to record the filling order of the Hilbert curve to all child elements belonging to the same parent element, thereby establishing the hierarchical evolution and degradation function of the state vector. With the hierarchical mapping relationship in the order curve, the state vector and its hierarchical evolution function are finally used to calculate the neighboring grid element Hilbert code. Results: The results of comparison experiments on calculation accuracy and efficiency show that the calculation result of the algorithm is correct. The calculation speed of the state vector decreases with the increase of the level. The calculation of 4 201 grid elements can be completed within 1 ms on the 20th level. In the calculation of the same number of neighbor grid elements at the specified level, the speed of this algorithm is significantly better than the existing Morton code conversion algorithm. At the 15th level, the speed of the algorithm in this paper is about 2.1-2.4 times that of the existing Morton code conversion algorithm. In the calculation of millions of adjacent cells at different levels, the calculation speed of the algorithm in this paper is compared with the existing Morton code conversion. The improvement factor of the algorithm increases as the level increases. At level 20, the efficiency of the proposed algorithm increases by 2.6 times. Conclusions: Experimental results show that this algorithm is superior to the existing Morton code conversion algorithm, and can be used as the basis of spatial operations such as efficient data retrieval, determination of three-dimensional topological relationship and connectivity judgment. [ABSTRACT FROM AUTHOR]

Currently, the majority of retrieval-based question-answering systems depend on supervised training using question pairs. However, there is still a significant need for further exploration of how to employ unsupervised methods to improve the accuracy of retrieval-based question-answering systems. From the perspective of question topic keywords, this paper presents TFCSG, an unsupervised question-retrieval approach based on topic keyword filtering and multi-task learning. Firstly, we design the topic keyword filtering algorithm, which, unlike the topic model, can sequentially filter out the keywords of the question and can provide a training corpus for subsequent unsupervised learning. Then, three tasks are designed in this paper to complete the training of the question-retrieval model. The first task is a question contrastive learning task based on topic keywords repetition strategy, the second is questions and its corresponding sequential topic keywords similarity distribution task, and the third is a sequential topic keywords generation task using questions. These three tasks are trained in parallel in order to obtain quality question representations and thus improve the accuracy of question-retrieval task. Finally, our experimental results on the four publicly available datasets demonstrate the effectiveness of the TFCSG, with an average improvement of 7.1%, 4.4%, and 3.5% in the P@1, MAP, and MRR metrics when using the BERT model compared to the baseline model. The corresponding metrics improved by 5.7%, 3.5% and 3.0% on average when using the RoBERTa model. The accuracy of unsupervised similar question-retrieval task is effectively improved. In particular, the values of P@1, P@5, and P@10 are close, the retrieved similar questions are ranked more advance. [ABSTRACT FROM AUTHOR]

In the era of rapid paper publications in various venues, automatic citation recommendations would be highly useful to researchers when they write papers. Local citation recommendation aims to recommend possible papers to cite given local citation contexts. Previous work mainly computes the similarity score between citation contexts and cited papers on a one-to-one basis, which is quite time-consuming. We train a pair of neural network encoders that map citation contexts and all possible cited papers to the same vector space, respectively. After that, we index the positions of all cited papers in the vector space. This makes our process for searching recommended papers considerably faster. On the other hand, existing methods tend to recommend papers that are highly similar to each other, which makes recommendations lack diversity. Therefore, we extend our algorithm to perform multi-topic recommendations. We generate multi-topic training examples based on the index we mentioned earlier. Furthermore, we specially design a multi-group contrastive learning method to train our model so that it can distinguish different topics. Empirical experiments show that our model outperforms previous methods by a wide margin. Our model is also light weighted and has been deployed online so that researchers can use it to obtain recommended citations for their own paper in real-time. • Proposed FLCR algorithm with sentence-transformer & k-d tree. • Introduced multi-topic citation recommendation for diverse contexts. • Developed large-scale dataset with 1.7 million citation contexts for evaluation. • Demonstrated significant performance improvement over previous methods. • Deployed demo for real-time citation recommendations. [ABSTRACT FROM AUTHOR]

Text document clustering is one of the data mining techniques used in many real-world applications such as information retrieval from IoT Sensors data, duplicate content detection, and document organization. Swarm intelligence (SI) algorithms are suitable for solving complex text document clustering problems compared to traditional clustering algorithms. The previous studies show that in SI algorithms, particle swarm optimization (PSO) provides an effective solution to text document clustering problems. This PSO still needs to be improved to avoid the problems such as premature convergence to local optima. In this paper, an approach called dynamic sub-swarm of PSO (subswarm-PSO) is proposed to improve the results of PSO for text document clustering problems and avoid the local optimum by improving the global search capabilities of PSO. The results of this proposed approach were compared with the standard PSO algorithm and K-means algorithm. As for performance assurance, the evaluation metric purity is used with six benchmark data sets. The experimental results of this study show that our proposed subswarm-PSO algorithm performs best with high purity comparing the standard PSO and K-means traditional algorithms and also the execution time of subswarm-PSO comparatively takes a little less than the standard PSO algorithm. [ABSTRACT FROM AUTHOR]

In today's design — manufacturing context, designers often modify existing 3D shapes (or design models) instead of creating a new design from scratch. This requires the ability to search an existing database of designs/3D models to identify and extract similar designs. Shape Retrieval Tools (SRTs) have been developed to provide an essential role in saving time and effort to retrieve and generate new designs. The capabilities of commercially available SRTs vary based on the form of the input design model, the search technique or algorithm used, the search/retrieval time, ease of use, and the quality of results. The focus of this paper is to study of their capabilities, performances, and differences and develop criteria to compare the effectiveness and performance of such Shape Retrieval Tools. Current search evaluation methods, such as precision and recall, are based on human interpretation of the results. This paper presents a holistic set of metrics for comparing the performance and effectiveness of SRTs, including data input options (to search), effectiveness of the search process, the associated retrieval time, overall ease of use, and additional data retrieval details. An algorithm is proposed to objectively analyze the search results based on the proposed Model Match Ratio (MMR), computed by the variance between the input and retrieved geometries. The search results are usually presented in a rank order list. A Precision Sequence Metric (PSM) is developed to evaluate the retrieved list by ranking the retrieved results based on the MMR for evaluating the quality of the search. The proposed evaluation algorithm was tested on several design models (and their subsequent retrieval results) involving three SRTs (Vizseek, Geolus, and CADENAS); the results of the comparison of the performance of these SRTs are discussed in this paper. [ABSTRACT FROM AUTHOR]

A spectral power-based real-time BCI neuro-feedback (decision machine) system has been proposed in this paper. It is used to reflect the intended task of the movement imagination of hand movements. As a consequence of the cost-effective and greater temporal resolution, the proposed decision machine considered the electroencephalogram (EEG) signal. EEG data modeling is therefore an important step in seeking a rational solution for a specific application. The most potential temporal relative spectral power (TRSP) based feature extraction algorithm, and probabilistic Bayesian classifier has been used to model the EEG data for the reproduction of the thoughts. In this paper, the author has considered two channels of information for command generation. This paper also focuses on the maximization of information retrieval by analyzing incoming two channels' brain signals. This initiates to devise an appropriate reactive frequency band for each subject before applying the feature extraction algorithm. In this direction, this paper uses relative power spectral intensity (RPSI) for reactive frequency band estimation. The spectral power-based feature extraction method is responsible for the improvement of the accuracy, reducing the computational complexity, lowers the computational time, and improves the information transfer rate. The performance of the proposed BCI system shows better results compared to the different well established conventional EEG based BCI systems. The proposed real-time neuro-feedback system is a generalized BCI system that will be readily applicable for controlling any external devices. The proposed system shows 90.37% accuracy over the BCI Competition II dataset and 81% average accuracy with 64 ms computational time in the real-time application. [ABSTRACT FROM AUTHOR]

This paper reviews a large number of research achievements relevant to user privacy protection in an untrusted network environment, and then analyzes and evaluates their application limitations in personalized information retrieval, to establish the conditional constraints that an effective approach for user preference privacy protection in personalized information retrieval should meet, thus providing a basic reference for the solution of this problem. First, based on the basic framework of a personalized information retrieval platform, we establish a complete set of constraints for user preference privacy protection in terms of security, usability, efficiency, and accuracy. Then, we comprehensively review the technical features for all kinds of popular methods for user privacy protection, and analyze their application limitations in personalized information retrieval, according to the constraints of preference privacy protection. The results show that personalized information retrieval has higher requirements for users' privacy protection, i.e., it is required to comprehensively improve the security of users' preference privacy on the untrusted server-side, under the precondition of not changing the platform, algorithm, efficiency, and accuracy of personalized information retrieval. However, all kinds of existing privacy methods still cannot meet the above requirements. This paper is an important study attempt to the problem of user preference privacy protection of personalized information retrieval, which can provide a basic reference and direction for the further study of the problem. [ABSTRACT FROM AUTHOR]

The maintenance and sharing of electronic medical records are one of the essential tasks in the medical treatment combination. Traditional cloud-based electronic medical record storage system is difficult to realize data security sharing. The tamper resistance and traceability of blockchain technology provide the possibility for the sharing of highly sensitive medical data. This paper proposes a safe sharing scheme of stroke electronic medical records based on the consortium blockchain. The scheme adopts the storage method of ciphertext of medical records stored in the cloud and index of medical records stored on the blockchain. The privacy protection mechanism proposed in this paper innovatively combines proxy reencryption and searchable encryption which supports patient pseudoidentity search. The mechanism could achieve controllable sharing of medical records and precise search. According to the organizational characteristics of the stroke medical treatment combination, this paper proposes an improved Practical Byzantine Fault Tolerance mechanism to reach a consensus between consensus nodes. Then, the proposed scheme is analyzed and evaluated from three aspects of medical record integrity, user privacy, and data security. The results show that the scheme can not only ensure the privacy of patient identity information and private key data but also resist the tampering and deletion attacks of internal and external malicious nodes on the medical record data. Therefore, the proposed scheme is conducive to the improvement of the timeliness of stroke treatment and the safe sharing of electronic medical records in stroke medical treatment combination. [ABSTRACT FROM AUTHOR]

Data mining has become a relatively modern platform for information retrieval. The efficient data mining techniques can increase the reliability and accuracy of internal auditing for the various community even while lowering audit risk. Existing audit data mining approaches lack significant identification of hidden connections and interactions in bid data platforms. Hence, this study extends the literature survey on the signification of audit data mining in multiple applications. This survey identifies the scope of improved association algorithms in audit data mining, a rule-based machine learning approach to determine the exciting relationship among variables in large audit datasets. Therefore, a Conceptual Framework of Improved Association Algorithm (CFiAA) and its application in audit data mining is proposed. This study examines the strengths and weaknesses of the proposed CFiAA in audit mining. The proposed model has been trained using an audit data set and validates with various audit datasets. Finally, this paper presents the comparative analysis of the proposal to show its highest performance related to existing models. Thus, CFiAA scores the performance ratio of 94.5%, accuracy ratio of 92.4%, an efficiency ratio of 92.5%, F1 measure of 91.8%, error rate 32.5%, prediction ratio of 93.7%, and the precision ratio of 92.5% compared to existing models. [ABSTRACT FROM AUTHOR]

In this paper, we report on our investigation of human-AI collaboration for mind-mapping. We specifically focus on problem exploration in pre-conceptualization stages of early design. Our approach leverages the notion of query expansion--the process of refining a given search query for improving information retrieval. Assuming a mind-map as a network of nodes, we reformulate its construction process as a sequential interaction workflow wherein a human user and an intelligent agent take turns to add one node to the network at a time. Our contribution is the design, implementation, and evaluation of algorithm that powers the intelligent agent (IA). This paper is an extension of our prior work (Chen et al., 2019, "Mini-Map: Mixed-Initiative Mind-Mapping Via Contextual Query Expansion," AIAA Scitech 2020 Forum, p. 2347) wherein we developed this algorithm, dubbed Mini-Map, and implemented a web-based workflow enabled by ConceptNet (a large graph-based representation of "commonsense" knowledge). In this paper, we extend our prior work through a comprehensive comparison between human-AI collaboration and human-human collaboration for mind-mapping. We specifically extend our prior work by: (a) expanding on our previous quantitative analysis using established metrics and semantic studies, (b) presenting a new detailed video protocol analysis of the mind-mapping process, and (c) providing design implications for digital mind-mapping tools. [ABSTRACT FROM AUTHOR]

The World Wide Web(WWW) comprises a wide range of information, and it is mainly operated on the principles of keyword matching which often reduces accurate information retrieval. Automatic query expansion is one of the primary methods for information retrieval, and it handles the vocabulary mismatch problem often faced by the information retrieval systems to retrieve an appropriate document using the keywords. This paper proposed a novel approach of hybrid COOT-based Cat and Mouse Optimization (CMO) algorithm named as hybrid COOT-CMO for the appropriate selection of optimal candidate terms in the automatic query expansion process. To improve the accuracy of the Cat and Mouse Optimization (CMO) algorithm, the parameters are tuned with the help of the Coot algorithm. The best suitable expanded query is identified from the available expanded query sets also known as candidate query pools. All feasible combinations in this candidate query pool should be obtained from the top retrieved documents. Benchmark datasets such as the GOV2 Test Collection, the Cranfield Collections, and the NTCIR Test Collection are utilized to assess the performance of the proposed hybrid COOT-CMO method for automatic query expansion. This proposed method surpasses the existing state-of-the-art techniques using many performance measures such as F-score, precision, and mean average precision (MAP). [ABSTRACT FROM AUTHOR]

Clustering is a traditional data mining problem that has attracted researchers from different disciplines because its solution can be applied to many useful problems in our daily life. Since the era of big data is coming, how to "reduce the computing time" of an "effective clustering algorithm" has been a promising research issue in recent years. Thus, this paper presents an effective clustering algorithm, by using the so-called searched information to determine later search directions, and then has it implemented on Spark to accelerate its response time for analyzing large-scale datasets. Simulation results show that the proposed algorithm provides a better result than the other clustering algorithms compared in this paper because it is less sensitive to the initial solutions. The simulation results further show that cloud computing platform is capable of enhancing the performance of the proposed algorithm. • This study presents a high-performance clustering algorithm based on searched experiences. • The results show that it is able to find a better result than traditional clustering algorithms. • We apply it to Spark to show its possibility to accelerate the response time on a cloud system. [ABSTRACT FROM AUTHOR]

With the rapid development of satellite technology, the amount of remote sensing data and demand for remote sensing data analysis over large areas are greatly increasing. Hence, it is necessary to quickly filter out an optimal dataset from massive dataset to support various remote sensing applications. However, with the improvements in temporal and spatial resolution, remote sensing data have become fragmented, which brings challenges to data retrieval. At present, most data service platforms rely on the query engines to retrieve data. Retrieval results still have a large amount of data with a high degree of overlap, which must be manually selected for further processing. This process is very labour-intensive and time-consuming. This paper proposes an improved coverage-oriented retrieval algorithm that aims to retrieve an optimal image combination with the minimum number of images closest to the imaging time of interest while maximized covering the target area. The retrieval efficiency of this algorithm was analysed by applying different implementation practices: Arcpy, PyQGIS, and GeoPandas. The experimental results confirm the effectiveness of the algorithm and suggest that the GeoPandas-based approach is most advantageous when processing large-area data. [ABSTRACT FROM AUTHOR]

Big data (BD) is attaining major attention in the information field due to the eruption of data in the preceding decade. Philosophical techniques of "query optimization (QO)" have an essential function in data retrieval as of a BD environment. Numerous cloud-centered distributed data processing platforms were developed to render effective as well as lucrative solutions for BD query optimization. Nevertheless, most techniques brought about higher "energy consumptions (EC)" along with low accuracy level because of the lack of deliberation of energy issues as well as query characteristics, correspondingly. To tackle the issues of query optimization process, this paper proposes an "efficient query optimization (EQO)" utilizing σ ANFIS load balancer in addition to the CaM-BW optimizer. The proposed technique comprises '2′ phases: (1) BD arrangement and (2) QO. In the initial phase, the BD is arranged by utilizing preprocessing, feature extraction, together with clustering. The MCoV-FCM algorithm takes care of the clustering. In the second phase, the σ ANFIS load balancer in addition to the CaM-BW optimizer concentrates on disregarding the energy-efficient query plans and enhancing the general query processing performance. Lastly, numerical simulation outcomes are rendered to display the proposed method's effectiveness. [ABSTRACT FROM AUTHOR]

Emerging medical imaging applications in healthcare, the number and volume of medical images is growing dramatically. Information needs of users in such circumstances, either for clinical or research activities, make the role of powerful medical image search engines more significant. In this paper, a text-based multi-dimensional medical image indexing technique is proposed in which correlation of the features-usages (according to the user's queries) is considered to provide an off-the content indexing while taking users' interestingness into account. Assuming that each medical image has some extracted features (e.g., based on the DICOM standard), correlations of the features are discovered by performing data mining techniques (i.e., quantitative association pattern discovery), on the history of users' queries as a data set. Then, based on the pairwise correlation of the features of medical images (a.k.a. Affinity), set of the all features is fragmented into subsets (using method like the vertical fragmentation of the tables in distribution of relational DBs). After that, each of these subsets of the features turn into a hierarchy of the features (by applying a hierarchical clustering algorithm on that subset), subsequently all of these distinct hierarchies together make a multi-dimensional structure of the features of medical images, which is in fact the proposed text-based (feature-based) multi-dimensional index structure. Constructing and using such text-based multi-dimensional index structure via its specific required operations, medical image retrieval process would be improved in the underlying medical image search engine. Generally, an indexing technique is to provide a logical representation of documents in order to optimize the retrieval process. The proposed indexing technique is designed such that can improve retrieval of medical images in a medical image search engine in terms of its effectiveness and efficiency. Considering correlation of the features of the image would semantically improve precision (effectiveness) of the retrieval process, while traversing them through the hierarchy in one dimension would try to optimize (i.e., minimize) the resources to have a better efficiency. The proposed text-based multi-dimensional indexing technique is implemented using the open source search engine Lucene, and compared with the built-in indexing technique available in the Lucene search engine, and also with the Terrier platform (available for the benchmarking of information retrieval systems) and other the most related indexing techniques. Evaluation results of memory usage and time complexity analysis, beside the experimental evaluations efficiency and effectiveness measures show that the proposed multi-dimensional indexing technique significantly improves both efficiency and effectiveness for a medical image search engine. [ABSTRACT FROM AUTHOR]

This work focuses on document fragments association using deep metric learning methods. More precisely, we are interested in ancient papyri fragments that need to be reconstructed prior to their analysis by papyrologists. This is a challenging task to automatize using machine learning algorithms because labeled data is rare, often incomplete, imbalanced and of inconsistent conservation states. However, there is a real need for such software in the papyrology community as the process of reconstructing the papyri by hand is extremely time-consuming and tedious. In this paper, we explore ways in which papyrologists can obtain useful matching suggestion on new data using Deep Convolutional Siamese-Networks. We emphasize on low-to-no human intervention for annotating images. We show that the from-scratchself-supervised approach we propose is more effective than using knowledge transfer from a large dataset, the former achieving a top-1 accuracy score of 0.73 on a retrieval task involving 800 fragments. [ABSTRACT FROM AUTHOR]

Data retrieval in Named Data Networking (NDN) is based on content names irrespective of their hosting location. The NDN architecture introduces original naming, forwarding and caching techniques to improve data delivery efficiency. These distinctive techniques make the TCP congestion control scheme not suitable for the NDN architecture. In particular, the in-network caching and the multi-path forwarding used in the NDN architecture lead to fluctuations in the Round Trip Time (RTT) measurements. This makes the Retransmission TimeOut (RTO) an unreliable congestion indicator. Thus, the congestion problem in Named Data Networks deserves to be reconsidered. In this paper, we present a new congestion control algorithm, called IRNA (Interest Rate Notification and Adjustment), to mitigate the congestion problem in Named Data Networks while maintaining per flow and per consumer fairness property. More specifically, IRNA is a hop-by-hop scheme where each router monitors the occupation level of its outgoing queues to detect in advance potential congestion events. When the queue size is above or below a preset threshold, the router sends explicit notifications to its downstream nodes to specify the appropriate interest rate. Hence, by cooperatively adjusting the Interest transmission rate of each node and for each flow, IRNA succeeded to provide a fair transmission. We evaluated the performance of our solution using ndnSIM simulations. We compared IRNA to state-of-the-art hop-by-hop congestion control solution and we proved that IRNA managed to provide a faster congestion reaction and to achieve per flow and per consumer throughput fairness while maintaining a good bandwidth usage. [ABSTRACT FROM AUTHOR]

K-ary search tree is a promising structure due to its friendliness to cache awareness and SIMD acceleration. Recent years have witnessed its successful application to inverted index for efficient query processing and index compression. However, its query processing methods are either complicated or rudimentary, and its adoption is limited in membership test, which both impair its application in real life. This paper studied the intersection algorithm for k-ary search tree, and introduced two early termination techniques collaborating with particular traversal methods to improve its intersection efficiency. The experimental analyses validated the proposed optimizations could greatly improve the query speed, and the optimized k-ary search tree suits better for long inverted lists, and when equipped with larger SIMD registers, it is able to beat the state-of-the-art sorted-array based intersection algorithms. [ABSTRACT FROM AUTHOR]

Owing to scientific development, a variety of challenges present in the field of information retrieval. These challenges are because of the increased usage of large volumes of data. These huge amounts of data are presented from large-scale distributed networks. Centralization of these data to carry out analysis is tricky. There exists a requirement for novel text document clustering algorithms, which overcomes challenges in clustering. The two most important challenges in clustering are clustering accuracy and quality. For this reason, this paper intends to present an ideal clustering model for text document using term frequency–inverse document frequency, which is considered as feature sets. Here, the initial centroid selection is much concentrated which can automatically cluster the text using weighted similarity measure in the proposed clustering process. In fact, the weighted similarity function involves the inter-cluster, and intra-cluster similarity of both ordered and unordered documents, which is used to minimize weighted similarity among the documents. An advanced model for clustering is proposed by the hybrid optimization algorithm, which is the combination of the Jaya Algorithm (JA) and Grey Wolf Algorithm (GWO), and so the proposed algorithm is termed as JA-based GWO. Finally, the performance of the proposed model is verified through a comparative analysis with the state-of-the-art models. The performance analysis exhibits that the proposed model is 96.56% better than genetic algorithm, 99.46% better than particle swarm optimization, 97.09% superior to Dragonfly algorithm, and 96.21% better than JA for the similarity index. Therefore, the proposed model has confirmed its efficiency through valuable analysis. [ABSTRACT FROM AUTHOR]

Term position feature is widely and successfully used in IR and Web search engines, to enhance the retrieval effectiveness. This feature is essentially used for two purposes: to capture query terms proximity or to boost the weight of terms appearing in some parts of a document. In this paper, we are interested in this second category. We propose two novel query‐independent techniques based on absolute term positions in a document, whose goal is to boost the weight of terms appearing in the beginning of a document. The first one considers only the earliest occurrence of a term in a document. The second one takes into account all term positions in a document. We formalize each of these two techniques as a document model based on term position, and then we incorporate it into a basic language model (LM). Two smoothing techniques, Dirichlet and Jelinek‐Mercer, are considered in the basic LM. Experiments conducted on three TREC test collections show that our model, especially the version based on all term positions, achieves significant improvements over the baseline LMs, and it also often performs better than two state‐of‐the‐art baseline models, the chronological term rank model and the Markov random field model. [ABSTRACT FROM AUTHOR]

The application of data mining has been increasing day to day whereas the data base is also enhancing simultaneously. Hence retrieving required content from a huge data base is a critical task. This paper focus on biomedical engineering field, it concentrates on initial stage of database such as data preprocessing and cleansing to deal with noise and missing data in large biomedical data sets. The database of biomedical is huge and enhancing nature retrieving of specific content will be a critical task. Suggesting prescription with respect to identified disease based on profile analysis of specific patient is not available in current system. This paper proposes a recommendation system of prescription based on disease identification is done by combining user and professional suggestion with profile based analysis. Hence this focuses on profile based suggestions and report will be generated. The retrieving of specific suggestion from a huge database is done by hybrid feature selection algorithm. This approach focuses on enabling recommendation based on user profile and implementing Hybrid feature selection algorithm to retrieve specific content from a huge database. Hence it attains better retrieval of required content from a huge database compared to other existing approaches and suggests better recommendation with respect to user profile. [ABSTRACT FROM AUTHOR]

In order to meet the needs of users to query English information through their mother tongue, this paper studies the feasibility of cross language information retrieval by bilingual theme model from the point of view of precise correspondence search between Chinese and English topic words, and combines bilingual theme space constructed by bilingual related topics. A matching algorithm based on the weight value of each topic to respond to the topic correlation is presented in descending order according to the weight statistics. The results of data analysis show that the retrieval algorithm proposed in this paper is feasible, accurate, and highly interactive with users. It can basically achieve the retrieval of English information by BITC, and satisfy users' accessibility to English information through native language. [ABSTRACT FROM AUTHOR]

In order to solve the problem of inefficient query in relational database keyword search scheme based on schema graph, this paper proposed combined candidate network evaluation( CCNE) method. This method designed a new combined candidate network(CCN) structure, which could effectively avoid the redundant operation caused by the repeated structure between candidate networks(CN) in the traditional method. At the same time, it proposed an improved CN generation strategy to improve the efficiency by avoiding generating redundant CN and narrowing the traversal range. Finally, based on CCN, this paper designed a CCN evaluation algorithm, which greatly reduced the complex database query operations required by traditional methods and further improved the query efficiency. Experiment based on real data sets show that CCNE method can improve query efficiency without any loss of query results. [ABSTRACT FROM AUTHOR]

In this review paper a number of studies and researches are surveyed, in order to assist the upcoming researchers, to know about the techniques available in the field of semantic based video retrieval. The video retrieval system is used for finding the users' desired video among a huge number of available videos on the Internet or database. This paper gives a general discussion on the overall process of the semantic video retrieval phases. In addition to its present a generic review of techniques that has been proposed to solve the semantic gap as the major scientific problem in semantic based video retrieval. The semantic gap is formed because of the difference between the low level features that are extracted from video content and user's perceptions of these features in a real world. The transformation of low level features of the video content into meaningful semantic concepts is a research topic that has received considerable attention in recent years. [ABSTRACT FROM AUTHOR]

Set containment operations form an important tool in various fields such as information retrieval, AI systems, object-relational databases, and Internet applications. In the paper, a set-trie data structure for storing sets is considered, along with the efficient algorithms for the corresponding set containment operations. We present the mathematical and empirical study of the set-trie. In the mathematical study, the relevant upper-bounds on the efficiency of its expected performance are established by utilizing a natural probabilistic model. In the empirical study, we give insight into how different distributions of input data impact the efficiency of set-trie. Using the correct parameters for those randomly generated datasets, we expose the key sources of the input sensitivity of set-trie. Finally, the empirical comparison of set-trie with the inverted index is based on the real-world datasets containing sets of low cardinality. The comparison shows that the running time of set-trie consistently outperforms the inverted index by orders of magnitude. [ABSTRACT FROM AUTHOR]

Although in the last decade several fact-checking organizations have emerged to verify misinformation, fake news has continued to proliferate, especially through social media platforms. Even though adopting improved detection strategies is of utmost importance, the fact-checking process could be optimized by verifying whether a claim has been previously fact-checked. Despite some ad-hoc information retrieval approaches having been recently proposed, the utility of modern (neural) retrieval systems have not been investigated yet. In this paper, we consider the standard two-phases retriever-reranker architecture and benchmark different state-of-the-art techniques from the information retrieval and Q&A literature. We design several experiments on a real-world Twitter dataset to analyze the efficiency and the effectiveness of the benchmark approaches. Our results show that combining standard and neural approaches is the most promising research direction to improve retrievers performance and that complex (neural) rerankers might still be efficient in practice since there is no need to process a high number of documents to improve ranking performance. • We address the problem of detecting previously fact-checked information. • Considering the information retrieval task, we define a multi-stage retriever-reranker framework. • We benchmark the state-of-the-art retriever and re-ranker architectures. • We discuss the system's operational settings unveiling its strengths and weaknesses. [ABSTRACT FROM AUTHOR]

Text clustering has been widely utilized with the aim of partitioning specific document collection into different subsets using homogeneity/heterogeneity criteria. It has also become a very complicated area of research, including pattern recognition, information retrieval, and text mining. Metaheuristics are typically used as efficient approaches for the text clustering problem. The multi-verse optimizer algorithm (MVO) involves a stochastic population-based algorithm. It has been recently proposed and successfully utilized to tackle many hard optimization problems. However, a recently applied research trend involves hybridizing two or more algorithms with the aim of obtaining a superior solution regarding the problems of optimization. In this paper, a new hybrid of MVO algorithm with the K-means clustering algorithm is proposed, i.e., the H-MVO algorithm with the aims of enhancing the quality of initial candidate solutions, as well as the best solution, which is produced by MVO at each iteration. This hybrid algorithm aims at improving the global (diversification) ability of the search and finding a better cluster partition. The proposed H-MVO effectiveness was tested on five standard datasets, which are used in the domain of data clustering, as well as six standard text datasets, which are utilized in the domain of text document clustering, in addition to two scientific articles' datasets. The experiments showed that K-means hybridized MVO improves the results in terms of high convergence rate, accuracy, error rate, purity, entropy, recall, precision, and F-measure criteria. In general, H-MVO has outperformed or at least proven to be highly competitive compared to the original MVO algorithm and with well-known optimization algorithms like KHA, HS, PSO, GA, H-PSO, and H-GA and the clustering techniques like K-mean, K-mean++, DBSCAN, agglomerative, and spectral clustering techniques. [ABSTRACT FROM AUTHOR]

Searching for all occurrences of a pattern in a text is a fundamental problem in computer science with applications in many other fields, like natural language processing, information retrieval and computational biology. Sampled string matching is an efficient approach recently introduced in order to overcome the prohibitive space requirements of an index construction, on the one hand, and drastically reduce searching time for the online solutions, on the other hand. In this paper we present a new algorithm for the sampled string matching problem, based on a characters distance sampling approach. The main idea is to sample the distances between consecutive occurrences of a given pivot character and then to search online the sampled data for any occurrence of the sampled pattern, before verifying the original text. From a theoretical point of view we prove that, under suitable conditions, our solution can achieve both linear worst-case time complexity and optimal average-time complexity. From a practical point of view it turns out that our solution shows a sub-linear behaviour in practice and speeds up online searching by a factor of up to 9, using limited additional space whose amount goes from 11 to 2.8% of the text size, with a gain up to 50% if compared with previous solutions. [ABSTRACT FROM AUTHOR]

Plots and figures play an important role in the process of understanding a scientific publication, providing overviews of large amounts of data or ideas that are difficult to intuitively present using only the text. State-of-the-art digital libraries, which serve as gateways to knowledge encoded in scholarly writings, do not yet take full advantage of the graphical content of documents. Enabling machines to automatically unlock the meaning of scientific illustrations would allow immense improvements in the way scientists work and the way knowledge is processed. In this paper, we present a novel solution for the initial problem of processing graphical content, obtaining figures from scholarly publications stored in PDF. Our method relies on vector properties of documents and, as such, does not introduce additional errors, unlike methods based on raster image processing. Emphasis has been placed on correctly processing documents in high-energy physics. The described approach distinguishes different classes of objects appearing in PDF documents and uses spatial clustering techniques to group objects into larger logical entities. Many heuristics allow the rejection of incorrect figure candidates and the extraction of different types of metadata. [ABSTRACT FROM AUTHOR]

With the convergence of various broadcasting systems, the amount of content available in mobile terminals including IPTV has significantly increased. In this paper, we propose a system that enables users to schedule programs considering both section video clips and full video clips based on the user detection method with similar preference. And, since the system constituting the contents can be classified according to the program, the proposed method can store a program desired by the user, and thus create and schedule a kind of individual channel. Experimental results show that the proposed method has a higher prediction accuracy; this is accomplished by comparing existing channel recommendation methods with the program recommendation methods proposed in this paper. [ABSTRACT FROM AUTHOR]

A group event such as human and traffic congestion can be very roughly divided into three stages: converging stage before congestion, gathered stage when congestion happens, and dispersing stage that congestion disappears. It is of great interest in modeling and identifying converging behaviors before gathered events actually happen, which helps to proactively predict and handle potential public incidents such as serious stampedes. However, most of existing literature put too much emphasis on the second stage, only a few of them is dedicated to the first stage. In this paper, we propose a novel group pattern, namely converging, which refers to a group of moving objects converging from different directions during a certain period before gathered. To discover efficiently such converging patterns, we develop a framework for converging pattern mining (CPM) by examining how moving objects form clusters and the process of the "cluster containment". The framework consists of three phases: snapshot cluster discovery phase, cluster containment join phase, and converging detection phase. As cluster containment mining is the key step, we develop three algorithms to discover cluster containment matches: a containment-join-algorithm, called SSCCJ, by using spatial proximity; a signature tree-based cluster-containment-join-algorithm, called STCCJ, which takes advantage of the cluster containment relations and signature techniques to filter enormous unqualified candidates in an efficient and effective way; and third, to keep the advantages of the above algorithms while avoiding their flaws, we further propose a signature quad-tree based cluster-containment-join algorithm, called SQTCCJ, which can identify efficiently matches by considering cluster spatial proximity as well as containment relations simultaneously. To assess the proposed methods, we redefine two evaluation metrics based on the concept of "Precision and Recall" in the field of information retrieval and the characteristics of converging patterns. We also propose a new indicator for measuring the duration of the converging stage in a group event. Finally, the effectiveness of the CPM and the efficiency of the mining algorithms are evaluated using three types of trajectory datasets, and the results show that the SQTCCJ algorithm demonstrates a superior performance. [ABSTRACT FROM AUTHOR]

Abstract: This paper studies the problem of expertise matching with various constraints. Expertise matching, which aims to find the alignment between experts and queries, is a common problem in many applications such as conference paper–reviewer assignment, product–reviewer alignment, and product-endorser matching. Most existing methods formalize this problem as an information-retrieval problem and focus on finding a set of experts for each query independently. However, in real-world systems, various constraints are often needed to be considered. For example, in order to review a paper, it is desirable that there is at least one senior reviewer to guide the reviewing process. An important question is: “Can we design a framework to efficiently find the optimal solution for expertise matching under various constraints?” This paper explores such an approach by formulating the expertise matching problem in a constraint-based optimization framework. In the proposed framework, the problem of expertise matching is linked to a convex cost flow problem, which guarantees an optimal solution under various constraints. We also present an online matching algorithm to support incorporating user feedbacks in real time. The proposed approach has been evaluated on two different genres of expertise matching problems, namely conference paper–reviewer assignment and teacher–course assignment. Experimental results validate the effectiveness of the proposed approach. Based on the proposed method, we have also developed an online system for paper–reviewer suggestions, which has been used for paper–reviewer assignment in a top conference and feedbacks from the conference organizers are very positive. [Copyright &y& Elsevier]

The construction and retrieval of indoor maps are important for indoor positioning and navigation. It is necessary to ensure a good user experience while meeting real-time requirements. Unlike outdoor maps, indoor space is limited, and the relationship between indoor objects is complex which would result in an uneven indoor data distribution and close relationship between the data. A data storage model based on the octree scene segmentation structure was proposed in this paper initially. The traditional octree structure data storage model has been improved so that the data could be backtracked. The proposed method will solve the problem of partition lines within the range of the object data and improve the overall storage efficiency. Moreover, a data retrieval algorithm based on octree storage structure was proposed. The algorithm adopts the idea of "searching for a point, points around the searched point are within the searching range." Combined with the octree neighbor retrieval methods, the closure constraints are added. Experimental results show that using the improved octree storage structure, the retrieval cost is 1/8 of R-tree. However, by using the neighbor retrieval, it improved the search efficiency by about 27% on average. After adding the closure constraint, the retrieval efficiency increases by 25% on average. [ABSTRACT FROM AUTHOR]

Due to the rapid increase in the amount of data generated in many fields of science and engineering, information retrieval methods tailored to large-scale datasets have become increasingly important in the last years. Semantic hashing is an emerging technique for this purpose that works on the idea of representing complex data objects, like images and text, using similarity-preserving binary codes that are then used for indexing and search. In this paper, we investigate a hashing algorithm that uses a deep variational auto-encoder to learn and predict the codes. Unlike previous approaches of this type, that learn a continuous (Gaussian) representation and then project the embedding to obtain hash codes, our method employs Bernoulli latent variables in both the training and the prediction stage. Constraining the model to use a binary encoding allow us to obtain a more interpretable representation for hashing: each factor in the generative model represents a bit that should help to reconstruct and thus identify the input pattern. Interestingly, we found that the binary constraint does not lead to a loss but an increase of search accuracy. We argue that continuous formulations learn a representation that can significantly differ from the code used for search. Minding this gap in the design of the auto-encoder can translate into more accurate retrieval results. Extensive experiments on seven datasets involving image data and text data illustrate these findings and demonstrate the advantages of our approach. [ABSTRACT FROM AUTHOR]

In order to improve the accuracy of open source software bug localization, this paper proposed an open source soft. ware bug localization method based on twice propagation algorithm (TPA). It combined the restart random walk with the label propagation algorithm based on the information retrieval method. The specific location of the bug is analyzed from the three aspects: the call relationship, module risk and historical bug report of each module in the open source software. The bug localization is divided into two parts: risk propagation and label propagation. Through the similarity and calling relationship between the software modules, combined with the history of modified reports, it evaluated the module' s risk. It constructed the bug label through the modified bug reports, and propagated the software label from it. In the Eclipse 3.1 bug report data set, the top-N rank and MRR indicators are higher than the similar bug location methods. Experiments show that the TPA method has higher accuracy. [ABSTRACT FROM AUTHOR]

To solve the deficiency of Wu-Manber multi-pattern matching algorithm in terms of the achieved matching efficiency and jump distance, this paper proposed an improved Wu-Manber algorithm for Chinese PDF document content review on the basis of the coding formats of PDF document content. By employing the Bloom filter to extract the crucial information of the pattern string, and exploiting the double hash and PDF document encoding rules, the proposed improved algorithm was able to reduce the number of unnecessary matches and increase the jump distance, which results in improving the matching efficiency for the content retrieval of PDF document. The practical experimental results confirm the improved matching efficiency for PDF document, especially when the shortest mode string is long and the mode string size is large, the matching efficiency can be even doubled [ABSTRACT FROM AUTHOR]

Subsequence query technique has important applications in several fields such as finance, commerce and healthcare. However, due to the high time complexity of similarity comparison algorithms such as dynamic time warping ( DTW), the length of subsequence has a great influence on the retrieval time, which limits the efficiency of long subsequence retrieval on data sets. This paper proposed a fast subsequence query algorithm based on short sequence grouping and assembling strategy . This algorithm first separated all subsequences which were in a given length in the data set into groups and marked out the representative subsequence for each group. Then it cut the query sequence into small query sequences with a fixed length during the query processing, and used DTW algorithm to compute the candidate sets of subsequences . The representative subsequence had a high similarity with the small query sequences. Finally,it assembled all the sequences in the candidate sets to derive the query result sequences. Experiments show that the efficiency of the new algorithm is about 10 times higher than that of the typical algorithm. [ABSTRACT FROM AUTHOR]

Medical data in online groups and social media contain valuable information, which is provided by both healthcare professionals and patients. In fact, patients can talk freely and share their personal experiences. These resources are a valuable opportunity for health professionals who can access patients' opinions, as well as discussions between patients. Recently, the data processing of the health community and, how to extract knowledge is a significant technical challenge. There are many online group and forums that users can discuss on healthcare issues. Therefore, we can examine these text documents for discovering knowledge and evaluating patients' behavior based on their opinions and discussions. For example, there are many questions and answering groups on Twitter or Facebook. Given the importance of the research, in this paper, we present a semantic framework based on topic model (LDA) and Random forest(RF) to predict and retrieval latent topics of healthcare text-documents from an online forum. We extract our healthcare records (patient-questions) from patient.info website as a real dataset. Experiments on our dataset show that social media forums could help for detecting significant patient safety problems on healthcare issues. [ABSTRACT FROM AUTHOR]