Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Purchase individual online access for 1 year to this journal.
Price: EUR 410.00Impact Factor 2024: 0.4
Fundamenta Informaticae is an international journal publishing original research results in all areas of theoretical computer science. Papers are encouraged contributing:
- solutions by mathematical methods of problems emerging in computer science
- solutions of mathematical problems inspired by computer science.
Topics of interest include (but are not restricted to): theory of computing, complexity theory, algorithms and data structures, computational aspects of combinatorics and graph theory, programming language theory, theoretical aspects of programming languages, computer-aided verification, computer science logic, database theory, logic programming, automated deduction, formal languages and automata theory, concurrency and distributed computing, cryptography and security, theoretical issues in artificial intelligence, machine learning, pattern recognition, algorithmic game theory, bioinformatics and computational biology, quantum computing, probabilistic methods, & algebraic and categorical methods.
Authors: Ślęzak, Dominik | Fung, Benjamin C.M. | Cheung, William K.
Article Type: Other
DOI: 10.3233/FI-2015-1174
Citation: Fundamenta Informaticae, vol. 137, no. 2, pp. i-ii, 2015
Authors: Rauch, Jan
Article Type: Research Article
Abstract: A formal framework for data mining with association rules is introduced. The framework is based on a logical calculus of association rules which is enhanced by several formal tools. The enhancement allows the description of the whole data mining process, including formulation of analytical questions, application of an analytical procedure and interpretation of its results. The role of formalized domain knowledge is discussed.
Keywords: data mining, association rules, formalization of CRISP-DM, domain knowledge, logical calculus of association rules
DOI: 10.3233/FI-2015-1175
Citation: Fundamenta Informaticae, vol. 137, no. 2, pp. 171-217, 2015
Authors: Anciaux, Nicolas | Boutara, Danae | Nguyen, Benjamin | Vazirgiannis, Michalis
Article Type: Research Article
Abstract: Administrative services such social care, tax reduction, and many others using complex decision processes, request individuals to provide large amounts of private data items, in order to calibrate their proposal to the specific situation of the applicant. This data is subsequently processed and stored by the organization. However, all the requested information is not needed to reach the same decision. We have recently proposed an approach, termed Minimum Exposure, to reduce the quantity of information provided by the users, in order to protect her privacy, reduce processing costs for the organization, and financial lost in the case of a data …breach. In this paper, we address the case of decision making processes based on sets of classifiers, typically multi-label classifiers. We propose a practical implementation using state of the art multi-label classifiers, and analyze the effectiveness of our solution on several real multi-label data sets. Show more
Keywords: Privacy, Online forms, Overdata Disclosure, Limited Data Collection, Multi-label Classification
DOI: 10.3233/FI-2015-1176
Citation: Fundamenta Informaticae, vol. 137, no. 2, pp. 219-236, 2015
Authors: Iwata, Haruko | Hirano, Shoji | Tsumoto, Shusaku
Article Type: Research Article
Abstract: [Introduction] Schedule management of hospitalization is important to maintain or improve the quality of medical care and application of a clinical pathway is one of the important solutions for the management. Although several kinds of deductive methods for construction for a clinical pathway have been proposed, the customization is one of the important problems. This research proposed an inductive approach to support the customization of existing clinical pathways by using data on nursing actions stored in a hospital information system. [Method] The number of each nursing action applied to a given disease during the hospitalization was counted for each day …as a temporal sequence. Temporal sequences were compared by using clustering and multidimensional scaling method in order to visualize the similarities between temporal patterns of clinical actions. [Results] Clustering and multidimensional scaling analysis classified these orders to one group necessary for the treatment for this DPC and the other specific to the status of a patient. The method was evaluated on data sets of ten frequent diseases extracted from hospital information system in Shimane University Hospital. Cataracta and Glaucoma were selected. Removing routine and poorly documented nursing actions, 46 items were selected for analysis. [Discussion] Counting data on executed nursing orders were analyzed as temporal sequences by using similarity-based analysis methods. The analysis classified the nursing actions into the two major groups: one consisted of orders necessary for the treatment and the other consisted of orders dependent on the status of admitted patients, including complicated diseases, such as DM or heart diseases. The method enabled us to inductive construction of standardized schedule management and detection of the conditions of patients difficult to apply the existing or induced clinical pathway. Show more
Keywords: Clinincal Pathway, Hospital Information System, Clustering, MDS, Feature Selection
DOI: 10.3233/FI-2015-1177
Citation: Fundamenta Informaticae, vol. 137, no. 2, pp. 237-252, 2015
Authors: Chen, Wuhui | Paik, Incheon | Hung, Patrick C.K.
Article Type: Research Article
Abstract: A Web service is defined as an autonomous unit of application logic that provides either some business functionality or information to other applications through an Internet connection. Web services are based on a set of eXtensible Markup Language (XML) standards such as Universal Description, Discovery and Integration (UDDI), Web Services Description Language (WSDL), and Simple Object Access Protocol (SOAP). Nowadays Web services are becoming more and more popular for supporting different social applications, thus there are also increasing demands and discussions about Web services privacy protection in information. In general, privacy policies describe an organization's data practices on what information …they collect from individuals (e.g., consumers) and what (e.g., purposes) they do with it. To enable privacy protection for Web service consumers across multiple domains and services, the World Wide Web Consortium (W3C) published a document called “Web Services Architecture (WSA) Requirements” that defines some specific privacy requirements for Web services as a future research topic. This paper presents a mathematical model to construct the privacy policies in SOAP Message Exchange Patterns (MEP) for social services. Further, this paper also presents the privacy policies in security tokens with SOAP messages. Show more
Keywords: Web services, privacy policies, social services, SOAP, security token
DOI: 10.3233/FI-2015-1178
Citation: Fundamenta Informaticae, vol. 137, no. 2, pp. 253-271, 2015
Authors: Meina, Michał | Nguyen, Hung Son
Article Type: Research Article
Abstract: This paper introduces a novel, interactive and exploratory, approach to information retrieval (search engines) based on clustering. Presented method allows users to change the clustering structure by applying a free-text clustering context query that is treated as a criterion for document-to-cluster allocation. Exploration mechanisms are delivered by redefining the interaction scenario in which the user can interact with data on the level of topic discovery or cluster labeling. In this paper, the presented idea is realized by a graph structure called the Query-Summarize Graph. This data structure is useful in the definition of the similarity measure between the snippets as …well as in the snippet clustering algorithm. The experiments on real-world data are showing that the proposed solution has many interesting properties and can be an alternative approach to interactive information retrieval. Show more
DOI: 10.3233/FI-2015-1179
Citation: Fundamenta Informaticae, vol. 137, no. 2, pp. 273-290, 2015
Authors: Kawamoto, Junpei
Article Type: Research Article
Abstract: We introduce a filtering methodology based on locality-sensitive hashing (LSH) and whitening transformation to reduce candidate tuples between which encrypted vector databases (EVDBs) must compute similarity for query processing. The LSH hashing methodology is efficient for estimating similarities between two vectors. It hashes a vector space using randomly chosen vectors. We can filter vectors that are less similar to the querying vectors by recording which hashed space each vector belongs to. However, if vectors in EVDBs are found locally, then most vectors are in the same hashed space, so the filter will not work. Because we can treat those cases …using whitening transformation to distribute the vectors broadly, our proposed filtering methodology will work effectively on any vector space. We also show that our filter reduces the server's query processing cost. Show more
Keywords: Query processing, Encrypted databases, Security and privacy
DOI: 10.3233/FI-2015-1180
Citation: Fundamenta Informaticae, vol. 137, no. 2, pp. 291-304, 2015
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]