Selected Publications

2017

• M. Gjoreski, M. Luštrek, M. Gams, and H. Gjoreski, “Monitoring stress with a wrist device using context,” Journal of biomedical informatics, 2017.
  [Bibtex]

  @article{citeulike:14523451,
  author = {Gjoreski, M. and Lu\v{s}trek, M. and Gams, M. and Gjoreski, H.},
  citeulike-article-id = {14523451},
  journal = {Journal of biomedical informatics},
  posted-at = {2018-01-26 10:23:58},
  priority = {2},
  title = {Monitoring stress with a wrist device using context},
  year = {2017}
  }

• A. Tavcar, D. Kuznar, and M. Gams, “Hybrid Multi-Agent strategy discovering algorithm for human behavior,” Expert systems with applications, 2017.
  [Bibtex]

  @article{citeulike:14523450,
  author = {Tavcar, A. and Kuznar, D. and Gams, M.},
  citeulike-article-id = {14523450},
  journal = {Expert Systems with Applications},
  posted-at = {2018-01-26 10:20:11},
  priority = {2},
  title = {Hybrid {Multi-Agent} Strategy Discovering Algorithm for human behavior},
  year = {2017}
  }

• J. Bizjak, A. Gradišek, L. Stepančič, H. Gjoreski, and M. Gams, “Smartwatch for active ageing as part of an open EU framework,” International joint conference on artificial intelligence (ijcai), 2017.
  [Bibtex]

  @article{citeulike:14523449,
  author = {Bizjak, J. and Gradi\v{s}ek, A. and Stepan\v{c}i\v{c}, L. and Gjoreski, H. and Gams, M.},
  citeulike-article-id = {14523449},
  journal = {International joint Conference on Artificial Intelligence (IJCAI)},
  month = aug,
  posted-at = {2018-01-26 10:18:57},
  priority = {2},
  title = {Smartwatch for active ageing as part of an open {EU} framework},
  year = {2017}
  }

• T. Tušar, K. Gantar, V. Koblar, B. Ženko, and B. Filipič, “A study of overfitting in optimization of a manufacturing quality control procedure,” Applied soft computing, vol. 59, pp. 77-78, 2017.
  [Bibtex]

  @article{citeulike:14523448,
  author = {Tu\v{s}ar, T. and Gantar, K. and Koblar, V. and \v{Z}enko, B. and Filipi\v{c}, B.},
  citeulike-article-id = {14523448},
  journal = {Applied Soft Computing},
  pages = {77--78},
  posted-at = {2018-01-26 10:17:07},
  priority = {2},
  title = {A study of overfitting in optimization of a manufacturing quality control procedure},
  volume = {59},
  year = {2017}
  }

2016

• N. Veček, M. Mernik, B. Filipič, and M. Črepinšek, “Parameter tuning with chess rating system (CRS-tuning) for meta-heuristic algorithms,” Information sciences, vol. 372, pp. 446-469, 2016.
  [Bibtex]

  @article{citeulike:14270942,
  author = {Ve\v{c}ek, N. and Mernik, M. and Filipi\v{c}, B. and \v{C}repin\v{s}ek, M.},
  citeulike-article-id = {14270942},
  journal = {{{Information sciences}}},
  month = dec,
  pages = {446--469},
  posted-at = {2017-02-03 10:02:13},
  priority = {2},
  title = {Parameter tuning with Chess Rating System ({CRS}-Tuning) for meta-heuristic algorithms},
  volume = {372},
  year = {2016}
  }

• B. Cvetković, V. Janko, E. A. Romero, O. Kafali, K. Stathis, and M. Luštrek, “Activity recognition for diabetic patients using a smartphone,” Journal of medical systems, accepted for publication., 2016.
  [Bibtex]

  @article{citeulike:14257236,
  author = {Cvetkovi\'{c}, B. and Janko, V. and Romero, E. A. and Kafali, O. and Stathis, K. and Lu\v{s}trek, M.},
  citeulike-article-id = {14257236},
  journal = {Journal of Medical Systems, accepted for publication.},
  posted-at = {2017-01-18 13:03:48},
  priority = {2},
  title = {Activity Recognition for Diabetic Patients Using a Smartphone},
  year = {2016}
  }

• B. Cvetković, R. Milić, and M. Luštrek, “Estimating energy expenditure with multiple models using different wearable sensors.,” Ieee journal of biomedical and health informatics, vol. 20, no. 4, 2016, 2016.
  [Bibtex]

  @article{citeulike:14257235,
  author = {Cvetkovi\'{c}, B. and Mili\'{c}, R. and Lu\v{s}trek, M.},
  citeulike-article-id = {14257235},
  journal = {IEEE Journal of Biomedical and Health Informatics, vol. 20, no. 4, 2016},
  posted-at = {2017-01-18 13:02:32},
  priority = {2},
  title = {Estimating Energy Expenditure with Multiple Models using Different Wearable Sensors.},
  year = {2016}
  }

• M. Frešer, B. Cvetković, A. Gradišek, and M. Luštrek, “Anticipatory system for T-H-c dynamics in room with real and virtual sensors,” Acm ubicomp 2016 workshop on smarticipation, september 2016, 2016.
  [Bibtex]

  @article{citeulike:14257234,
  author = {Fre\v{s}er, M. and Cvetkovi\'{c}, B. and Gradi\v{s}ek, A. and Lu\v{s}trek, M.},
  citeulike-article-id = {14257234},
  journal = {ACM UbiComp 2016 Workshop on Smarticipation, September 2016},
  month = sep,
  posted-at = {2017-01-18 13:01:31},
  priority = {2},
  title = {Anticipatory system for {T-H}-C dynamics in room with real and virtual sensors},
  year = {2016}
  }

• M. Frešer, B. Cvetković, A. Gradišek, and M. Luštrek, “An intelligent system to improve T-H-c parameters at the workplace,” Proceedings of the 2016 acm international joint conference on pervasive and ubiquitous computing: adjunct, september 2016,, 2016.
  [Bibtex]

  @article{citeulike:14257232,
  author = {Fre\v{s}er, M. and Cvetkovi\'{c}, B. and Gradi\v{s}ek, A. and Lu\v{s}trek, M.},
  citeulike-article-id = {14257232},
  journal = {Proceedings of the 2016 ACM International Joint Conference on Pervasive and Ubiquitous Computing: Adjunct, September 2016,},
  month = sep,
  posted-at = {2017-01-18 12:59:27},
  priority = {2},
  title = {An intelligent system to improve {T-H}-C parameters at the workplace},
  year = {2016}
  }

• B. Cvetković, A. Gradišek, U. Pangerc, and M. Luštrek, “Monitoring patients with diabetes using wearable sensors: predicting glycaemias using ECG and respiration rate.” 2016.
  [Bibtex]

  @inproceedings{citeulike:14257226,
  author = {Cvetkovi\'{c}, B. and Gradi\v{s}ek, A. and Pangerc, U. and Lu\v{s}trek, M.},
  citeulike-article-id = {14257226},
  day = {30},
  journal = {ECAI Workshop on Artificial Intelligence for Diabetes, 30 August 2016},
  month = aug,
  posted-at = {2017-01-18 12:43:11},
  priority = {2},
  title = {Monitoring patients with diabetes using wearable sensors: Predicting glycaemias using {ECG} and respiration rate},
  year = {2016}
  }

2015

• T. Tušar and B. Filipič, “Visualization of pareto front approximations in evolutionary multiobjective optimization: a critical review and the prosection method,” Ieee transactions on evolutionary computation, vol. 19, 2015.
  [Bibtex]

  @article{citeulike:13992102,
  author = {Tu\v{s}ar, T. and Filipi\v{c}, B.},
  citeulike-article-id = {13992102},
  journal = {IEEE Transactions on Evolutionary Computation},
  posted-at = {2016-04-01 08:41:45},
  priority = {2},
  title = {Visualization of Pareto front approximations in evolutionary multiobjective optimization: A critical review and the prosection method},
  volume = {19},
  year = {2015}
  }

• M. Mlakar, D. Petelin, T. Tušar, and B. Filipič, “GP-DEMO: differential evolution for multiobjective optimization based on gaussian process models,” European journal of operational research, vol. 243, 2015.
  [Bibtex]

  @article{citeulike:13992101,
  author = {Mlakar, M. and Petelin, D. and Tu\v{s}ar, T. and Filipi\v{c}, B.},
  citeulike-article-id = {13992101},
  journal = {European Journal of Operational Research},
  posted-at = {2016-04-01 08:40:51},
  priority = {2},
  title = {{GP}-{DEMO}: Differential evolution for multiobjective optimization based on Gaussian process models},
  volume = {243},
  year = {2015}
  }

• H. Gjoreski, R. Piltaver, and M. Gams, “Person identification by analyzing door accelerations in time and frequency domain,” 12th european conference, ami 2015, athens, greece, 2015.
  [Bibtex]

  @article{citeulike:13992095,
  author = {Gjoreski, H. and Piltaver, R. and Gams, M.},
  citeulike-article-id = {13992095},
  journal = {12th European Conference, AmI 2015, Athens, Greece},
  month = nov,
  posted-at = {2016-04-01 08:26:16},
  priority = {2},
  title = {Person identification by analyzing door accelerations in time and frequency domain},
  year = {2015}
  }

• H. Gjoreski, B. Kaluza, M. Gams, R. Milić, and M. Luštrek, “Context-based ensemble method for human energy expenditure estimation,” Applied soft computing, vol. 37, 2015.
  [Bibtex]

  @article{citeulike:13991572,
  abstract = {Monitoring human energy expenditure ({EE}) is important in many health and sports applications, since the energy expenditure directly reflects the intensity of physical activity. The actual energy expenditure is unpractical to measure; therefore, it is often estimated from the physical activity measured with accelerometers and other sensors. Previous studies have demonstrated that using a person's activity as the context in which the {EE} is estimated, and using multiple sensors, improves the estimation. In this study, we go a step further by proposing a context-based reasoning method that uses multiple contexts provided by multiple sensors. The proposed Multiple Contexts Ensemble ({MCE}) approach first extracts multiple features from the sensor data. Each feature is used as a context for which multiple regression models are built using the remaining features as training data: for each value of the context feature, a regression model is trained on a subset of the dataset with that value. When evaluating a data sample, the models corresponding to the context (feature) values in the evaluated sample are assembled into an ensemble of regression models that estimates the {EE} of the user. Experiments showed that the {MCE} method outperforms (in terms of lower root means squared error and lower mean absolute error): (i) five single-regression approaches (linear and non-linear); (ii) two ensemble approaches: Bagging and Random subspace; (iii) an approach that uses artificial neural networks trained on accelerometer-data only; and (iv) {BodyMedia} (a state-of-the-art commercial {EE}-estimation device).},
  author = {Gjoreski, H. and Kaluza, B. and Gams, M. and Mili\'{c}, R. and Lu\v{s}trek, M.},
  citeulike-article-id = {13991572},
  journal = {Applied Soft Computing},
  month = dec,
  posted-at = {2016-03-31 12:48:05},
  priority = {2},
  title = {Context-based ensemble method for human energy expenditure estimation},
  volume = {37},
  year = {2015}
  }

• H. Gjoreski, S. Kozina, M. Gams, M. Lustrek, J. A. Álvarez-García, J. H. Hong, A. K. Dey, M. Bocca, and N. Patwari, “Competitive live evaluations of Activity-Recognition systems,” Ieee pervasive computing, vol. 14, iss. 1, 2015.
  [Bibtex]

  @article{citeulike:13991567,
  abstract = {Ensuring the validity and usability of activity recognition approaches requires agreement on a set of standard evaluation methods. Due to the diversity of the sensors and other hardware employed, however, designing, implementing, and accepting standard tests is a difficult task. This article presents an initiative to evaluate activity recognition systems: a living-lab evaluation established through the annual Evaluating Ambient Assisted Living Systems through Competitive {Benchmarking-Activity} Recognition ({EvAAL}-{AR}) competition. In the {EvAAL}-{AR}, each team brings its own activity-recognition system; all systems are evaluated live on the same activity scenario performed by an actor. The evaluation criteria attempt to capture practical usability: recognition accuracy, user acceptance, recognition delay, installation complexity, and interoperability with ambient assisted living systems. Here, the authors discuss the competition and the competing systems, focusing on the system that achieved the best recognition accuracy, and the system that was evaluated as the best overall. The authors also discuss lessons learned from the competition and ideas for future development of the competition and of the activity recognition field in general.},
  author = {Gjoreski, H. and Kozina, S. and Gams, M. and Lustrek, M. and \'{A}lvarez-Garc\'{\i}a, J. A. and Hong, J. H. and Dey, A. K. and Bocca, M. and Patwari, N.},
  citeulike-article-id = {13991567},
  day = {4},
  journal = {IEEE Pervasive Computing},
  month = feb,
  number = {1},
  posted-at = {2016-03-31 12:41:14},
  priority = {2},
  title = {Competitive Live Evaluations of {Activity-Recognition} Systems},
  volume = {14},
  year = {2015}
  }

• E. Čuk, M. Gams, R. Piltaver, F. Strle, V. Maraspin Čarman, and J. Tasič, “Intelligent system for diagnosis of erythema migrans,” Applied artificial intelligence 29, vol. 2, pp. 134-147, 2015.
  [Bibtex]

  @article{citeulike:13548192,
  abstract = {Lyme borreliosis is the most common human tick-borne infectious disease of the Northern Hemisphere. One of the first signs of the disease is erythema migrans, a skin lesion that appears within days to weeks after an infected tick bite. In this article, a novel intelligent system for erythema migrans recognition is presented based on image and text information, applicable for individual and clinical web-based use. Novelties of our approach include a combination of visual and textual attributes, a new combination of visual attributes (geometrical, color, and Gabor-filter based), and a new algorithm for calculation of color-based attributes. Procedurally, the intelligent system for erythema migrans recognition integrated in a web-based application facilitates provisional diagnosis of erythema migrans in the general population and assists general medical practitioners in their decisions. Several classification {methods—Na\"{i}ve} Bayes, Support Vector Machine, Adaboost, and Random forest—were tested in order to achieve improved performance.},
  author = {\v{C}uk, E. and Gams, M. and Piltaver, R. and Strle, F. and Maraspin \v{C}arman, V. and Tasi\v{c}, J.},
  citeulike-article-id = {13548192},
  journal = {Applied Artificial Intelligence 29},
  pages = {134--147},
  posted-at = {2015-03-13 08:46:10},
  priority = {2},
  title = {Intelligent System for Diagnosis of Erythema Migrans},
  volume = {2},
  year = {2015}
  }

2014

• R. Piltaver, M. Luštrek, J. Zupančič, S. Džeroski, and M. Gams, “Multi-objective learning of hybrid classifiers,” Proceedings of european conference on artificial intelligence, vol. ECAI 2014, p. 1+, 2014.
  [Bibtex]

  @article{citeulike:13548189,
  author = {Piltaver, R. and Lu\v{s}trek, M. and Zupan\v{c}i\v{c}, J. and D\v{z}eroski, S. and Gams, M.},
  citeulike-article-id = {13548189},
  journal = {Proceedings of European Conference on Artificial Intelligence},
  month = aug,
  pages = {1+},
  posted-at = {2015-03-13 08:42:15},
  priority = {2},
  title = {Multi-objective Learning of Hybrid Classifiers},
  volume = {ECAI 2014},
  year = {2014}
  }

• B. Kaluža, “A unified framework for detection of suspicious and anomalous beahvior from Spatio-Temporal traces,” Informatica (Slovenia), 2014.
  [Bibtex]

  @article{informaticaSI/Kaluza14,
  author = {Kalu\v{z}a, Bo\v{s}tjan},
  citeulike-article-id = {13534786},
  journal = {Informatica (Slovenia)},
  posted-at = {2015-03-06 12:16:36},
  priority = {2},
  title = {A Unified Framework for Detection of Suspicious and Anomalous Beahvior from {Spatio-Temporal} Traces},
  year = {2014}
  }

• D. Zupančič, M. Luštrek, and M. Gams, “Multi-agent architecture for control of heating and cooling in a residential space,” The computer journal, vol. 1093, p. 1+, 2014.
  [Bibtex]

  @article{citeulike:13534760,
  abstract = {Energy demand in a smart grid is directly related to energy consumption, as defined by user needs and comfort experience. This article presents a multi-agent architecture for smart control of space heating and cooling processes, in an attempt to enable flexible ways of monitoring and adjusting energy supply and demand. In this proposed system, control agents are implemented in order to perform temperature set-point delegation for heating and cooling systems in a building, offering a means to observe and learn from both the environment and the occupant. Operation of the proposed algorithms is compared with traditional algorithms utilized for room heating, using a simulated model of a residential building and real data about user behaviour. The results show (i) the performance of machine learning for the occupancy forecasting problem and for the problem of calculating the time to heat or cool a room; and (ii) the performance of the control algorithms, with respect to energy consumption and occupant comfort. The proposed control agents make it possible to significantly improve an occupant comfort with a relatively small increase in energy consumption, compared with simple control strategies that always maintain predefined temperatures. The findings enable the smart grid to anticipate the energy needs of the building.},
  author = {Zupan\v{c}i\v{c}, D. and Lu\v{s}trek, M. and Gams, M.},
  citeulike-article-id = {13534760},
  journal = {The Computer Journal},
  month = jul,
  pages = {1+},
  posted-at = {2015-03-06 11:21:37},
  priority = {2},
  title = {Multi-agent architecture for control of heating and cooling in a residential space},
  volume = {1093},
  year = {2014}
  }

• V. Vidulin, M. Bohanec, and M. Gams, “Combining human analysis and machine data mining to obtain credible data relations,” Information sciences, vol. 288, pp. 254-278, 2014.
  [Bibtex]

  @article{citeulike:13534759,
  abstract = {Can a model constructed using data mining ({DM}) programs be trusted? It is known that a decision-tree model can contain relations that are statistically significant, but, in reality, meaningless to a human. When the task is domain analysis, meaningless relations are problematic, since they can lead to wrong conclusions and can consequently undermine a human's trust in {DM} programs. To eliminate problematic relations from the conclusions of analysis, we propose an interactive method called {Human–Machine} Data Mining ({HMDM}). The method constructs multiple models in a specific way so that a human can reexamine the relations in different contexts and, based on observed evidence, conclude which relations and models are credible—that is, both meaningful and of high quality. Based on the extracted credible relations and models, the human can construct correct overall conclusions about the domain. The method is demonstrated in two complex domains, extracting credible relations and models that indicate the segments of the higher education sector and the research and development sector that influence the economic welfare of a country. An experimental evaluation shows that the method is capable of finding important relations and models that are better in both meaning and quality than those constructed solely by the {DM} programs.},
  author = {Vidulin, V. and Bohanec, M. and Gams, M.},
  citeulike-article-id = {13534759},
  journal = {Information sciences},
  pages = {254--278},
  posted-at = {2015-03-06 11:19:35},
  priority = {2},
  title = {Combining human analysis and machine data mining to obtain credible data relations},
  volume = {288},
  year = {2014}
  }

• T. Tušar and B. Filipič, “Visualizing exact and approximated 3D empirical attainment functions,” Mathematical problems in engineering, vol. 10, iss. 569346, 2014.
  [Bibtex]

  @article{citeulike:13534757,
  abstract = {Most real-world engineering optimization problems are inherently multiobjective, for example, searching for trade-off solutions of high quality and low cost. As no single optimal solution exists for such problems, multiobjective optimizers provide sets of optimal (or near-optimal) trade-off solutions to choose from. The empirical attainment function ({EAF}) is a powerful tool that can be used to analyze and compare the performance of these optimizers. While the visualization of {EAFs} is rather straightforward in two objectives, the three-objective case presents a great challenge as we need to visualize a large number of {3D} cuboids. This paper addresses the visualization of exact as well as approximated {3D} {EAF} values and differences in these values provided by two competing multiobjective optimizers. We show that the exact {EAFs} can be visualized using slicing and maximum intensity projection ({MIP}), while the approximated {EAFs} can be visualized using slicing, {MIP}, and direct volume rendering. In addition, the paper demonstrates the use of the proposed visualization techniques on a steel casting optimization problem.},
  author = {Tu\v{s}ar, T. and Filipi\v{c}, B.},
  citeulike-article-id = {13534757},
  journal = {Mathematical Problems in Engineering},
  number = {569346},
  posted-at = {2015-03-06 11:17:44},
  priority = {2},
  title = {Visualizing exact and approximated {3D} empirical attainment functions},
  volume = {10},
  year = {2014}
  }

• M. Mlakar, T. Tušar, and B. Filipič, “Comparing solutions under uncertainty in multiobjective optimization,” Mathematical problems in engineering, vol. 10, p. 1155+, 2014.
  [Bibtex]

  @article{citeulike:13534756,
  abstract = {Due to various reasons the solutions in real-world optimization problems cannot always be exactly evaluated but are sometimes represented with approximated values and confidence intervals. In order to address this issue, the comparison of solutions has to be done differently than for exactly evaluated solutions. In this paper, we define new relations under uncertainty between solutions in multiobjective optimization that are represented with approximated values and confidence intervals. The new relations extend the Pareto dominance relations, can handle constraints, and can be used to compare solutions, both with and without the confidence interval. We also show that by including confidence intervals into the comparisons, the possibility of incorrect comparisons, due to inaccurate approximations, is reduced. Without considering confidence intervals, the comparison of inaccurately approximated solutions can result in the promising solutions being rejected and the worse ones preserved. The effect of new relations in the comparison of solutions in a multiobjective optimization algorithm is also demonstrated.},
  author = {Mlakar, M. and Tu\v{s}ar, T. and Filipi\v{c}, B.},
  citeulike-article-id = {13534756},
  journal = {Mathematical Problems in Engineering},
  pages = {1155+},
  posted-at = {2015-03-06 11:15:54},
  priority = {2},
  title = {Comparing solutions under uncertainty in multiobjective optimization},
  volume = {10},
  year = {2014}
  }

• B. Kaluža, B. Cvetković, E. Dovgan, H. Gjoreski, V. Mirchevska, M. Gams, and M. Luštrek, “A multiagent care system to support independent living,” International journal on artificial intelligence tools, vol. 23, iss. 1, p. 1440001+, 2014.
  [Bibtex]

  @article{citeulike:13534755,
  abstract = {This paper presents a context-aware, multi-agent system called ” Confidence” that helps elderly
  people remain independent longer by detecting falls and unusual movement, which may indicate a
  health problem. The system combines state-of-the-art sensor technologies and four groups of agents
  providing a reliable, robust, flexible monitoring system. It can call for help in case of an emergency,
  and issue warnings if unusual behavior is detected. The first group gathers data from the location and
  inertial sensors and suppresses noise. The second group reconstructs the position and activity of a
  person and detects the context. The third group assesses the person's condition in the environment
  and reacts to critical situations such as falls. The fourth group detects unusual behavior as an
  indicator of a potential health problem. The system was successfully tested on a scenario consisting
  of events that were difficult to recognize as falls, as well as in a scenario consisting of normal days
  and days when the person was ill. It was also demonstrated live several times, with excellent
  performance in complex situations.},
  author = {Kalu\v{z}a, B. and Cvetkovi\'{c}, B. and Dovgan, E. and Gjoreski, H. and Mirchevska, V. and Gams, M. and Lu\v{s}trek, M.},
  citeulike-article-id = {13534755},
  journal = {International journal on artificial intelligence tools},
  number = {1},
  pages = {1440001+},
  posted-at = {2015-03-06 11:14:07},
  priority = {2},
  title = {A Multiagent care system to support independent living},
  volume = {23},
  year = {2014}
  }

• H. Gjoreski, M. Gams, and M. Luštrek, “Context-based fall detection and activity recognition using inertial and location sensors,” Journal of ambient intelligence and smart environments, vol. 6, iss. 4, pp. 419-433, 2014.
  [Bibtex]

  @article{citeulike:13534753,
  abstract = {Falls are some of the most common sources of injury among the elderly. A fall is particularly critical when the elderly person is injured and cannot call for help. This problem is addressed by many fall-detection systems, but they often focus on isolated falls under restricted conditions, neglecting complex, real-life situations. In this paper a combination of body-worn inertial and location sensors for fall detection is studied. A novel context-based method that exploits the information from both types of sensors is designed. The evaluation is performed on a real-life scenario, including fast falls, slow falls and fall-like situations that are difficult to distinguish from falls. All the possible combinations of six inertial and four location sensors are tested. The results show that: (i) context-based reasoning significantly improves the performance; (ii) a combination of two types of sensors in a single physical sensor enclosure seems to be the best practical solution.},
  author = {Gjoreski, H. and Gams, M. and Lu\v{s}trek, M.},
  citeulike-article-id = {13534753},
  journal = {Journal of ambient intelligence and smart environments},
  number = {4},
  pages = {419--433},
  posted-at = {2015-03-06 11:11:18},
  priority = {2},
  title = {Context-based fall detection and activity recognition using inertial and location sensors},
  volume = {6},
  year = {2014}
  }

• E. Dovgan, M. Javorski, T. Tušar, M. Gams, and B. Filipič, “Discovering driving strategies with a multiobjective optimization algorithm,” Applied soft computing, vol. 16, iss. 1, pp. 50-62, 2014.
  [Bibtex]

  @article{citeulike:13534752,
  abstract = {When driving a vehicle along a given route, several objectives such as the traveling time and the fuel consumption have to be considered. This can be viewed as an optimization problem and solved with the appropriate optimization algorithms. The existing optimization algorithms mostly combine objectives into a weighted-sum cost function and solve the corresponding single-objective problem. Using a multiobjective approach should be, in principle, advantageous, since it enables better exploration of the multiobjective search space, however, no results about the optimization of driving with this approach have been reported yet. To test the multiobjective approach, we designed a two-level Multiobjective Optimization algorithm for discovering Driving Strategies ({MODS}). It finds a set of nondominated driving strategies with respect to two conflicting objectives: the traveling time and the fuel consumption. The lower-level algorithm is based on a deterministic breadth-first search and nondominated sorting, and searches for nondominated driving strategies. The upper-level algorithm is an evolutionary algorithm that optimizes the input parameters for the lower-level algorithm. The {MODS} algorithm was tested on data from real-world routes and compared with the existing single-objective algorithms for discovering driving strategies. The results show that the presented algorithm, on average, significantly outperforms the existing algorithms.},
  author = {Dovgan, E. and Javorski, M. and Tu\v{s}ar, T. and Gams, M. and Filipi\v{c}, B.},
  citeulike-article-id = {13534752},
  journal = {Applied Soft Computing},
  number = {1},
  pages = {50--62},
  posted-at = {2015-03-06 11:09:21},
  priority = {2},
  title = {Discovering driving strategies with a multiobjective optimization algorithm},
  volume = {16},
  year = {2014}
  }

2013

• B. Kaluža, “Instant weka how-to,” Packt publishing, vol. 2013, p. 0+, 2013.
  [Bibtex]

  @article{citeulike:13534748,
  author = {Kalu\v{z}a, B.},
  citeulike-article-id = {13534748},
  journal = {Packt Publishing},
  pages = {0+},
  posted-at = {2015-03-06 11:05:42},
  priority = {2},
  title = {Instant Weka How-to},
  volume = {2013},
  year = {2013}
  }

• H. Gjoreski, B. Kaluža, M. Gams, R. Milić, and M. Luštrek, “Ensembles of multiple sensors for human energy expenditure estimation,” The 2013 acm international joint conference on pervasive and ubiquitous computing, vol. 2013, pp. 359-362, 2013.
  [Bibtex]

  @article{citeulike:13534747,
  abstract = {Monitoring human energy expenditure is important in many health and sport applications, since the energy expenditure directly reflects the level of physical activity. The actual energy expenditure is unpractical to measure; hence, the field aims at estimating it by measuring the physical activity with accelerometers and other sensors. Current advanced estimators use a context-dependent approach in which a different regression model is invoked for different activities of the user. In this paper, we go a step further and use multiple contexts corresponding to multiple sensors, resulting in an ensemble of models for energy expenditure estimation. This provides a multi-view perspective, which leads to a better estimation of the energy. The proposed method was experimentally evaluated on a comprehensive set of activities where it outperformed the current state-of-the-art.},
  author = {Gjoreski, H. and Kalu\v{z}a, B. and Gams, M. and Mili\'{c}, R. and Lu\v{s}trek, M.},
  citeulike-article-id = {13534747},
  journal = {The 2013 ACM International Joint Conference on Pervasive and Ubiquitous Computing},
  pages = {359--362},
  posted-at = {2015-03-06 11:02:59},
  priority = {2},
  title = {Ensembles of multiple sensors for human energy expenditure estimation},
  volume = {2013},
  year = {2013}
  }

• S. Kozina, H. Gjoreski, M. Gams, and M. Luštrek, “Three-layer activity recognition combining domain knowledge and meta-classification,” Journal of medical and biological engineering, vol. 33, iss. 4, pp. 406-414, 2013.
  [Bibtex]

  @article{citeulike:13534741,
  abstract = {One of the essential tasks of healthcare and smart-living systems is to recognize the current activity of a particular user. Such activity recognition ({AR}) is demanding when only limited sensors are used, such as accelerometers. Given a small number of accelerometers, intelligent {AR} systems often use simple architectures, either general or specific for their {AR}. In this paper, a system for {AR} named {TriLAR} is presented. {TriLAR} has an {AR}-specific architecture consisting of three layers: (i) a bottom layer, where an arbitrary number of {AR} methods can be used to recognize the current activity; (ii) a middle layer, where the predictions from the bottom-layer methods are inputs for a hierarchical structure that combines domain knowledge and meta-classification; and (iii) a top layer, where a hidden Markov model is used to correct spurious transitions between the recognized activities from the middle layer. The middle layer has a hierarchical, three-level structure. First, a meta-classifier is used to make the initial separation between the most distinct activities. Second, domain knowledge in the form of rules is used to differentiate between the remaining activities, recognizing those of interest (i.e., static activities). Third, another meta-classifier deals with the remaining activities. In this way, each activity is recognized by the method best suited to it, leaving unrecognized activities to the next method. This architecture was tested on a dataset recorded using ten volunteers who acted out a complex, real-life scenario while wearing accelerometers placed on the chest, thigh, and ankle. The results show that {TriLAR} successfully recognized elementary activities using one or two sensors and significantly outperformed three standard, single-layer methods with all sensor placements.},
  author = {Kozina, S. and Gjoreski, H. and Gams, M. and Lu\v{s}trek, M.},
  citeulike-article-id = {13534741},
  journal = {Journal of Medical and Biological Engineering},
  number = {4},
  pages = {406--414},
  posted-at = {2015-03-06 10:55:18},
  priority = {2},
  title = {Three-layer activity recognition combining domain knowledge and meta-classification},
  volume = {33},
  year = {2013}
  }

• E. Dovgan, M. Javorski, T. Tušar, M. Gams, and B. Filipič, “Comparing a multiobjective optimization algorithm for discovering driving strategies with humans,” Expert systems with applications, vol. 40, iss. 7, pp. 2687-2695, 2013.
  [Bibtex]

  @article{citeulike:13534670,
  abstract = {When a person drives a vehicle along a route, he/she optimizes two objectives, the traveling time and the fuel consumption. Therefore, the task of driving can be viewed as a multiobjective optimization problem and solved with appropriate optimization algorithms. The comparison between the driving strategies obtained by humans and those obtained by the algorithms is interesting from several points of view. For example, it is interesting to see which strategies are better. To perform the human versus machine test, we compared the driving strategies obtained by the multiobjective optimization algorithm for discovering driving strategies ({MODS}) with those obtained by a group of volunteers operating a vehicle simulator. The test was performed using data from three real-world routes. The results show that {MODS} always finds better driving strategies than the volunteers, especially when the fuel consumption is to be reduced. Moreover, the results show that some volunteers always drive similarly in terms of traveling time and fuel consumption while others significantly vary their driving strategies.},
  author = {Dovgan, E. and Javorski, M. and Tu\v{s}ar, T. and Gams, M. and Filipi\v{c}, B.},
  citeulike-article-id = {13534670},
  journal = {Expert Systems with Applications},
  month = jun,
  number = {7},
  pages = {2687--2695},
  posted-at = {2015-03-06 08:35:43},
  priority = {2},
  title = {Comparing a multiobjective optimization algorithm for discovering driving strategies with humans},
  volume = {40},
  year = {2013}
  }

• M. Depolli, R. Trobec, and B. Filipič, “Asynchronous master-slave parallelization of differential evolution for multiobjective optimization,” Evolutionary computation, vol. 21, iss. 2, pp. 261-291, 2013.
  [Bibtex]

  @article{citeulike:13534667,
  author = {Depolli, M. and Trobec, R. and Filipi\v{c}, B.},
  citeulike-article-id = {13534667},
  journal = {Evolutionary Computation},
  number = {2},
  pages = {261--291},
  posted-at = {2015-03-06 08:30:15},
  priority = {2},
  title = {Asynchronous master-slave parallelization of differential evolution for multiobjective optimization},
  volume = {21},
  year = {2013}
  }

• H. Gjoreski, B. Kaluza, M. Gams, R. Milic, and M. Lustrek, “Ensembles of multiple sensors for human energy expenditure estimation,” in Ubicomp, 2013, pp. 359-362.
  [Bibtex]

  @inproceedings{DBLP:conf/huc/GjoreskiKGML13,
  author = {Gjoreski, Hristijan and Kaluza, Bostjan and Gams, Matjaz and Milic, Radoje and Lustrek, Mitja},
  booktitle = {UbiComp},
  citeulike-article-id = {12721199},
  editor = {Mattern, Friedemann and Santini, Silvia and Canny, John F. and Langheinrich, Marc and Rekimoto, Jun},
  pages = {359--362},
  posted-at = {2013-10-14 15:05:09},
  priority = {5},
  publisher = {ACM},
  title = {Ensembles of multiple sensors for human energy expenditure estimation},
  year = {2013}
  }

2012

• H. Gjoreski, M. Lustrek, and M. Gams, “Context-Based fall detection using inertial and location sensors,” in Ami, 2012, pp. 1-16.
  [Bibtex]

  @inproceedings{DBLP:conf/ami/GjoreskiLG12,
  author = {Gjoreski, Hristijan and Lustrek, Mitja and Gams, Matjaz},
  booktitle = {AmI},
  citeulike-article-id = {12721201},
  editor = {Patern{\`{o}}, Fabio and de Ruyter, Boris E. R. and Markopoulos, Panos and Santoro, Carmen and van Loenen, Evert and Luyten, Kris},
  pages = {1--16},
  posted-at = {2013-10-14 15:07:43},
  priority = {2},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {{Context-Based} Fall Detection Using Inertial and Location Sensors},
  volume = {7683},
  year = {2012}
  }

• M. Luštrek, I. Bratko, and M. Gams, “Independent-valued minimax: pathological or beneficial?,” Theoretical computer science, vol. 422, pp. 59-77, 2012.
  [Bibtex]

  @article{citeulike:10163023,
  abstract = {Minimax search, which is used by most game-playing programs, is considered pathological when deeper searches produce worse evaluations than shallower ones. This phenomenon was first observed in theoretical analyses under seemingly reasonable conditions. It was most commonly explained by the lack of dependence between nearby positions in the analyses: if nearby positions have similar values, as is typically the case in real games, the pathology no longer occurs. In this paper we show that the pathology can be eliminated even without position-value dependence, by assigning enough different values to the positions and modeling the heuristic error as normally distributed noise that is independent of the depth in the game tree. This leads to the conclusion that minimax is less prone to the pathology than was previously thought and indicates the importance of the number of different position values.},
  author = {Lu\v{s}trek, Mitja and Bratko, Ivan and Gams, Matja\v{z}},
  citeulike-article-id = {10163023},
  citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.tcs.2011.11.033},
  doi = {10.1016/j.tcs.2011.11.033},
  issn = {03043975},
  journal = {Theoretical Computer Science},
  month = mar,
  pages = {59--77},
  posted-at = {2012-10-23 08:48:33},
  priority = {2},
  title = {Independent-valued minimax: Pathological or beneficial?},
  url = {http://dx.doi.org/10.1016/j.tcs.2011.11.033},
  volume = {422},
  year = {2012}
  }

• B. Pogorelc, R. Vatavu, A. Lugmayr, B. Stockleben, T. Risse, J. Kaario, E. C. Lomonaco, and M. Gams, “Semantic ambient media: from ambient advertising to ambient-assisted living,” Multimedia tools and applications, vol. 58, iss. 2, pp. 399-425, 2012.
  [Bibtex]

  @article{citeulike:10498963,
  abstract = {The term ambient media was in its beginning used only for ambient advertising. Nowadays it denotes the media environment and the communication of information in ubiquitous and pervasive environments. With the addition of intelligence, the new field of semantic ambient media was established. In recent years, the field of semantic ambient media has spread its span from only a few sub-areas, such as ambient advertising, to new ones, such as ambient-assisted living ({AAL}) and health-monitoring media , significantly supported by intelligence. The study presented in this paper provides an advanced introduction to the field of semantic ambient media including the solutions for threat issues and illustration of success stories of the field. It conducts a survey of the related work and presents a thorough discussion of it. The related work is grouped according to the coverage of the principles of semantic ambient media. Based on the state-of-the-art research, the future possibilities of the field are demonstrated, especially for the ambient-assisted living, audio-visual rendering of media objects, user design principles and the society impact of the field. The paper provides ideas for impacting ambient media and directions and questions for further research. It also discusses the potential of the combination of several research studies.},
  author = {Pogorelc, Bogdan and Vatavu, Radu-Daniel and Lugmayr, Artur and Stockleben, Bj\"{o}rn and Risse, Thomas and Kaario, Juha and Lomonaco, Estefania C. and Gams, Matja\v{z}},
  citeulike-article-id = {10498963},
  citeulike-linkout-0 = {http://dx.doi.org/10.1007/s11042-011-0917-8},
  citeulike-linkout-1 = {http://www.springerlink.com/content/903741847563716v},
  day = {1},
  doi = {10.1007/s11042-011-0917-8},
  issn = {1380-7501},
  journal = {Multimedia Tools and Applications},
  month = may,
  number = {2},
  pages = {399--425},
  posted-at = {2012-10-23 08:48:04},
  priority = {2},
  publisher = {Springer Netherlands},
  title = {Semantic ambient media: From ambient advertising to ambient-assisted living},
  url = {http://dx.doi.org/10.1007/s11042-011-0917-8},
  volume = {58},
  year = {2012}
  }

• B. Pogorelc, M. Gams, and Z. Bosnić, “Automatic recognition of gait-related health problems in the elderly using machine learning,” Multimedia tools and applications, vol. 58, iss. 2, pp. 333-354, 2012.
  [Bibtex]

  @article{citeulike:11530324,
  author = {Pogorelc, Bogdan and Gams, Matja\v{z} and Bosni\'{c}, Zoran},
  citeulike-article-id = {11530324},
  journal = {Multimedia tools and applications},
  number = {2},
  pages = {333--354},
  posted-at = {2012-10-23 08:45:48},
  priority = {2},
  title = {Automatic recognition of gait-related health problems in the elderly using machine learning},
  volume = {58},
  year = {2012}
  }

• B. Pogorelc and M. Gams, “Recognition of patterns of health problems and falls in the elderly using data mining,” Lect. notes comput, vol. 7441, pp. 463-471, 2012.
  [Bibtex]

  @article{citeulike:11530304,
  author = {Pogorelc, Bogdan and Gams, Matja\v{z}},
  citeulike-article-id = {11530304},
  journal = {Lect. notes comput},
  pages = {463--471},
  posted-at = {2012-10-23 08:23:55},
  priority = {2},
  title = {Recognition of patterns of health problems and falls in the elderly using data mining},
  volume = {7441},
  year = {2012}
  }

• H. Solar, E. Fernandez, G. Tartaricos, G. Pioggia, B. Cvetković, S. Kozina, M. Luštrek, and J. Lampe, “A non invasive, wearable sensor platform for multi-parametric remote monitoring in CHF patients,” Lect. notes comput, vol. 7251, pp. 140-147, 2012.
  [Bibtex]

  @article{citeulike:11530302,
  author = {Solar, Hector and Fernandez, Erik and Tartaricos, Gannaro and Pioggia, Giovanni and Cvetkovi\'{c}, Bo\v{z}idara and Kozina, Simon and Lu\v{s}trek, Mitja and Lampe, Jure},
  citeulike-article-id = {11530302},
  journal = {Lect. notes comput},
  pages = {140--147},
  posted-at = {2012-10-23 08:19:06},
  priority = {2},
  title = {A non invasive, wearable sensor platform for multi-parametric remote monitoring in {CHF} patients},
  volume = {7251},
  year = {2012}
  }

• M. Možina, M. Guid, A. Sadikov, V. Groznik, and I. Bratko, “Goal-oriented conceptualization of procedural knowledge,” Lect. notes comput. sci., pp. 286-291, 2012.
  [Bibtex]

  @article{citeulike:11522184,
  author = {Mo\v{z}ina, Martin and Guid, Matej and Sadikov, Aleksander and Groznik, Vida and Bratko, Ivan},
  citeulike-article-id = {11522184},
  journal = {Lect. notes comput. sci.},
  pages = {286--291},
  posted-at = {2012-10-22 10:10:55},
  priority = {2},
  title = {Goal-oriented conceptualization of procedural knowledge},
  year = {2012}
  }

• B. Pogorelc and M. Gams, “Home-based health monitoring of the elderly through gait recognition,” Journal of ambient intelligence and smart environments, vol. 4, iss. 5, pp. 415-428, 2012.
  [Bibtex]

  @article{citeulike:11522145,
  author = {Pogorelc, Bogdan and Gams, Matja\v{z}},
  citeulike-article-id = {11522145},
  journal = {Journal of ambient intelligence and smart environments},
  number = {5},
  pages = {415--428},
  posted-at = {2012-10-22 10:06:13},
  priority = {2},
  title = {Home-based health monitoring of the elderly through gait recognition},
  volume = {4},
  year = {2012}
  }

• P. Korošec, J. Šilc, and B. Filipič, “The differential ant-stigmergy algorithm,” Inf. sci., vol. 192, iss. 1, pp. 82-97, 2012.
  [Bibtex]

  @article{citeulike:11522107,
  author = {Koro\v{s}ec, Peter and \v{S}ilc, Jurij and Filipi\v{c}, Bogdan},
  citeulike-article-id = {11522107},
  journal = {Inf. sci.},
  number = {1},
  pages = {82--97},
  posted-at = {2012-10-22 10:01:14},
  priority = {2},
  title = {The differential ant-stigmergy algorithm},
  volume = {192},
  year = {2012}
  }

• A. Iqbal, H. van der Heijden, M. Guid, and A. Makhmali, “Evaluating the aesthetics of endgame studies : a computational model of human aesthetic perception,” Ieee trans, vol. 4, iss. 3, pp. 178-191, 2012.
  [Bibtex]

  @article{citeulike:11522043,
  author = {Iqbal, Azlan and van der Heijden, Harold and Guid, Matej and Makhmali, Ali},
  citeulike-article-id = {11522043},
  journal = {IEEE trans},
  number = {3},
  pages = {178--191},
  posted-at = {2012-10-22 09:52:10},
  priority = {2},
  title = {Evaluating the aesthetics of endgame studies : a computational model of human aesthetic perception},
  volume = {4},
  year = {2012}
  }

• A. Som, M. Luštrek, N. K. Singh, and G. Fuellen, “Derivation of an interaction/regulation network describing pluripotency in human,” Gene, vol. 502, iss. 2, pp. 99-107, 2012.
  [Bibtex]

  @article{citeulike:10695226,
  abstract = {Identification of the key genes/proteins of pluripotency and their interrelationships is an important step in understanding the induction and maintenance of pluripotency. Experimental approaches have accumulated large amounts of interaction/regulation data in mouse. We investigate how far such information can be transferred to human, the species of maximum interest, for which experimental data are much more limited. To address this issue, we mapped an existing mouse pluripotency network (the {PluriNetWork}) to human. We transferred interaction and regulation links between genes/proteins from mouse to human on the basis of orthologous relationship of the genes/proteins (called interolog mapping). To reduce the number of false positives, we used four different methods: phylogenetic profiling, Gene Ontology semantic similarity, gene co-expression, and {RNA} interference ({RNAi}) data. The methods and the resulting networks were evaluated by a novel approach using the information about the genes known to be involved in pluripotency from the literature. The {RNAi} method proved best for filtering out unlikely interactions, so it was used to construct the final human pluripotency network. The {RNAi} data are based on human embryonic stem cells ({hESCs}) that are generally considered to be in a (primed) epiblast stem cell state. Therefore, we assume that the final human network may reflect the (primed) epiblast stem cell state more closely, while the mouse network reflects the (unprimed/na\"{i}ve) embryonic stem cell state more closely. \^{a}–º We derived a putative human pluripotency network from mouse. \^{a}–º We filtered the interactions using four different methods. \^{a}–º The resulting networks were evaluated against the literature using a novel approach. \^{a}–º The best method ({RNAi}) was used to construct the final human pluripotency network. \^{a}–º We examined why the most widely used methods performed worse than the {RNAi} method.},
  author = {Som, Anup and Lu\v{s}trek, Mitja and Singh, Nitesh K. and Fuellen, Georg},
  citeulike-article-id = {10695226},
  citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.gene.2012.04.025},
  doi = {10.1016/j.gene.2012.04.025},
  issn = {03781119},
  journal = {Gene},
  month = jul,
  number = {2},
  pages = {99--107},
  posted-at = {2012-10-22 09:48:05},
  priority = {2},
  title = {Derivation of an interaction/regulation network describing pluripotency in human},
  url = {http://dx.doi.org/10.1016/j.gene.2012.04.025},
  volume = {502},
  year = {2012}
  }

• M. Depolli, R. Trobec, and B. Filipič, “Asynchronous Master-Slave parallelization of differential evolution for Multi-Objective optimization,” Evolutionary computation, pp. 1-31, 2012.
  [Bibtex]

  @article{citeulike:11522000,
  abstract = {Abstract In this paper, we present {AMS}-{DEMO}, an asynchronous master-slave implementation of {DEMO}, an evolutionary algorithm for multi-objective optimization. {AMS}-{DEMO} was designed for solving time-intensive problems efficiently on both homogeneous and heterogeneous parallel computer architectures. The algorithm is used as a test case for the asynchronous master-slave parallelization of multi-objective optimization that has not yet been thoroughly investigated. Selection lag is identified as the key property of the parallelization method, which explains how its behavior depends on the type of computer architecture and the number of processors. It is arrived at analytically and from the empirical results. {AMS}-{DEMO} is tested on a benchmark problem and a time-intensive industrial optimization problem, on homogeneous and heterogeneous parallel setups, providing performance results for the algorithm and an insight into the parallelization method. A comparison is also performed between {AMS}-{DEMO} and generational master-slave {DEMO} to demonstrate how the asynchronous parallelization method enhances the algorithm and what benefits it brings compared to the synchronous method.},
  author = {Depolli, Matja\v{z} and Trobec, Roman and Filipi\v{c}, Bogdan},
  citeulike-article-id = {11522000},
  citeulike-linkout-0 = {http://dx.doi.org/10.1162/evco\_a\_00076},
  citeulike-linkout-1 = {http://www.mitpressjournals.org/doi/abs/10.1162/EVCO\_a\_00076},
  day = {27},
  doi = {10.1162/evco\_a\_00076},
  journal = {Evolutionary Computation},
  month = mar,
  pages = {1--31},
  posted-at = {2012-10-22 09:47:24},
  priority = {2},
  publisher = {MIT Press},
  title = {Asynchronous {Master-Slave} Parallelization of Differential Evolution for {Multi-Objective} Optimization},
  url = {http://dx.doi.org/10.1162/evco\_a\_00076},
  year = {2012}
  }

• M. Guid and I. Bratko, “Detecting fortresses in chess,” Elektrotehniški vestnik, vol. 79, iss. 1/2, pp. 35-40, 2012.
  [Bibtex]

  @article{citeulike:11521994,
  author = {Guid, Matej and Bratko, Ivan},
  citeulike-article-id = {11521994},
  journal = {Elektrotehni\v{s}ki vestnik},
  number = {1/2},
  pages = {35--40},
  posted-at = {2012-10-22 09:46:44},
  priority = {2},
  title = {Detecting fortresses in chess},
  volume = {79},
  year = {2012}
  }

• D. Marinčič, T. Šef, and M. Gams, “Parsing with clause and intraclausal coordination detection,” Comput. inform., vol. 31, iss. 2, pp. 299-329, 2012.
  [Bibtex]

  @article{citeulike:11521973,
  author = {Marin\v{c}i\v{c}, Domen and \v{S}ef, Toma\v{z} and Gams, Matja\v{z}},
  citeulike-article-id = {11521973},
  journal = {Comput. inform.},
  number = {2},
  pages = {299--329},
  posted-at = {2012-10-22 09:43:58},
  priority = {2},
  title = {Parsing with clause and intraclausal coordination detection},
  volume = {31},
  year = {2012}
  }

• I. Fister, M. Mernik, and B. Filipič, “Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm,” Computational optimization and applications, pp. 1-30, 2012.
  [Bibtex]

  @article{citeulike:10858437,
  abstract = {This paper proposes a hybrid self-adaptive evolutionary algorithm for graph coloring that is hybridized with the following novel elements: heuristic genotype-phenotype mapping, a swap local search heuristic, and a neutral survivor selection operator. This algorithm was compared with the evolutionary algorithm with the {SAW} method of Eiben et al., the Tabucol algorithm of Hertz and de Werra, and the hybrid evolutionary algorithm of Galinier and Hao. The performance of these algorithms were tested on a test suite consisting of randomly generated 3-colorable graphs of various structural features, such as graph size, type, edge density, and variability in sizes of color classes. Furthermore, the test graphs were generated including the phase transition where the graphs are hard to color. The purpose of the extensive experimental work was threefold: to investigate the behavior of the tested algorithms in the phase transition, to identify what impact hybridization with the {DSatur} traditional heuristic has on the evolutionary algorithm, and to show how graph structural features influence the performance of the graph-coloring algorithms. The results indicate that the performance of the hybrid self-adaptive evolutionary algorithm is comparable with, or better than, the performance of the hybrid evolutionary algorithm which is one of the best graph-coloring algorithms today. Moreover, the fact that all the considered algorithms performed poorly on flat graphs confirms that graphs of this type are really the hardest to color.},
  author = {Fister, Iztok and Mernik, Marjan and Filipi\v{c}, Bogdan},
  citeulike-article-id = {10858437},
  citeulike-linkout-0 = {http://dx.doi.org/10.1007/s10589-012-9496-5},
  citeulike-linkout-1 = {http://www.springerlink.com/content/n528782g88471r51},
  day = {28},
  doi = {10.1007/s10589-012-9496-5},
  issn = {0926-6003},
  journal = {Computational Optimization and Applications},
  month = jun,
  pages = {1--30},
  posted-at = {2012-10-22 09:18:14},
  priority = {2},
  publisher = {Springer Netherlands},
  title = {Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm},
  url = {http://dx.doi.org/10.1007/s10589-012-9496-5},
  year = {2012}
  }

• V. Groznik, M. Guid, A. Sadikov, M. Možina, D. Georgiev, V. Kragelj, S. Ribarič, Z. Pirtošek, and I. Bratko, “Elicitation of neurological knowledge with argument-based machine learning,” Artificial intelligence in medicine, 2012.
  [Bibtex]

  @article{citeulike:11480432,
  abstract = {The paper describes the use of expert's knowledge in practice and the efficiency of a recently developed technique called argument-based machine learning ({ABML}) in the knowledge elicitation process. We are developing a neurological decision support system to help the neurologists differentiate between three types of tremors: Parkinsonian, essential, and mixed tremor (comorbidity). The system is intended to act as a second opinion for the neurologists, and most importantly to help them reduce the number of patients in the ” gray area” that require a very costly further examination ({DaTSCAN}). We strive to elicit comprehensible and medically meaningful knowledge in such a way that it does not come at the cost of diagnostic accuracy. To alleviate the difficult problem of knowledge elicitation from data and domain experts, we used {ABML}. {ABML} guides the expert to explain critical special cases which cannot be handled automatically by machine learning. This very efficiently reduces the expert's workload, and combines expert's knowledge with learning data. 122 patients were enrolled into the study. The classification accuracy of the final model was 91\%. Equally important, the initial and the final models were also evaluated for their comprehensibility by the neurologists. All 13 rules of the final model were deemed as appropriate to be able to support its decisions with good explanations. The paper demonstrates {ABML}'s advantage in combining machine learning and expert knowledge. The accuracy of the system is very high with respect to the current state-of-the-art in clinical practice, and the system's knowledge base is assessed to be very consistent from a medical point of view. This opens up the possibility to use the system also as a teaching tool.},
  author = {Groznik, Vida and Guid, Matej and Sadikov, Aleksander and Mo\v{z}ina, Martin and Georgiev, Dejan and Kragelj, Veronika and Ribari\v{c}, Samo and Pirto\v{s}ek, Zvezdan and Bratko, Ivan},
  citeulike-article-id = {11480432},
  citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.artmed.2012.08.003},
  doi = {10.1016/j.artmed.2012.08.003},
  issn = {09333657},
  journal = {Artificial Intelligence in Medicine},
  month = oct,
  posted-at = {2012-10-22 09:14:41},
  priority = {2},
  title = {Elicitation of neurological knowledge with argument-based machine learning},
  url = {http://dx.doi.org/10.1016/j.artmed.2012.08.003},
  year = {2012}
  }

• B. Kaluža and M. Gams, “Analysis of daily-living dynamics,” Journal of ambient intelligence and smart environments, vol. 4, iss. 5, pp. 403-413, 2012.
  [Bibtex]

  @article{citeulike:11494838,
  abstract = {Analysis of daily-living behavior is an important approach to assess the wellbeing of an elderly person that lives at home alone. This paper presents an approach to monitoring an individual in the home environment by an ambient-intelligence system in order to detect anomalies in daily-living patterns. The proposed method is based on transforming the sequence of posture and spatial information using a novel matrix presentation to extract spatial-activity features. Then, an outlier-detection method is used for a classification of the individual's usual and unusual daily patterns regardless, of the cause of the problem, be it physical or mental. Experiments indicate that the proposed algorithm successfully discriminates between the daily behavior patterns of a healthy person and those with health problems.},
  author = {Kalu\v{z}a, Bo\v{s}tjan and Gams, Matja\v{z}},
  citeulike-article-id = {11494838},
  citeulike-linkout-0 = {http://dx.doi.org/10.3233/ais-2012-0164},
  citeulike-linkout-1 = {http://iospress.metapress.com/content/b0028w7r82674x71},
  day = {1},
  doi = {10.3233/ais-2012-0164},
  journal = {Journal of Ambient Intelligence and Smart Environments},
  month = jan,
  number = {5},
  pages = {403--413},
  posted-at = {2012-10-19 13:37:23},
  priority = {2},
  title = {Analysis of daily-living dynamics},
  url = {http://dx.doi.org/10.3233/ais-2012-0164},
  volume = {4},
  year = {2012}
  }

• B. Kaluža, M. Luštrek, E. Dovgan, and M. Gams, “Context-aware MAS to support elderly people,” in Proceedings of the 11th international conference on autonomous agents and multiagent systems, Richland, SC, 2012.
  [Bibtex]

  @inproceedings{Kaluza:2012:CMS:2343896.2344073,
  address = {Richland, SC},
  author = {Kalu\v{z}a, Bo\v{s}tjan and Lu\v{s}trek, Mitja and Dovgan, Erik and Gams, Matja\v{z}},
  booktitle = {Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems},
  citeulike-article-id = {11099086},
  citeulike-linkout-0 = {http://dl.acm.org/citation.cfm?id=2343896.2344073},
  keywords = {ambient, assisted, care, detection, disability, elderly, fall, general, health, intelligence, living},
  location = {Valencia, Spain},
  posted-at = {2012-08-21 08:25:53},
  priority = {2},
  publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
  series = {AAMAS '12},
  title = {Context-aware {MAS} to support elderly people},
  url = {http://dl.acm.org/citation.cfm?id=2343896.2344073},
  year = {2012}
  }

• S. Muggleton, L. Raedt, D. L. Poole, I. Bratko, A. Flach Peter, K. Inoue, and A. Sprinivasan, “ILP turns 20: biography and future challenges,” Machine learning, vol. 86, iss. 1, pp. 3-23, 2012.
  [Bibtex]

  @article{citeulike:10542007,
  author = {Muggleton, Stephen and Raedt, Luc and Poole, David L. and Bratko, Ivan and Flach Peter, A. and Inoue, Katsumi and Sprinivasan, Ashwin},
  citeulike-article-id = {10542007},
  journal = {Machine learning},
  month = jan,
  number = {1},
  pages = {3--23},
  posted-at = {2012-04-06 13:06:12},
  priority = {2},
  title = {{ILP} turns 20: biography and future challenges},
  volume = {86},
  year = {2012}
  }

• M. Luštrek, I. Bratko, and M. Gams, “Independent-valued minimax: pathological of beneficial?,” Theoretical computer science, vol. 442, pp. 59-77, 2012.
  [Bibtex]

  @article{citeulike:10541956,
  author = {Lu\v{s}trek, Mitja and Bratko, Ivan and Gams, Matja\v{z}},
  citeulike-article-id = {10541956},
  citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.tcs.2011.11.033},
  citeulike-linkout-1 = {http://dx.doi.org/10.1016/j.tcs.2011.11.033},
  doi = {10.1016/j.tcs.2011.11.033},
  journal = {Theoretical Computer Science},
  month = mar,
  pages = {59--77},
  posted-at = {2012-04-06 11:51:06},
  priority = {2},
  title = {Independent-valued minimax: Pathological of beneficial?},
  url = {http://dx.doi.org/10.1016/j.tcs.2011.11.033},
  volume = {442},
  year = {2012}
  }

• B. Kaluža, G. Kaminka, and M. Tambe, “Detection of suspicious behavior from a sparse set of multiagent interactions,” in Aamas 2012, 2012.
  [Bibtex]

  @inproceedings{citeulike:10511030,
  author = {Kalu\v{z}a, B. and Kaminka, G. and Tambe, M.},
  booktitle = {AAMAS 2012},
  citeulike-article-id = {10511030},
  citeulike-linkout-0 = {http://teamcore.usc.edu/papers/2012/paper-aamas2012.cr.pdf},
  month = jun,
  posted-at = {2012-03-29 09:02:05},
  priority = {2},
  title = {Detection of suspicious behavior from a sparse set of multiagent interactions},
  url = {http://teamcore.usc.edu/papers/2012/paper-aamas2012.cr.pdf},
  year = {2012}
  }

• R. Piltaver, M. Luštrek, and M. Gams, “The pathology of heuristic search in the 8-puzzle,” Journal of experimental & theoretical artificial intelligence, vol. 24, iss. 1, pp. 65-94, 2012.
  [Bibtex]

  @article{citeulike:10102466,
  abstract = {In practice, an incomplete heuristic search nearly always finds better solutions if it is allowed to search deeper, i.e. expand and heuristically evaluate more nodes in the search tree. On the rare occasions when searching deeper is not beneficial, a curious phenomenon called 'search pathology' occurs. In this article, we study the pathology and gain of a deeper search of the minimin algorithm in the 8-puzzle, a domain often used for evaluating single-agent search algorithms. We have analysed the influence of various properties of the search tree and the heuristic evaluation function on the gain and the pathology. In order to investigate a broad range of the properties, the original 8-puzzle was extended with diagonal moves, yielding a larger variety of search trees. It turned out that in the 8-puzzle, a substantial proportion of the solvable positions is pathological under various parameters. More importantly, the search parameters that enable the highest gains are quite consistent in pathological and non-pathological positions alike, thus pointing to potentially successful search strategies.},
  author = {Piltaver, Rok and Lu\v{s}trek, Mitja and Gams, Matja\v{z}},
  citeulike-article-id = {10102466},
  citeulike-linkout-0 = {http://dx.doi.org/10.1080/0952813x.2010.545997},
  citeulike-linkout-1 = {http://www.tandfonline.com/doi/abs/10.1080/0952813X.2010.545997},
  day = {20},
  doi = {10.1080/0952813x.2010.545997},
  journal = {Journal of Experimental \& Theoretical Artificial Intelligence},
  month = jan,
  number = {1},
  pages = {65--94},
  posted-at = {2011-12-07 10:40:56},
  priority = {2},
  publisher = {Taylor \& Francis},
  title = {The pathology of heuristic search in the 8-puzzle},
  url = {http://dx.doi.org/10.1080/0952813x.2010.545997},
  volume = {24},
  year = {2012}
  }

• P. Korošec, J. Šilc, and B. Filipič, “The differential ant-stigmergy algorithm,” Information sciences, vol. 192, pp. 82-97, 2012.
  [Bibtex]

  @article{citeulike:7156125,
  abstract = {Ant-colony optimization ({ACO}) is a popular swarm intelligence scheme known for its efficiency in solving combinatorial optimization problems. However, despite some extensions of this approach to continuous optimization, high-dimensional problems remain a challenge for {ACO}. This paper presents an {ACO}-based algorithm for numerical optimization capable of solving high-dimensional real-parameter optimization problems. The algorithm, called the Differential {Ant-Stigmergy} Algorithm ({DASA}), transforms a real-parameter optimization problem into a graph-search problem. The parameters' differences assigned to the graph vertices are used to navigate through the search space. We compare the algorithm results with the results of previous studies on recent benchmark functions and show that the {DASA} is a competitive continuous optimization algorithm that solves high-dimensional problems effectively and efficiently.},
  author = {Koro\v{s}ec, Peter and \v{S}ilc, Jurij and Filipi\v{c}, Bogdan},
  citeulike-article-id = {7156125},
  citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.ins.2010.05.002},
  day = {06},
  doi = {10.1016/j.ins.2010.05.002},
  issn = {00200255},
  journal = {Information Sciences},
  month = jun,
  pages = {82--97},
  posted-at = {2011-12-07 09:47:14},
  priority = {2},
  title = {The differential ant-stigmergy algorithm},
  url = {http://dx.doi.org/10.1016/j.ins.2010.05.002},
  volume = {192},
  year = {2012}
  }

• B. Pogorelc, Z. Bosnić, and M. Gams, “Automatic recognition of gait-related health problems in the elderly using machine learning,” Multimedia tools and applications, vol. 58, iss. 2, pp. 333-354, 2012.
  [Bibtex]

  @article{citeulike:10039840,
  abstract = {This paper proposes a system for the early automatic recognition of health problems that manifest themselves in distinctive form of gait. Purpose of the system is to prolong the autonomous living of the elderly at home. When the system identifies a health problem, it automatically notifies a physician and provides an explanation of the automatic diagnosis. The gait of the elderly user is captured using a motion-capture system, which consists of body-worn tags and wall-mounted sensors. The positions of the tags are acquired by the sensors and the resulting time series of position coordinates are analyzed with machine-learning algorithms in order to recognize a specific health problem. Novel semantic features based on medical knowledge for training a machine-learning classifier are proposed in this paper. The classifier classifies the user's gait into: 1) normal, 2) with hemiplegia, 3) with Parkinson's disease, 4) with pain in the back and 5) with pain in the leg. The studies of 1) the feasibility of automatic recognition and 2) the impact of tag placement and noise level on the accuracy of the recognition of health problems are presented. The experimental results of the first study (12 tags, no noise) showed that the k-nearest neighbors and neural network algorithms achieved classification accuracies of 100\%. The experimental results of the second study showed that classification accuracy of over 99\% is achievable using several machine-learning algorithms and 8 or more tags with up to 15 mm standard deviation of noise. The results show that the proposed approach achieves high classification accuracy and can be used as a guide for further studies in the increasingly important area of Ambient Assisted Living. Since the system uses semantic features and an artificial-intelligence approach to interpret the health state, provides a natural explanation of the hypothesis and is embedded in the domestic environment of the elderly person; it is an example of the semantic ambient media for Ambient Assisted Living.},
  author = {Pogorelc, Bogdan and Bosni\'{c}, Zoran and Gams, Matja\v{z}},
  citeulike-article-id = {10039840},
  citeulike-linkout-0 = {http://www.springerlink.com/content/b1126m4t20742774/fulltext.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1007/s11042-011-0786-1},
  citeulike-linkout-2 = {http://www.springerlink.com/content/b1126m4t20742774},
  day = {1},
  doi = {10.1007/s11042-011-0786-1},
  issn = {1380-7501},
  journal = {Multimedia Tools and Applications},
  month = may,
  number = {2},
  pages = {333--354},
  posted-at = {2011-11-30 10:18:09},
  priority = {2},
  publisher = {Springer Netherlands},
  title = {Automatic recognition of gait-related health problems in the elderly using machine learning},
  url = {http://www.springerlink.com/content/b1126m4t20742774/fulltext.pdf},
  volume = {58},
  year = {2012}
  }

2011

• H. Gjoreski, M. Lustrek, and M. Gams, “Accelerometer placement for posture recognition and fall detection,” Intelligent environments, international conference on, pp. 47-54, 2011.
  [Bibtex]

  @article{conf/intenv/GjoreskiLG11,
  abstract = {This paper presents an approach to fall detection with accelerometers that exploits posture recognition to identify postures that may be the result of a fall. Posture recognition as a standalone task was also studied. Nine placements of up to four sensors were considered: on the waist, chest, thigh and ankle. The results are compared to the results of a system using ultra wide band location sensors on a scenario consisting of events difficult to recognize as falls or non-falls. Three accelerometers proved sufficient to correctly recognize all the events except one(a slow fall). The location-based system was comparable to two accelerometers, except that it was able to recognize the slow fall because it resulted in lying outside the bed, whose location was known to the system. One accelerometer was able to recognize only the most clear-cut fall. Two accelerometers achieved over 90\% accuracy of posture recognition, which was better than the location-based system. Chest and waist accelerometers proved best at both tasks, with the chest accelerometer having a slight advantage in posture recognition.},
  address = {Los Alamitos, CA, USA},
  author = {Gjoreski, Hristijan and Lustrek, Mitja and Gams, Matjaz},
  citeulike-article-id = {11077271},
  citeulike-linkout-0 = {http://doi.ieeecomputersociety.org/10.1109/IE.2011.11},
  citeulike-linkout-1 = {http://dx.doi.org/10.1109/ie.2011.11},
  doi = {10.1109/ie.2011.11},
  isbn = {978-0-7695-4452-6},
  journal = {Intelligent Environments, International Conference on},
  keywords = {activity-recognition, ami, detection, fall},
  pages = {47--54},
  posted-at = {2012-08-17 10:19:38},
  priority = {3},
  publisher = {IEEE Computer Society},
  title = {Accelerometer Placement for Posture Recognition and Fall Detection},
  url = {http://dx.doi.org/10.1109/ie.2011.11},
  volume = {0},
  year = {2011}
  }

• M. K. Borštnar, M. Kljajić, A. Škraba, D. Kofjač, and V. Rajkovič, “The relevance of facilitation in group decision making supported by a simulation model,” System dynamics review, vol. 27, iss. 3, pp. 270-293, 2011.
  [Bibtex]

  @article{citeulike:10359402,
  abstract = {This paper addresses the impact of feedback information and facilitation on a decision-making process supported by a system dynamics model. We conducted the Solomon {Four-Group} Experiment under four conditions: (a\_1) interrupted individual determination of a strategy supported by a simulation model and a facilitator; (a\_2) interrupted individual determination of a strategy supported by a simulation model and a facilitator plus group information feedback ({GIF}); (a\_3) continuous individual determination of a strategy supported by a simulation model; and (a\_4) continuous individual determination of a strategy supported by a simulation model plus {GIF}. The observed variables were criteria function ({CF}), frequency of simulation runs ({FSR}), and insight into {GIF}. The hypotheses that a simulation model supports individual learning and additional {GIF} contributes to faster learning were confirmed. The importance of the facilitator and structure of feedback information was demonstrated and a model explaining learning in the decision process was developed. Copyright {\copyright} 2011 System Dynamics Society.},
  author = {Bor\v{s}tnar, Mirjana K. and Kljaji\'{c}, Miroljub and \v{S}kraba, Andrej and Kofja\v{c}, Davorin and Rajkovi\v{c}, Vladislav},
  citeulike-article-id = {10359402},
  citeulike-linkout-0 = {http://dx.doi.org/10.1002/sdr.460},
  day = {07},
  doi = {10.1002/sdr.460},
  issn = {08837066},
  journal = {System Dynamics Review},
  number = {3},
  pages = {270--293},
  posted-at = {2012-02-16 11:12:50},
  priority = {2},
  title = {The relevance of facilitation in group decision making supported by a simulation model},
  url = {http://dx.doi.org/10.1002/sdr.460},
  volume = {27},
  year = {2011}
  }

• K. Petrič, T. Petrič, M. Krisper, and V. Rajkovič, “User profiling on a pilot digital library with the final result of a new adaptive knowledge management solution,” Knowledge organization, vol. 38, iss. 2, pp. 96-113, 2011.
  [Bibtex]

  @article{citeulike:10359399,
  abstract = {In this article, several procedures (e.g., measurements, information retrieval analyses,
  power law, association rules, hierarchical clustering) are introduced which were made on a pilot digital library. Information retrievals of web users from 01/01/2003 to 01/01/2006 on the internal search engine of the pilot digital library have been analyzed. With the power law method of data processing, a constant information retrieval pattern has been established, stable over a longer period of time. After this, the data have been analyzed. On the basis of the accomplished measurements and analyses, a series of mental models of web users for global (educational) purposes have been developed (e.g., the metamodel of thought hierarchy of web users, the segmentation model of web users), and the users were profiled in four different groups (adventurers, observers, applicable, and know-alls). The article concludes with the construction of a new knowledge management solution called multidimensional rank thesaurus.},
  author = {Petri\v{c}, Karl and Petri\v{c}, Teodor and Krisper, Marjan and Rajkovi\v{c}, Vladislav},
  citeulike-article-id = {10359399},
  issn = {0943-7444 01/2011},
  journal = {Knowledge organization},
  location = {W\"{u}rzburg},
  number = {2},
  pages = {96--113},
  posted-at = {2012-02-16 11:11:59},
  priority = {2},
  publisher = {Ergon},
  title = {User profiling on a pilot digital library with the final result of a new adaptive knowledge management solution},
  volume = {38},
  year = {2011}
  }

• J. Krivec and M. Gams, “Data mining techniques for explaining social events,” in Knowledge-oriented applications in data mining, InTech, 2011, pp. 39-52.
  [Bibtex]

  @inbook{citeulike:10103503,
  author = {Krivec, Jana and Gams, Matja\v{z}},
  booktitle = {Knowledge-oriented applications in data mining},
  citeulike-article-id = {10103503},
  citeulike-linkout-0 = {http://www.intechopen.com/source/pdfs/13159/InTech-Data\_mining\_techniques\_for\_explaining\_social\_events.pdf},
  pages = {39--52},
  posted-at = {2011-12-07 15:40:09},
  priority = {2},
  publisher = {InTech},
  title = {Data mining techniques for explaining social events},
  url = {http://www.intechopen.com/source/pdfs/13159/InTech-Data\_mining\_techniques\_for\_explaining\_social\_events.pdf},
  year = {2011}
  }

• B. Kaluža, E. Dovgan, V. Mirchevska, B. Cvetković, M. Luštrek, and M. Gams, “A multi-agent system for remote eldercare,” in Trends in practical applications of agents and multiagent systems, Berlin, Heidelberg, 2011, pp. 33-40.
  [Bibtex]

  @inproceedings{citeulike:10103346,
  abstract = {This paper presents a case study in which a multi-agent system for care of the elderly people living at home alone is applied in order to prolong their independence. The system consists of several agents organized in groups providing robust and flexible monitoring, calling for help in the case of an emergency and issuing warnings if unusual behavior is detected. The first results and demonstrations show promising performance.},
  address = {Berlin, Heidelberg},
  author = {Kalu\v{z}a, Bo\v{s}tjan and Dovgan, Erik and Mirchevska, Violeta and Cvetkovi\'{c}, Bo\v{z}idara and Lu\v{s}trek, Mitja and Gams, Matja\v{z}},
  booktitle = {Trends in practical applications of agents and multiagent systems},
  chapter = {5},
  citeulike-article-id = {10103346},
  citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-3-642-19931-8\_5},
  citeulike-linkout-1 = {http://www.springerlink.com/content/3155j45u60164133},
  doi = {10.1007/978-3-642-19931-8\_5},
  editor = {Corchado, Juan and P\'{e}rez, Javier and Hallenborg, Kasper and Golinska, Paulina and Corchuelo, Rafael},
  isbn = {978-3-642-19930-1},
  pages = {33--40},
  posted-at = {2011-12-07 14:58:11},
  priority = {2},
  publisher = {Springer Berlin / Heidelberg},
  series = {Advances in Intelligent and Soft Computing},
  title = {A multi-agent system for remote eldercare},
  url = {http://dx.doi.org/10.1007/978-3-642-19931-8\_5},
  volume = {90},
  year = {2011}
  }

• A. Oblak and I. Bratko, “Learning from noisy data using a non-covering ILP algorithm,” in Ilp 2010, Berlin, Heidelberg, 2011, pp. 190-197.
  [Bibtex]

  @inproceedings{conf/ilp/OblakB10,
  abstract = {In this paper we describe the non-covering inductive logic programming program {HYPER}/N, concentrating mainly on noise handling as well as some other mechanisms that improve learning. We perform some experiments with {HYPER}/N on synthetic weather data with artificially added noise, and on real weather data to learn to predict the movement of rain from radar rain images and synoptic data.},
  address = {Berlin, Heidelberg},
  author = {Oblak, Andrej and Bratko, Ivan},
  booktitle = {ILP 2010},
  chapter = {22},
  citeulike-article-id = {10102503},
  citeulike-linkout-0 = {http://ilp2010.dsi.unifi.it/pdf/ilp2010\_submission\_22.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1007/978-3-642-21295-6\_22},
  citeulike-linkout-2 = {http://www.springerlink.com/content/5665798m12506072},
  doi = {10.1007/978-3-642-21295-6\_22},
  editor = {Frasconi, Paolo and Lisi, Francesca},
  isbn = {978-3-642-21294-9},
  pages = {190--197},
  posted-at = {2011-12-07 10:53:27},
  priority = {2},
  publisher = {Springer Berlin / Heidelberg},
  series = {Lecture notes in computer science},
  title = {Learning from noisy data using a non-covering {ILP} algorithm},
  url = {http://ilp2010.dsi.unifi.it/pdf/ilp2010\_submission\_22.pdf},
  volume = {6489},
  year = {2011}
  }

• V. Groznik, M. Guid, A. Sadikov, M. Možina, D. Georgiev, V. Kragelj, S. Ribarič, Z. Pirtošek, and I. Bratko, “Elicitation of neurological knowledge with ABML,” in Aime 2011, Berlin, Heidelberg, 2011, pp. 14-23.
  [Bibtex]

  @inproceedings{conf/aime/GroznikGSMGKRPB11,
  abstract = {The paper describes the process of knowledge elicitation for a neurological decision support system. To alleviate the difficult problem of knowledge elicitation from data and domain experts, we used a recently developed technique called {ABML} (Argument Based Machine Learning). The paper demonstrates {ABML}'s advantage in combining machine learning and expert knowledge. {ABML} guides the expert to explain critical special cases which cannot be handled automatically by machine learning. This very efficiently reduces the expert's workload, and combines it with automatically learned knowledge. We developed a decision support system to help the neurologists differentiate between three types of tremors: Parkinsonian, essential, and mixed tremor (co-morbidity). The system is intended to act as a second opinion for the neurologists, and most importantly to help them reduce the number of patients in the ” gray area” that require a very costly further examination ({DaTSCAN}).},
  address = {Berlin, Heidelberg},
  author = {Groznik, Vida and Guid, Matej and Sadikov, Aleksander and Mo\v{z}ina, Martin and Georgiev, Dejan and Kragelj, Veronika and Ribari\v{c}, Samo and Pirto\v{s}ek, Zvezdan and Bratko, Ivan},
  booktitle = {AIME 2011},
  chapter = {3},
  citeulike-article-id = {10102498},
  citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-3-642-22218-4\_3},
  citeulike-linkout-1 = {http://www.springerlink.com/content/l81381w4r5964xj6},
  doi = {10.1007/978-3-642-22218-4\_3},
  editor = {Peleg, Mor and Lavrac, Nada and Combi, Carlo},
  isbn = {978-3-642-22217-7},
  pages = {14--23},
  posted-at = {2011-12-07 10:51:26},
  priority = {2},
  publisher = {Springer Berlin / Heidelberg},
  series = {Lecture notes in computer science},
  title = {Elicitation of neurological knowledge with {ABML}},
  url = {http://dx.doi.org/10.1007/978-3-642-22218-4\_3},
  volume = {6747},
  year = {2011}
  }

• D. Petelin, B. Filipič, and J. Kocijan, “Optimization of gaussian process models with evolutionary algorithms,” in Icannga 2011 (1), Berlin, Heidelberg, 2011, pp. 420-429.
  [Bibtex]

  @inproceedings{conf/icannga/PetelinFK11,
  abstract = {Gaussian process ({GP}) models are non-parametric, black-box models that represent a new method for system identification. The optimization of {GP} models, due to their probabilistic nature, is based on maximization of the probability of the model. This probability can be calculated by the marginal likelihood. Commonly used approaches for maximizing the marginal likelihood of {GP} models are the deterministic optimization methods. However, their success critically depends on the initial values. In addition, the marginal likelihood function often has a lot of local minima in which the deterministic method can be trapped. Therefore, stochastic optimization methods can be considered as an alternative approach. In this paper we test their applicability in {GP} model optimization. We performed a comparative study of three stochastic algorithms: the genetic algorithm, differential evolution, and particle swarm optimization. Empirical tests were carried out on a benchmark problem of modeling the concentration of {CO} 2 in the atmosphere. The results indicate that with proper tuning differential evolution and particle swarm optimization significantly outperform the conjugate gradient method.},
  address = {Berlin, Heidelberg},
  author = {Petelin, Dejan and Filipi\v{c}, Bogdan and Kocijan, Ju\v{s}},
  booktitle = {ICANNGA 2011 (1)},
  chapter = {43},
  citeulike-article-id = {10102484},
  citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-3-642-20282-7\_43},
  citeulike-linkout-1 = {http://www.springerlink.com/content/7980767k65447807},
  doi = {10.1007/978-3-642-20282-7\_43},
  editor = {Dobnikar, Andrej and Lotric, Uro\v{s} and \v{S}ter, Branko},
  isbn = {978-3-642-20281-0},
  pages = {420--429},
  posted-at = {2011-12-07 10:47:50},
  priority = {2},
  publisher = {Springer Berlin / Heidelberg},
  series = {Lecture notes in computer science},
  title = {Optimization of Gaussian process models with evolutionary algorithms},
  url = {http://dx.doi.org/10.1007/978-3-642-20282-7\_43},
  volume = {6593},
  year = {2011}
  }

• I. Bratko, “Autonomous discovery of abstract concepts by a robot,” in Icannga 2011 (1), Berlin, Heidelberg, 2011, pp. 1-11.
  [Bibtex]

  @inproceedings{conf/icannga/Bratko11,
  abstract = {In this paper we look at the discovery of abstract concepts by a robot autonomously exploring its environment and learning the laws of the environment. By abstract concepts we mean concepts that are not explicitly observable in the measured data, such as the notions of obstacle, stability or a tool. We consider mechanisms of machine learning that enable the discovery of abstract concepts. Such mechanisms are provided by the logic based approach to machine learning called Inductive Logic Programming ({ILP}). The feature of predicate invention in {ILP} is particularly relevant. Examples of actually discovered abstract concepts in experiments are described.},
  address = {Berlin, Heidelberg},
  author = {Bratko, Ivan},
  booktitle = {ICANNGA 2011 (1)},
  chapter = {1},
  citeulike-article-id = {10102474},
  citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-3-642-20282-7\_1},
  doi = {10.1007/978-3-642-20282-7\_1},
  editor = {Dobnikar, Andrej and Lotri\v{c}, Uro\v{s} and \v{S}ter, Branko},
  isbn = {978-3-642-20281-0},
  journal = {Lecture notes in computer science},
  pages = {1--11},
  posted-at = {2011-12-07 10:42:36},
  priority = {2},
  publisher = {Springer Berlin Heidelberg},
  title = {Autonomous discovery of abstract concepts by a robot},
  url = {http://dx.doi.org/10.1007/978-3-642-20282-7\_1},
  volume = {6593},
  year = {2011}
  }

• A. Košmerlj, I. Bratko, and J. Žabkar, “Embodied concept discovery through qualitative action models,” International journal of uncertainty, fuzziness and knowledge-based systems, vol. 19, iss. 03, p. 453+, 2011.
  [Bibtex]

  @article{journals/ijufks/KosmerljBZ11,
  abstract = {We present a novel approach to embodied learning of qualitative models. We introduce algorithm {STRUDEL} that enables an autonomous robot to discover new concepts by performing experiments in its environment. The robot collects data about its actions and its observations of the environment. From the obtained data, the robot learns qualitative descriptive models of the effects that its actions have in the environment. Models are learned using inductive logic programming. We describe two experiments with a humanoid robot Nao in which Nao learns descriptive qualitative models which contain what can be interpreted as simple definitions of the concepts of movability and stability.},
  author = {Ko\v{s}merlj, Alja\v{z} and Bratko, Ivan and \v{Z}abkar, Jure},
  citeulike-article-id = {10102424},
  citeulike-linkout-0 = {http://dx.doi.org/10.1142/s0218488511007088},
  doi = {10.1142/s0218488511007088},
  issn = {0218-4885},
  journal = {International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems},
  number = {03},
  pages = {453+},
  posted-at = {2011-12-07 10:37:06},
  priority = {2},
  title = {Embodied concept discovery through qualitative action models},
  url = {http://dx.doi.org/10.1142/s0218488511007088},
  volume = {19},
  year = {2011}
  }

• R. Piltaver, E. Dovgan, and M. Gams, “An intelligent indoor surveillance system,” Informatica, vol. 35, pp. 383-390, 2011.
  [Bibtex]

  @article{citeulike:10102421,
  abstract = {The development of commercial real-time location system ({RTLS}) enables new {ICT} solutions. This paper presents an intelligent surveillance system for indoor high-security environments based on {RTLS} and artificial intelligence methods. The system consists of several software modules each specialized for detection of specific security risks. The validation shows that the system is capable of detecting a broad range of security risks with high accuracy.},
  author = {Piltaver, Rok and Dovgan, Erik and Gams, Matja\v{z}},
  citeulike-article-id = {10102421},
  citeulike-linkout-0 = {http://www.informatica.si/PDF/35-3/18\_Piltaver\%20-\%20An\%20Intelligent\%20Indoor\%20Surveillance\%20System.pdf},
  journal = {Informatica},
  pages = {383--390},
  posted-at = {2011-12-07 10:31:00},
  priority = {2},
  title = {An intelligent indoor surveillance system},
  url = {http://www.informatica.si/PDF/35-3/18\_Piltaver\%20-\%20An\%20Intelligent\%20Indoor\%20Surveillance\%20System.pdf},
  volume = {35},
  year = {2011}
  }

• M. Guid and I. Bratko, “Using heuristic-search based engines for estimating human skill at chess,” Icga journal, vol. 34, pp. 71-81, 2011.
  [Bibtex]

  @article{citeulike:10102416,
  abstract = {Establishing heuristic-search based chess programs as appropriate tools for estimating human skill levels at chess may seem impossible due to the following issues: the programs' evaluations and decisions tend to change with the depth of search and with the program used. In this research, we provide an analysis of the differences between heuristic-search based programs in estimating chess skill. We used four different chess programs to perform analyses of large data sets of recorded human decisions, and obtained very similar rankings of skill-based performances of selected chess players using any of these programs at various levels of search. A conclusion is that, given two chess players, all the programs unanimously rank one player to be clearly stronger than the other, or all the programs assess their strengths to be similar. We also repeated our earlier analysis with the program {CRAFTY} {ofWorld} Chess Champions with currently one of the strongest chess programs, {RYBKA} 3^2, and obtained qualitatively very similar results as with {CRAFTY}. This speaks in favour of computer heuristic search being adequate for estimating skill levels of chess players, despite the above stated issues.},
  author = {Guid, Matej and Bratko, Ivan},
  citeulike-article-id = {10102416},
  citeulike-linkout-0 = {http://www.ailab.si/matej/doc/Using\_Heuristic-Search\_Based\_Engines\_for\_Estimating\_Human\_Skill\_at\_Chess.pdf},
  journal = {ICGA journal},
  pages = {71--81},
  posted-at = {2011-12-07 10:27:26},
  priority = {2},
  title = {Using heuristic-search based engines for estimating human skill at chess},
  url = {http://www.ailab.si/matej/doc/Using\_Heuristic-Search\_Based\_Engines\_for\_Estimating\_Human\_Skill\_at\_Chess.pdf},
  volume = {34},
  year = {2011}
  }

• L. Scheubert, R. Schmidt, D. Repsilber, M. Luštrek, and G. Fuellen, “Learning biomarkers of pluripotent stem cells in mouse,” Dna research : an international journal for rapid publication of reports on genes and genomes, vol. 18, iss. 4, pp. 233-251, 2011.
  [Bibtex]

  @article{scheubert2011lea,
  abstract = {Pluripotent stem cells are able to self-renew, and to differentiate into all adult cell types. Many studies report data describing these cells, and characterize them in molecular terms. Machine learning yields classifiers that can accurately identify pluripotent stem cells, but there is a lack of studies yielding minimal sets of best biomarkers (genes/features). We assembled gene expression data of pluripotent stem cells and non-pluripotent cells from the mouse. After normalization and filtering, we applied machine learning, classifying samples into pluripotent and non-pluripotent with high cross-validated accuracy. Furthermore, to identify minimal sets of best biomarkers, we used three methods: information gain, random forests and a wrapper of genetic algorithm and support vector machine ({GA}/{SVM}). We demonstrate that the {GA}/{SVM} biomarkers work best in combination with each other; pathway and enrichment analyses show that they cover the widest variety of processes implicated in pluripotency. The {GA}/{SVM} wrapper yields best biomarkers, no matter which classification method is used. The consensus best biomarker based on the three methods is Tet1, implicated in pluripotency just recently. The best biomarker based on the {GA}/{SVM} wrapper approach alone is Fam134b, possibly a missing link between pluripotency and some standard surface markers of unknown function processed by the Golgi apparatus.},
  author = {Scheubert, Lena and Schmidt, Rainer and Repsilber, Dirk and Lu\v{s}trek, Mitja and Fuellen, Georg},
  citeulike-article-id = {10102388},
  citeulike-linkout-0 = {http://dx.doi.org/10.1093/dnares/dsr016},
  citeulike-linkout-1 = {http://dnaresearch.oxfordjournals.org/content/18/4/233.abstract},
  citeulike-linkout-2 = {http://dnaresearch.oxfordjournals.org/content/18/4/233.full.pdf},
  citeulike-linkout-3 = {http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3158465/},
  citeulike-linkout-4 = {http://view.ncbi.nlm.nih.gov/pubmed/21791477},
  citeulike-linkout-5 = {http://www.hubmed.org/display.cgi?uids=21791477},
  day = {01},
  doi = {10.1093/dnares/dsr016},
  issn = {1756-1663},
  journal = {DNA research : an international journal for rapid publication of reports on genes and genomes},
  month = aug,
  number = {4},
  pages = {233--251},
  pmcid = {PMC3158465},
  pmid = {21791477},
  posted-at = {2011-12-07 10:15:58},
  priority = {2},
  publisher = {Oxford University Press},
  title = {Learning biomarkers of pluripotent stem cells in mouse},
  url = {http://dx.doi.org/10.1093/dnares/dsr016},
  volume = {18},
  year = {2011}
  }

• J. Žabkar, M. Možina, I. Bratko, and J. Demšar, “Learning qualitative models from numerical data,” Artificial intelligence, vol. 175, iss. 9-10, pp. 1604-1619, 2011.
  [Bibtex]

  @article{journals/ai/ZabkarMBD11,
  abstract = {Qualitative models describe relations between the observed quantities in qualitative terms. In predictive modelling, a qualitative model tells whether the output increases or decreases with the input. We describe Pad\'{e}, a new method for qualitative learning which estimates partial derivatives of the target function from training data and uses them to induce qualitative models of the target function. We formulated three methods for computation of derivatives, all based on using linear regression on local neighbourhoods. The methods were empirically tested on artificial and real-world data. We also provide a case study which shows how the developed methods can be used in practice.},
  author = {\v{Z}abkar, Jure and Mo\v{z}ina, Martin and Bratko, Ivan and Dem\v{s}ar, Janez},
  citeulike-article-id = {8974051},
  citeulike-linkout-0 = {http://www.ailab.si/jure/AIJ\_Pade\_Zabkar\_etal.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1016/j.artint.2011.02.004},
  day = {02},
  doi = {10.1016/j.artint.2011.02.004},
  issn = {00043702},
  journal = {Artificial Intelligence},
  month = jun,
  number = {9-10},
  pages = {1604--1619},
  posted-at = {2011-12-07 10:12:38},
  priority = {2},
  title = {Learning qualitative models from numerical data},
  url = {http://www.ailab.si/jure/AIJ\_Pade\_Zabkar\_etal.pdf},
  volume = {175},
  year = {2011}
  }

• V. Vidulin and M. Gams, “Impact of high-level knowledge on economic welfare through interactive data mining,” Applied artificial intelligence, vol. 25, iss. 4, pp. 267-291, 2011.
  [Bibtex]

  @article{journals/aai/VidulinG11,
  abstract = {This paper describes a novel algorithm for finding the most important relations with the use of data mining. As an example application, the impact of high-level knowledge on economic welfare was analyzed. Our approach, based on interactive data mining, not only helps to discover the most relevant models, but also enables an evaluation of their relevance. The approach is specialized for the analysis of macroeconomic data that often contains incomplete and noisy attributes and, initially, complex relations, where several relations are statistically seemingly important, but only a few are indeed the most relevant. Although data mining algorithms are designed to detect the relevant attributes, irrelevant attributes often appear in the models due to chance-choice, reducing their quality and understandability, and consequently even leading to incorrect conclusions. We present our method and show its application at finding the most relevant relations between high-level knowledge and the state of development of a country.},
  author = {Vidulin, Vedrana and Gams, Matja\v{z}},
  citeulike-article-id = {9078688},
  citeulike-linkout-0 = {http://dx.doi.org/10.1080/08839514.2011.559571},
  citeulike-linkout-1 = {http://www.ingentaconnect.com/content/tandf/uaai/2011/00000025/00000004/art00001},
  citeulike-linkout-2 = {http://www.tandfonline.com/doi/abs/10.1080/08839514.2011.559571},
  day = {18},
  doi = {10.1080/08839514.2011.559571},
  journal = {Applied Artificial Intelligence},
  month = mar,
  number = {4},
  pages = {267--291},
  posted-at = {2011-12-07 10:09:28},
  priority = {2},
  publisher = {Taylor \& Francis},
  title = {Impact of high-level knowledge on economic welfare through interactive data mining},
  url = {http://dx.doi.org/10.1080/08839514.2011.559571},
  volume = {25},
  year = {2011}
  }

• M. Luštrek, H. Gjoreski, S. Kozina, B. Cvetković, V. Mirčevska, and M. Gams, “Detecting falls with location sensors and accelerometers,” in Aaai 2011, 2011, pp. 1662-1667.
  [Bibtex]

  @inproceedings{citeulike:10083332,
  abstract = {Due to the rapid aging of the population, many technical solutions for the care of the elderly are being developed, often involving fall detection with accelerometers. We present a novel approach to fall detection with location sensors. In our application, a user wears up to four tags on the body whose locations are detected with radio sensors. This makes it possible to recognize the user's activity, including falling any lying afterwards, and the context in terms of the location in the apartment. We compared fall detection using location sensors, accelerometers and accelerometers combined with the context. A scenario consisting of events difficult to recognize as falls or non-falls was used for the comparison. The accuracy of the methods that utilized the context was almost 40 percentage points higher compared to the methods without the context. The accuracy of pure location-based methods was around 10 percentage points higher than the accuracy of accelerometers combined with the context.},
  author = {Lu\v{s}trek, Mitja and Gjoreski, Hristijan and Kozina, Simon and Cvetkovi\'{c}, Bo\v{z}idara and Mir\v{c}evska, Violeta and Gams, Matja\v{z}},
  booktitle = {AAAI 2011},
  citeulike-article-id = {10083332},
  citeulike-linkout-0 = {http://www.aaai.org/ocs/index.php/IAAI/IAAI-11/paper/viewFile/2753/4020.pdf},
  month = aug,
  pages = {1662--1667},
  posted-at = {2011-11-30 10:13:03},
  priority = {2},
  title = {Detecting falls with location sensors and accelerometers},
  url = {http://www.aaai.org/ocs/index.php/IAAI/IAAI-11/paper/viewFile/2753/4020.pdf},
  year = {2011}
  }

• E. Dovgan, M. Luštrek, B. Pogorelc, A. Gradišek, H. Bruger, and M. Gams, “Intelligent elderly-care prototype for fall and disease detection,” Slovenian medical journal, vol. 80, iss. 11, 2011.
  [Bibtex]

  @article{DovganSMJ2011,
  abstract = {Background: The number of elderly people in need of help with the activities of daily living in the {EU} is rapidly increasing, while the number of young workers is decreasing. Elderly care will, therefore, also have to be provided by intelligent computer systems.
  Methods: A prototype elderly-care system, developed at the Jo\v{z}ef Stefan Institute, mostly as part of the Confidence project, is presented. The prototype detects falls and behavior changes in the elderly. It learns from experience and is based on intelligent interpretation of movement patterns. Three sets of tests were performed to evaluate its properties on various subjects when engaged in normal activities, falling and imitations of several health problems under medical supervision. The key novelty was in locationbased sensors and advanced intelligent methods.
  Results: The prototype using the Ubisense sensor system, which detects the locations of tags worn on the body, correctly recognized 96 \% of falls, significantly outperforming simple accelerometer- based systems. In addition, it recognized up to 99 \% of abnormal behavior.
  Conclusions: Experimental results showed that an intelligent system coupled with advanced location sensors can achieve the level of performance needed in real life. The system offers significantly better performance than commercially available solutions, and once the price of sensors decreases, its widespread application seems likely.},
  author = {Dovgan, Erik and Lu\v{s}trek, Mitja and Pogorelc, Bogdan and Gradi\v{s}ek, Anton and Bruger, Helena and Gams, Matja\v{z}},
  citeulike-article-id = {10056451},
  citeulike-linkout-0 = {http://dis.ijs.si/Erik/papers/Dovgan\_Gams\_SMJ11.pdf},
  journal = {Slovenian Medical Journal},
  number = {11},
  posted-at = {2011-11-22 13:37:11},
  priority = {2},
  title = {Intelligent elderly-care prototype for fall and disease detection},
  url = {http://dis.ijs.si/Erik/papers/Dovgan\_Gams\_SMJ11.pdf},
  volume = {80},
  year = {2011}
  }

• B. Kaluža, E. Dovgan, T. Tušar, M. Tambe, and M. Gams, “A probabilistic risk analysis for multimodal entry control,” Expert systems with applications, vol. 38, iss. 6, pp. 6696-6704, 2011.
  [Bibtex]

  @article{KaluzaESWA2010,
  abstract = {Entry control is an important security measure that prevents undesired persons from entering secure areas. The advanced risk analysis presented in this paper makes it possible to distinguish between acceptable and unacceptable entries, based on several entry sensors, such as fingerprint readers, and intelligent methods that learn behavior from previous entries. We have extended the intelligent layer in two ways: first, by adding a meta-learning layer that combines the output of specific intelligent modules, and second, by constructing a Bayesian network to integrate the predictions of the learning and meta-learning modules. The obtained results represent an important improvement in detecting security attacks.},
  author = {Kalu\v{z}a, Bo\v{s}tjan and Dovgan, Erik and Tu\v{s}ar, Tea and Tambe, Milind and Gams, Matja\v{z}},
  citeulike-article-id = {8292933},
  citeulike-linkout-0 = {http://dis.ijs.si/bostjan/papers/EntryControl-ESWA.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1016/j.eswa.2010.11.065},
  day = {19},
  doi = {10.1016/j.eswa.2010.11.065},
  issn = {0957-4174},
  journal = {Expert Systems with Applications},
  keywords = {anomaly-detection, security, selected},
  month = jun,
  number = {6},
  pages = {6696--6704},
  posted-at = {2011-11-22 11:05:25},
  priority = {2},
  title = {A probabilistic risk analysis for multimodal entry control},
  url = {http://dis.ijs.si/bostjan/papers/EntryControl-ESWA.pdf},
  volume = {38},
  year = {2011}
  }

2010

• V. Prijatelj, U. Rajkovič, O. Šušteršič, and V. Rajkovič, “Reengineering of nursing process: e-documentation case,” Nursing and informatics for the 21st century: an international look at practice, education and ehr trends, pp. 447-454, 2010.
  [Bibtex]

  @article{citeulike:10359450,
  author = {Prijatelj, Vesna and Rajkovi\v{c}, Uro\v{s} and \v{S}u\v{s}ter\v{s}i\v{c}, Olga and Rajkovi\v{c}, Vladislav},
  citeulike-article-id = {10359450},
  journal = {Nursing and informatics for the 21st century: an international look at practice, education and EHR trends},
  pages = {447--454},
  posted-at = {2012-02-16 11:39:48},
  priority = {2},
  title = {Reengineering of nursing process: e-documentation case},
  year = {2010}
  }

• Z. Pečar and I. Bratko, “The use of data mining for assessing performance of administrative services,” in Data mining in public and private sectors, A. Syvajarvi and J. Stenvall, Eds., IGI Global, 2010, pp. 67-92.
  [Bibtex]

  @inbook{citeulike:10106799,
  abstract = {The aim of this research was to study the performance of 58 Slovenian administrative districts (state government offices at local level), to identify the factors that affect the performance, and how these effects interact. The main idea was to analyze the available statistical data relevant to the performance of the administrative districts with machine learning tools for data mining, and to extract from available data clear relations between various parameters of administrative districts and their performance. The authors introduced the concept of basic unit of administrative service, which enables the measurement of an administrative district's performance. The main data mining tool used in this study was the method of regression tree induction. This method can handle numeric and discrete data, and has the benefit of providing clear insight into the relations between the parameters in the system, thereby facilitating the interpretation of the results of data mining. The authors investigated various relations between the parameters in their domain, for example, how the performance of an administrative district depends on the trends in the number of applications, employees' level of professional qualification, etc. In the chapter, they report on a variety of (occasionally surprising) findings extracted from the data, and discuss how these findings can be used to improve decisions in managing administrative districts.},
  author = {Pe\v{c}ar, Zdravko and Bratko, Ivan},
  booktitle = {Data Mining in Public and Private Sectors},
  chapter = {4},
  citeulike-article-id = {10106799},
  citeulike-linkout-0 = {http://www.irma-international.org/viewtitle/44283/},
  editor = {Syvajarvi, Antti and Stenvall, Jari},
  isbn = {9781605669069},
  pages = {67--92},
  posted-at = {2011-12-08 13:05:33},
  priority = {2},
  publisher = {IGI Global},
  title = {The use of data mining for assessing performance of administrative services},
  url = {http://www.irma-international.org/viewtitle/44283/},
  year = {2010}
  }

• J. Žabkar, M. Možina, T. Janež, I. Bratko, and J. Demšar, “Preference learning from qualitative partial derivatives,” in European conference on machine learning and principles and practice of knowledge discovery in databases, 2010, pp. 1-13.
  [Bibtex]

  @inproceedings{citeulike:10105463,
  abstract = {We address the problem of learning preference models from data containing implicit preference information. The information about preferences is expressed as a result of a decision or action in a given state in context of other attributes. We propose an algorithm that observes the change of probability of a target class (desired result) w.r.t. the change in the values of the attribute describing the decision or {action.We} generalize the notion of a partial derivative by defining the probabilistic discrete qualitative partial derivative ({PDQ} {PD}). {PDQ} {PD} is a qualitative relation between the target class c and a discrete attribute, given as a sequence of attribute values a\_i in the order of P(c|a\_i) in a local neighbourhood of the reference point. In a two stage learning process we first compute {PDQ} {PD} for all examples in the training data, and then generalize over the entire data set using an appropriate machine learning algorithm (e.g. a decision tree). The induced preference model explains the influence of the attribute values on the target class in different subspaces of the attribute space.},
  author = {\v{Z}abkar, Jure and Mo\v{z}ina, Martin and Jane\v{z}, Tadej and Bratko, Ivan and Dem\v{s}ar, Janez},
  booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
  citeulike-article-id = {10105463},
  citeulike-linkout-0 = {http://www.ke.tu-darmstadt.de/events/PL-10/papers/5-Zabkar.pdf},
  pages = {1--13},
  posted-at = {2011-12-08 10:13:23},
  priority = {2},
  title = {Preference learning from qualitative partial derivatives},
  url = {http://www.ke.tu-darmstadt.de/events/PL-10/papers/5-Zabkar.pdf},
  year = {2010}
  }

• M. Gams and A. Bežek, “Multi-agent strategic modeling in a specific environment,” in Handbook of ambient intelligence and smart environments, H. Nakashima, H. Aghajan, and J. C. Augusto, Eds., Boston, MA: Springer US, 2010, pp. 731-750.
  [Bibtex]

  @inbook{citeulike:10103484,
  abstract = {Multi-agent modeling in ambient intelligence ({AmI}) is concerned with the following task [19]: How can external observations of multi-agent systems in the ambient be used to analyze, model, and direct agent behavior? The main purpose is to obtain knowledge about acts in the environment thus enabling proper actions of the {AmI} systems [1]. Analysis of such systems must thus capture complex world state representation and asynchronous agent activities. Instead of studying basic numerical data, researchers often use more complex data structures, such as rules and decision trees. Some methods are extremely useful when characterizing state space, but lack the ability to clearly represent temporal state changes occurred by agent actions. To comprehend simultaneous agent actions and complex changes of state space, most often a combination of graphical and symbolical representation performs better in terms of human understanding and performance.},
  address = {Boston, MA},
  author = {Gams, Matja\v{z} and Be\v{z}ek, Andra\v{z}},
  booktitle = {Handbook of Ambient Intelligence and Smart Environments},
  chapter = {27},
  citeulike-article-id = {10103484},
  citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-0-387-93808-0\_27},
  citeulike-linkout-1 = {http://www.springerlink.com/content/g8r2041139287r08},
  doi = {10.1007/978-0-387-93808-0\_27},
  editor = {Nakashima, Hideyuki and Aghajan, Hamid and Augusto, Juan C.},
  isbn = {978-0-387-93807-3},
  pages = {731--750},
  posted-at = {2011-12-07 15:35:37},
  priority = {2},
  publisher = {Springer US},
  title = {Multi-agent strategic modeling in a specific environment},
  url = {http://dx.doi.org/10.1007/978-0-387-93808-0\_27},
  year = {2010}
  }

• I. Bratko, “Comparison of machine learning for autonomous robot discovery,” in Advances in machine learning i, J. Koronacki, Z. Ras, S. Wierzchon, and J. Kacprzyk, Eds., Berlin, Heidelberg: Springer Berlin / Heidelberg, 2010, vol. 262, pp. 441-456.
  [Bibtex]

  @inbook{series/sci/Bratko10,
  abstract = {In this paper we consider autonomous robot discovery through experimentation in the robot's environment. We analyse the applicability of machine learning ({ML}) methods with respect to various levels of robot discovery tasks, from extracting simple laws among the observed variables, to discovering completely new notions that were never explicitly mentioned in the data directly. We first present some illustrative experiments in robot learning in the {XPERO} European project. Then we formulate criteria for a comparison of learning methods and a systematic list of types of learning or discovery tasks, and discuss the suitability of chosen {ML} methods for these tasks.},
  address = {Berlin, Heidelberg},
  author = {Bratko, Ivan},
  booktitle = {Advances in machine learning I},
  chapter = {22},
  citeulike-article-id = {10103433},
  citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-3-642-05177-7\_22},
  citeulike-linkout-1 = {http://www.springerlink.com/content/wk7842x3th745711},
  doi = {10.1007/978-3-642-05177-7\_22},
  editor = {Koronacki, Jacek and Ras, Zbigniew and Wierzchon, Slawomir and Kacprzyk, Janusz},
  isbn = {978-3-642-05176-0},
  pages = {441--456},
  posted-at = {2011-12-07 15:19:13},
  priority = {2},
  publisher = {Springer Berlin / Heidelberg},
  series = {Studies in Computational Intelligence},
  title = {Comparison of machine learning for autonomous robot discovery},
  url = {http://dx.doi.org/10.1007/978-3-642-05177-7\_22},
  volume = {262},
  year = {2010}
  }

• B. Kaluža and M. Gams, “An approach to analysis of daily living dynamics,” in World congress on engineering and computer science 2010, 2010, pp. 485-490.
  [Bibtex]

  @inproceedings{citeulike:10103305,
  abstract = {This paper addresses a module within a care system based on daily human behavior extracted from localization data. The proposed method is based on transforming the sequence of posture and spatial information using novel matrix presentation to extract spatial-activity features. Then, outlier detection method is used for classification of individual's usual and unusual daily patterns regardless of the cause of the problem, be it physical or mental. Initial experiments show that the proposed algorithm successfully discriminates between daily behavior patterns of healthy person and those with health problems.},
  author = {Kalu\v{z}a, Bo\v{s}tjan and Gams, Matja\v{z}},
  booktitle = {World Congress on Engineering and Computer Science 2010},
  citeulike-article-id = {10103305},
  citeulike-linkout-0 = {http://www.iaeng.org/publication/WCECS2010/WCECS2010\_pp485-490.pdf},
  month = oct,
  pages = {485--490},
  posted-at = {2011-12-07 14:47:10},
  priority = {2},
  title = {An approach to analysis of daily living dynamics},
  url = {http://www.iaeng.org/publication/WCECS2010/WCECS2010\_pp485-490.pdf},
  year = {2010}
  }

• I. Bratko, “Discovery of abstract concepts by a robot,” in Alt 2010, B. Pfahringer, G. Holmes, and A. Hoffmann, Eds., Berlin, Heidelberg: Springer Berlin / Heidelberg, 2010, vol. 6332, pp. 372-379.
  [Bibtex]

  @inbook{conf/dis/Bratko10,
  abstract = {This paper reviews experiments with an approach to discovery through robot's experimentation in its environment. In addition to discovering laws that enable predictions, we are particularly interested in the mechanisms that enable the discovery of abstract concepts that are not explicitly observable in the measured data, such as the notions of a tool or stability. The approach is based on the use of Inductive Logic Programming. Examples of actually discovered abstract concepts in the experiments include the concepts of a movable object, an obstacle and a tool.},
  address = {Berlin, Heidelberg},
  author = {Bratko, Ivan},
  booktitle = {ALT 2010},
  chapter = {27},
  citeulike-article-id = {10102371},
  citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-3-642-16184-1\_27},
  citeulike-linkout-1 = {http://www.springerlink.com/content/hv483651170130v8},
  doi = {10.1007/978-3-642-16184-1\_27},
  editor = {Pfahringer, Bernhard and Holmes, Geoff and Hoffmann, Achim},
  isbn = {978-3-642-16183-4},
  pages = {372--379},
  posted-at = {2011-12-07 10:06:58},
  priority = {2},
  publisher = {Springer Berlin / Heidelberg},
  series = {Lecture notes in computer science},
  title = {Discovery of abstract concepts by a robot},
  url = {http://dx.doi.org/10.1007/978-3-642-16184-1\_27},
  volume = {6332},
  year = {2010}
  }

• M. Guid, M. Možina, A. Sadikov, and I. Bratko, “Deriving concepts and strategies from chess tablebases,” in Advances in computers and games conference (acg 12), Berlin, Heidelberg, 2010, pp. 195-207.
  [Bibtex]

  @inproceedings{conf/acg/GuidMSB09,
  abstract = {Complete tablebases, indicating best moves for every position, exist for chess endgames. There is no doubt that tablebases contain a wealth of knowledge, however, mining for this knowledge, manually or automatically, proved as extremely difficult. Recently, we developed an approach that combines specialized minimax search with the argument-based machine learning ({ABML}) paradigm. In this paper, we put this approach to test in an attempt to elicit human-understandable knowledge from tablebases. Specifically, we semi-automatically synthesize knowledge from the {KBNK} tablebase for teaching the difficult king, bishop, and knight versus the lone king endgame.},
  address = {Berlin, Heidelberg},
  author = {Guid, Matej and Mo\v{z}ina, Martin and Sadikov, Aleksander and Bratko, Ivan},
  booktitle = {Advances in Computers and Games conference (ACG 12)},
  chapter = {18},
  citeulike-article-id = {10102363},
  citeulike-linkout-0 = {http://www.ailab.si/matej/doc/Deriving\_Concepts\_and\_Strategies\_from\_Chess\_Tablebases.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1007/978-3-642-12993-3\_18},
  citeulike-linkout-2 = {http://www.springerlink.com/content/um0l155681087p7h},
  doi = {10.1007/978-3-642-12993-3\_18},
  editor = {van den Herik, H. and Spronck, Pieter},
  isbn = {978-3-642-12992-6},
  pages = {195--207},
  posted-at = {2011-12-07 10:04:27},
  priority = {2},
  publisher = {Springer Berlin / Heidelberg},
  series = {Lecture notes in computer science},
  title = {Deriving Concepts and Strategies from Chess Tablebases},
  url = {http://www.ailab.si/matej/doc/Deriving\_Concepts\_and\_Strategies\_from\_Chess\_Tablebases.pdf},
  volume = {6048},
  year = {2010}
  }

• B. Pogorelc and M. Gams, “Identification of gait patterns related to health problems of elderly,” in Uic’10, Berlin, Heidelberg, 2010, pp. 179-191.
  [Bibtex]

  @inproceedings{conf/uic/PogorelcG10,
  abstract = {A system for automatic identification of gait patterns related to health problems of elderly for the purpose of supporting their independent living is proposed in this paper. The gait of the user is captured with the motion capture system, which consists of tags attached to the body and sensors situated in the apartment. Position of the tags is acquired by the sensors and the resulting time series of position coordinates are analyzed with machine learning algorithms in order to identify the specific health problem. We propose novel features for training a machine learning classifier that classifies the user's gait into: i) normal, ii) with hemiplegia, iii) with Parkinson's disease, iv) with pain in the back and v) with pain in the leg. Results show that naive Bayes needs more tags and less noise to reach classification accuracy of 98 \% than random forest for 99 \%.},
  address = {Berlin, Heidelberg},
  author = {Pogorelc, Bogdan and Gams, Matja\v{z}},
  booktitle = {UIC'10},
  chapter = {16},
  citeulike-article-id = {10102349},
  citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-3-642-16355-5\_16},
  doi = {10.1007/978-3-642-16355-5\_16},
  editor = {Yu, Zhiwen and Liscano, Ramiro and Chen, Guanling and Zhang, Daqing and Zhou, Xingshe},
  isbn = {978-3-642-16354-8},
  journal = {Lecture notes in computer science},
  pages = {179--191},
  posted-at = {2011-12-07 10:00:25},
  priority = {2},
  publisher = {Springer Berlin Heidelberg},
  title = {Identification of gait patterns related to health problems of elderly},
  url = {http://dx.doi.org/10.1007/978-3-642-16355-5\_16},
  volume = {6406},
  year = {2010}
  }

• M. Gams and M. Ožek, “Model order reduction for large LTI control systems,” Journal of computer and systems sciences international, vol. 49, iss. 5, pp. 696-701, 2010.
  [Bibtex]

  @article{citeulike:8125946,
  abstract = {An overview of model-order-reduction methods for descriptor control system is presented, with the emphasis on the Krylov-subspace-based methods. We used two standard benchmark descriptor problems for an empirical comparison of the methods. The results indicate that the methods perform differently, depending on whether they are used on generalized control systems or on standard control systems.},
  author = {Gams, Matja\v{z} and O\v{z}ek, Matej},
  citeulike-article-id = {8125946},
  citeulike-linkout-0 = {http://dx.doi.org/10.1134/s1064230710050035},
  citeulike-linkout-1 = {http://www.springerlink.com/content/0423718h3110853x},
  day = {1},
  doi = {10.1134/s1064230710050035},
  issn = {1064-2307},
  journal = {Journal of Computer and Systems Sciences International},
  month = oct,
  number = {5},
  pages = {696--701},
  posted-at = {2011-12-07 09:51:31},
  priority = {2},
  publisher = {MAIK Nauka/Interperiodica distributed exclusively by Springer Science+Business Media LLC.},
  title = {Model order reduction for large {LTI} control systems},
  url = {http://dx.doi.org/10.1134/s1064230710050035},
  volume = {49},
  year = {2010}
  }

• D. S. Nau, M. Luštrek, A. Parker, I. Bratko, and M. Gams, “When is it better not to look ahead?,” Artificial intelligence, vol. 174, iss. 16-17, pp. 1323-1338, 2010.
  [Bibtex]

  @article{journals/ai/NauLPBG10,
  abstract = {In situations where one needs to make a sequence of decisions, it is often believed that looking ahead will help produce better decisions. However, it was shown 30 years ago that there are ” pathological” situations in which looking ahead is counterproductive. Two long-standing open questions are (a) what combinations of factors have the biggest influence on whether lookahead pathology occurs, and (b) whether it occurs in real-world decision-making. This paper includes simulation results for several synthetic game-tree models, and experimental results for three well-known board games: two chess endgames, kalah (with some modifications to facilitate experimentation), and the 8-puzzle. The simulations show the interplay between lookahead pathology and several factors that affect it; and the experiments confirm the trends predicted by the simulation models. The experiments also show that lookahead pathology is more common than has been thought: all three games contain situations where it occurs.},
  author = {Nau, Dana S. and Lu\v{s}trek, Mitja and Parker, Austin and Bratko, Ivan and Gams, Matja\v{z}},
  citeulike-article-id = {7779244},
  citeulike-linkout-0 = {http://www.cs.umd.edu/\~{}nau/papers/nau2010when.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1016/j.artint.2010.08.002},
  day = {11},
  doi = {10.1016/j.artint.2010.08.002},
  issn = {00043702},
  journal = {Artificial Intelligence},
  month = nov,
  number = {16-17},
  pages = {1323--1338},
  posted-at = {2011-12-07 09:44:09},
  priority = {2},
  title = {When is it better not to look ahead?},
  url = {http://www.cs.umd.edu/\~{}nau/papers/nau2010when.pdf},
  volume = {174},
  year = {2010}
  }

• I. Fister, M. Mernik, and B. Filipič, “A hybrid self-adaptive evolutionary algorithm for marker optimization in the clothing industry,” Applied soft computing, vol. 10, iss. 2, pp. 409-422, 2010.
  [Bibtex]

  @article{journals/asc/FisterMF10,
  abstract = {The task of marker optimization in clothing production is to eliminate pieces from a work order using an optimal sequence of markers and plies, where the work order is given as a matrix of colors by sizes, markers are vectors of sizes to be laid-out and cut together, and the number of plies determines how many pieces are eliminated from the work order each time. Although the optimality of a marker sequence can be determined in several ways, we consider minimum preparation cost as a key objective in clothing production. The traditional algorithms and the simple evolutionary algorithms used in marker optimization today have relied on minimizing the number of markers, which only indirectly reduces production costs. In this paper we propose a hybrid self-adaptive evolutionary algorithm ({HSA}-{EA}) for marker optimization that improves the results of the previous algorithms and successfully deals with the objective of minimum preparation cost.},
  author = {Fister, Iztok and Mernik, Marjan and Filipi\v{c}, Bogdan},
  citeulike-article-id = {5403541},
  citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.asoc.2009.08.001},
  day = {08},
  doi = {10.1016/j.asoc.2009.08.001},
  issn = {15684946},
  journal = {Applied Soft Computing},
  month = mar,
  number = {2},
  pages = {409--422},
  posted-at = {2011-12-07 09:41:35},
  priority = {2},
  title = {A hybrid self-adaptive evolutionary algorithm for marker optimization in the clothing industry},
  url = {http://dx.doi.org/10.1016/j.asoc.2009.08.001},
  volume = {10},
  year = {2010}
  }

• B. Kaluža, V. Mirchevska, E. Dovgan, M. Luštrek, and M. Gams, “An agent-based approach to care in independent living,” in Ami 2010, 2010, pp. 177-186.
  [Bibtex]

  @inproceedings{KaluzaAMI2010,
  author = {Kalu\v{z}a, Bo\v{s}tjan and Mirchevska, Violeta and Dovgan, Erik and Lu\v{s}trek, Mitja and Gams, Matja\v{z}},
  booktitle = {AmI 2010},
  citeulike-article-id = {10056647},
  citeulike-linkout-0 = {http://dis.ijs.si/bostjan/papers/AmI-10-final.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1007/978-3-642-16917-5\_18},
  comment = {10.1007/978-3-642-16917-5\_18},
  doi = {10.1007/978-3-642-16917-5\_18},
  editor = {de Ruyter, Boris and Wichert, Reiner and Keyson, David and Markopoulos, Panos and Streitz, Norbert and Divitini, Monica and Georgantas, Nikolaos and Mana Gomez, Antonio},
  keywords = {activity-recognition, ami, confidence, selected},
  pages = {177--186},
  posted-at = {2011-11-22 16:04:51},
  priority = {2},
  publisher = {Springer Berlin / Heidelberg},
  series = {Lecture Notes in Computer Science},
  title = {An agent-based approach to care in independent living},
  url = {http://dis.ijs.si/bostjan/papers/AmI-10-final.pdf},
  volume = {6439},
  year = {2010}
  }

• E. Dovgan, B. Kaluža, T. Tušar, and M. Gams, “Improving user verification by implementing an agent-based security system,” Journal of ambient intelligence and smart environments, vol. 2, iss. 1, pp. 21-30, 2010.
  [Bibtex]

  @article{DovganJAISE2010,
  abstract = {This paper presents an agent-based, high-level security system for user verification. The system verifies a user's identity by processing data from several low-lever sensors mounted at an entry point combined with knowledge of the user's past behavior. The data from a new entry are processed by several agents, which store the knowledge in an ontology. A single agent's classifications are integrated into the overall decision. The system successfully detects intruders, even when they optimally fake low-level sensors, e.g. fingerprints, and regular personnel under the influence of drugs.},
  address = {Amsterdam, The Netherlands, The Netherlands},
  author = {Dovgan, Erik and Kalu\v{z}a, Bo\v{s}tjan and Tu\v{s}ar, Tea and Gams, Matja\v{z}},
  citeulike-article-id = {9121710},
  citeulike-linkout-0 = {http://dis.ijs.si/erik/papers/Dovgan\_Gams\_JAISE10\_draft.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.3233/AIS-2010-0050},
  citeulike-linkout-2 = {http://portal.acm.org/citation.cfm?id=1735862.1735864},
  doi = {10.3233/AIS-2010-0050},
  issn = {1876-1364},
  journal = {Journal of Ambient Intelligence and Smart Environments},
  month = jan,
  number = {1},
  pages = {21--30},
  posted-at = {2011-11-22 11:04:47},
  priority = {2},
  publisher = {IOS Press},
  title = {Improving user verification by implementing an agent-based security system},
  url = {http://dis.ijs.si/erik/papers/Dovgan\_Gams\_JAISE10\_draft.pdf},
  volume = {2},
  year = {2010}
  }

2009

• O. Šušteršič, U. Rajkovič, V. Prijatelj, and V. Rajkovič, “Evaluating patient’s health by a hierarchical decision model,” in Etelemed, 2009, pp. 136-139.
  [Bibtex]

  @inproceedings{DBLP:conf/etelemed/SustersicRPR09,
  abstract = {Evaluation of a patient's health status is an essential part of the healthcare process. For this purpose, Henderson's model of basic living activities ({BLA}) is often proposed as a set of criteria to be used in nursing. Despite its clarity and theoretical background, the model is only partially used in clinical practice. In this paper, we present the methodology for a hierarchical multi-attribute decision model to increase the practical efficiency of the {BLA} model. The result is a computerized model for the evaluation of a patient's health status. This model was tested in clinical practice by 17 nurses in two health centres in Slovenia and a strengths, weaknesses, opportunities and threats ({SWOT}) analysis was carried out. The strengths included providing a holistic understanding of the nature and level of the nursing problems, enriching the documentation and reducing the possibility of overlooking something important. As a part of electronic documentation, this computerized model supports systematic patient data gathering and evaluation.},
  author = {\v{S}u\v{s}ter\v{s}i\v{c}, Olga and Rajkovi\v{c}, Uro\v{s} and Prijatelj, Vesna and Rajkovi\v{c}, Vladislav},
  booktitle = {eTELEMED},
  citeulike-article-id = {10359384},
  pages = {136--139},
  posted-at = {2012-02-16 10:59:57},
  priority = {2},
  publisher = {IEEE Computer Society},
  title = {Evaluating patient's health by a hierarchical decision model},
  year = {2009}
  }

• M. Gams and M. Ožek, “Use of data mining techniques for process analysis on small databases,” in Dynamic and advanced data mining for progressing technological development, S. A. B. M. Ali and Y. Xiang, Eds., IGI Global, 2009, pp. 422-436.
  [Bibtex]

  @inbook{citeulike:10106847,
  abstract = {The pharmaceutical industry was for a long time founded on rigid rules. With the new {PAT} initiative, control is becoming significantly more flexible. The Food and Drug Administration is even encouraging the industry to use methods like machine learning. The authors designed a new data mining method based on inducing ensemble decision trees from which rules are generated. The first improvement is specialization for process analysis with only a few examples and many attributes. The second innovation is a graphical module interface enabling process operators to test the influence of parameters on the process itself. The first task is creating accurate knowledge on small datasets. The authors start by building many decision trees on the dataset. Next, they subtract only the best subparts of the constructed trees and create rules from those parts. A best tree subpart is in general a tree branch that covers most examples, is as short as possible and has no misclassified examples. Further on, the rules are weighed, regarding the number of examples and parameters included. The class value of the new case is calculated as a weighted average of all relevant rule predictions. With this procedure the authors retain clarity of the model and the ability to efficiently explain the classification result. In this way, overfitting of decision trees and overpruning of the basic rule learners are diminished to a great extent. From the rules, an expert system is designed that helps process operators. Regarding the second task of graphical interface, the authors modified the Orange explanation module so that an operator at each step takes a look at several space planes, defined by two chosen attributes (Dem\v{s}ar et al., 2004). The displayed attributes are the ones that appeared in the classification rules triggered by the new case. The operator can interactively change the current set of process parameters in order to check the improvement of the class value. The task of seeing the influence of combining all the attributes leading to a high quality end product (called design space) is now becoming human comprehensible, it does not demand a highdimensional space vision any more. The method was successfully implemented on data provided by a pharmaceutical company. High classification accuracy was achieved in a readable form thus introducing new comprehensions.},
  author = {Gams, Matja\v{z} and O\v{z}ek, Matej},
  booktitle = {Dynamic and Advanced Data Mining for Progressing Technological Development},
  chapter = {17},
  citeulike-article-id = {10106847},
  citeulike-linkout-0 = {http://www.irma-international.org/viewtitle/39651/},
  editor = {Ali, A. B. M. Shawkat and Xiang, Yang},
  isbn = {9781605669083},
  month = nov,
  pages = {422--436},
  posted-at = {2011-12-08 13:13:45},
  priority = {2},
  publisher = {IGI Global},
  title = {Use of data mining techniques for process analysis on small databases},
  url = {http://www.irma-international.org/viewtitle/39651/},
  year = {2009}
  }

• J. Žabkar, M. Možina, I. Bratko, and J. Demšar, “Discovering monotone relations with pade,” in European conference on machine learning and principles and practice of knowledge discovery in databases, 2009.
  [Bibtex]

  @inproceedings{citeulike:10105454,
  abstract = {We propose a new approach to discovering monotone relations in numerical data. We describe Pade, a tool for estimating partial derivatives of target function from numerical data. Pad´e is basically a preprocessor that takes numerical data as input and assigns computed qualitative partial derivatives to the learning examples. Using the preprocessed data, an appropriate machine learning method can be used to induce a generalized model. The induced models describe monotone relations between the class variable and the attributes. Experiments performed on artificial domains showed that Pade is quite accurate and robust.},
  author = {\v{Z}abkar, Jure and Mo\v{z}ina, Martin and Bratko, Ivan and Dem\v{s}ar, Janez},
  booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
  citeulike-article-id = {10105454},
  citeulike-linkout-0 = {http://www.ecmlpkdd2009.net/wp-content/uploads/2009/08/learning-monotone-models-from-data.pdf\#page=39},
  posted-at = {2011-12-08 10:08:50},
  priority = {2},
  title = {Discovering monotone relations with Pade},
  url = {http://www.ecmlpkdd2009.net/wp-content/uploads/2009/08/learning-monotone-models-from-data.pdf\#page=39},
  year = {2009}
  }

• M. Gams, “How intelligent can robots become: implications and concerns,” in Philosophical insights about modern science, E. Zerovnik, O. Markič, and A. Ule, Eds., Nova Science Publishers, Inc., 2009, pp. 109-124.
  [Bibtex]

  @inbook{citeulike:10103431,
  author = {Gams, Matja\v{z}},
  booktitle = {Philosophical insights about modern science},
  citeulike-article-id = {10103431},
  editor = {Zerovnik, Eva and Marki\v{c}, Olga and Ule, A.},
  pages = {109--124},
  posted-at = {2011-12-07 15:18:02},
  priority = {2},
  publisher = {Nova Science Publishers, Inc.},
  title = {How intelligent can robots become: implications and concerns},
  year = {2009}
  }

• B. Filipič and M. Depolli, “Parallel evolutionary computation framework for single- and multiobjective optimization,” in Parallel computing, R. Trobec, M. Vajteršic, and P. Zinterhof, Eds., London: Springer London, 2009, pp. 217-240.
  [Bibtex]

  @inbook{citeulike:10103403,
  abstract = {Evolutionary computation is an area of computer science utilizing the mechanisms of biological evolution in computer problem solving. It is concerned with theoretical studies, design and application of stochastic optimization procedures, known as Evolutionary Algorithms ({EAs}). {EAs} have proven effective and robust in solving demanding optimization problems that are often difficult if not intractable to traditional numerical methods. They are nowadays widely applied in science, engineering, management, and other domains. However, a drawback of {EAs} is their computational complexity which originates from iterative population-based search of the solution space. On the other hand, processing a population of candidate solutions makes {EAs} amenable to parallel implementation that may result in significant calculation speedup. This chapter presents a parallel evolutionary computation framework developed for solving numerical optimization problems with one or more objectives, and evaluates its performance on a high-dimensional optimization task from industrial practice. The chapter starts with an introduction to optimization problems. It distinguishes between single- and multiobjective optimization and reviews the concepts needed to deal with multiobjective optimization problems, such as the dominance relation and Pareto optimality. Next, {EAs} as a general-purpose optimization method are described, with a focus on Differential Evolution ({DE}) which is a particular kind of {EA} used in our framework. Then, parallelization of {EAs} is discussed in view of known parallelization types and speedup calculation. The chapter continues with an introduction to the optimization problem in industrial continuous casting, used as a test problem in this work. Afterwards, the proposed parallel evolutionary computation framework is presented. The framework is based on {DE} and implemented on a cluster of personal computers. It is evaluated on single- and multiobjective variants of the casting optimization problem and the results are analyzed from the perspective of the problem domain and, in particular, the achieved speedup.},
  address = {London},
  author = {Filipi\v{c}, Bogdan and Depolli, Matja\v{z}},
  booktitle = {Parallel Computing},
  chapter = {7},
  citeulike-article-id = {10103403},
  citeulike-linkout-0 = {http://www-e6.ijs.si/\~{}matjaz/articles/filipic\_depolli\_2009.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1007/978-1-84882-409-6\_7},
  citeulike-linkout-2 = {http://www.springerlink.com/content/l30v42723v423u67},
  doi = {10.1007/978-1-84882-409-6\_7},
  editor = {Trobec, Roman and Vajter\v{s}ic, Mari\'{a}n and Zinterhof, Peter},
  isbn = {978-1-84882-408-9},
  pages = {217--240},
  posted-at = {2011-12-07 15:12:27},
  priority = {2},
  publisher = {Springer London},
  title = {Parallel evolutionary computation framework for single- and multiobjective optimization},
  url = {http://www-e6.ijs.si/\~{}matjaz/articles/filipic\_depolli\_2009.pdf},
  year = {2009}
  }

• B. Kaluža, V. Mirčevska, M. Luštrek, I. Velez, and M. Gams, “Ubiquitous care system to support independent living : preliminary results,” in Roots for the future of ambient intelligence: adjunct proceedings, 2009, pp. 308-315.
  [Bibtex]

  @inproceedings{citeulike:10103289,
  abstract = {The European {FP7} project {CONFIDENCE} - Ubiquitous Care System to Support Independent Living is developing a system that will monitor the health conditions of the elderly in real-time based on radio tags placed on the human body. In case of health problems, the system will issue a warning to the user and an alarm to the caregiver if necessary. This way the elderly should gain the needed con dence and security to continue their independent participation in society, thus reducing costs for medical services and burden to the working age pop- ulation. The paper describes work in progress of the reconstruction and interpretation subsystem and presents encouraging results in complexfall detection scenario.},
  author = {Kalu\v{z}a, Bo\v{s}tjan and Mir\v{c}evska, Violeta and Lu\v{s}trek, Mitja and Velez, Igone and Gams, Matja\v{z}},
  booktitle = {Roots for the future of ambient intelligence: adjunct proceedings},
  citeulike-article-id = {10103289},
  citeulike-linkout-0 = {http://dis.ijs.si/bostjan/papers/Kaluza-Ubiquitous\_care\_system\_to\_support\_independent\_living-Preliminary\_results-AmI-09.pdf},
  month = nov,
  pages = {308--315},
  posted-at = {2011-12-07 14:40:04},
  priority = {2},
  title = {Ubiquitous care system to support independent living : preliminary results},
  url = {http://dis.ijs.si/bostjan/papers/Kaluza-Ubiquitous\_care\_system\_to\_support\_independent\_living-Preliminary\_results-AmI-09.pdf},
  year = {2009}
  }

• M. Luštrek, B. Kaluža, E. Dovgan, B. Pogorelc, and M. Gams, “Behavior analysis based on coordinates of body tags,” in Ami 2009, Berlin, Heidelberg, 2009, pp. 14-23.
  [Bibtex]

  @inproceedings{conf/ami/LustrekKDPG09,
  abstract = {This paper describes fall detection, activity recognition and the detection of anomalous gait in the Confidence project. The project aims to prolong the independence of the elderly by detecting falls and other types of behavior indicating a health problem. The behavior will be analyzed based on the coordinates of tags worn on the body. The coordinates will be detected with radio sensors. We describe two Confidence modules. The first one classifies the user's activity into one of six classes, including falling. The second one detects walking anomalies, such as limping, dizziness and hemiplegia. The walking analysis can automatically adapt to each person by using only the examples of normal walking of that person. Both modules employ machine learning: the paper focuses on the features they use and the effect of tag placement and sensor noise on the classification accuracy. Four tags were enough for activity recognition accuracy of over 93\% at moderate sensor noise, while six were needed to detect walking anomalies with the accuracy of over 90\%.},
  address = {Berlin, Heidelberg},
  author = {Lu\v{s}trek, Mitja and Kalu\v{z}a, Bo\v{s}tjan and Dovgan, Erik and Pogorelc, Bogdan and Gams, Matja\v{z}},
  booktitle = {AmI 2009},
  chapter = {2},
  citeulike-article-id = {10102304},
  citeulike-linkout-0 = {http://dis.ijs.si/bostjan/papers/Behavior\%20Analysis\%20Based\%20on\%20Coordinates\%20of\%20Body\%20Tags.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1007/978-3-642-05408-2\_2},
  citeulike-linkout-2 = {http://www.springerlink.com/content/h3p30122x84tl634},
  doi = {10.1007/978-3-642-05408-2\_2},
  editor = {Tscheligi, Manfred and de Ruyter, Boris and Markopoulus, Panos and Wichert, Reiner and Mirlacher, Thomas and Meschterjakov, Alexander and Reitberger, Wolfgang},
  isbn = {978-3-642-05407-5},
  pages = {14--23},
  posted-at = {2011-12-07 09:39:20},
  priority = {2},
  publisher = {Springer Berlin / Heidelberg},
  series = {Lecture notes in computer science},
  title = {Behavior analysis based on coordinates of body tags},
  url = {http://dis.ijs.si/bostjan/papers/Behavior\%20Analysis\%20Based\%20on\%20Coordinates\%20of\%20Body\%20Tags.pdf},
  volume = {5859},
  year = {2009}
  }

• D. Marinčič, M. Gams, and T. Šef, “Intraclausal coordination and clause detection as a preprocessing step to dependency parsing,” in Tsd 2009, Berlin, Heidelberg, 2009, pp. 147-153.
  [Bibtex]

  @inproceedings{conf/tsd/MarincicGS09,
  abstract = {The impact of clause and intraclausal coordination detection to dependency parsing of Slovene is examined. New methods based on machine learning and heuristic rules are proposed for clause and intraclausal coordination detection. They were included in a new dependency parsing algorithm, {PACID}. For evaluation, Slovene dependency treebank was used. At parsing, 6.4\% and 9.2 \% relative error reduction was achieved, compared to the dependency parsers {MSTP} and Malt, respectively.},
  address = {Berlin, Heidelberg},
  author = {Marin\v{c}i\v{c}, Domen and Gams, Matja\v{z} and \v{S}ef, Toma\v{z}},
  booktitle = {TSD 2009},
  chapter = {23},
  citeulike-article-id = {10102299},
  citeulike-linkout-0 = {http://dis.ijs.si/domen/filez/Intraclausal\%20coordination\%20and\%20clause\%20detection\%20as\%20a\%20preprocessing\%20step\%20to\%20dependency\%20parsing.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1007/978-3-642-04208-9\_23},
  citeulike-linkout-2 = {http://www.springerlink.com/content/806135677r0lh41h},
  doi = {10.1007/978-3-642-04208-9\_23},
  editor = {Matou\v{s}ek, V\'{a}clav and Mautner, Pavel},
  isbn = {978-3-642-04207-2},
  pages = {147--153},
  posted-at = {2011-12-07 09:37:07},
  priority = {2},
  publisher = {Springer Berlin / Heidelberg},
  series = {Lecture notes in computer science},
  title = {Intraclausal coordination and clause detection as a preprocessing step to dependency parsing},
  url = {http://dis.ijs.si/domen/filez/Intraclausal\%20coordination\%20and\%20clause\%20detection\%20as\%20a\%20preprocessing\%20step\%20to\%20dependency\%20parsing.pdf},
  volume = {5729},
  year = {2009}
  }

• J. Valentinčič, B. Filipič, and M. Junkar, “Machine learning induction of a model for online parameter selection in EDM rough machining,” The international journal of advanced manufacturing technology, vol. 41, iss. 9, pp. 865-870, 2009.
  [Bibtex]

  @article{citeulike:10102294,
  abstract = {In electrical discharge machining ({EDM}), appropriate average current in the gap has to be selected for the given machining surface in order to obtain the highest material removal rate at low electrode wear. Thus, rough machining parameters have to be selected according to the machining surface. In the case of sculptured features, the machining surface varies with the depth of machining. Hence, the machining parameters have to be selected on-line to obtain appropriate current density in the gap. In this paper, inductive machine learning is used to derive a model based on the voltage and current in the gap. The sufficient inputs to the model are only two discharge attributes extracted from the voltage signal in the gap. The model successfully selects between two machining parameter settings that obtain different average surface current in the gap. It requires only voltage signal acquisition during the machining process and a simple algorithm that is easy to implement on industrial machines.},
  author = {Valentin\v{c}i\v{c}, Jo\v{s}ko and Filipi\v{c}, Bogdan and Junkar, Mihael},
  citeulike-article-id = {10102294},
  citeulike-linkout-0 = {http://dx.doi.org/10.1007/s00170-008-1532-3},
  citeulike-linkout-1 = {http://www.springerlink.com/content/8k4333n33753n674},
  day = {1},
  doi = {10.1007/s00170-008-1532-3},
  issn = {0268-3768},
  journal = {The International Journal of Advanced Manufacturing Technology},
  month = apr,
  number = {9},
  pages = {865--870},
  posted-at = {2011-12-07 09:33:36},
  priority = {2},
  publisher = {Springer London},
  title = {Machine learning induction of a model for online parameter selection in {EDM} rough machining},
  url = {http://dx.doi.org/10.1007/s00170-008-1532-3},
  volume = {41},
  year = {2009}
  }

• D. Marinčič, T. Tušar, M. Gams, and T. Šef, “Analysis of automatic stress assignment in slovene,” Informatica, vol. 20, iss. 1, pp. 35-50, 2009.
  [Bibtex]

  @article{journals/informaticaLT/MarincicTGS09,
  abstract = {We tested the ability of humans and machines (data mining techniques) to assign stress to Slovene words. This is a challenging comparison for machines since humans accomplish the task outstandingly even on unknown words without any context. The goal of finding good machine-made models for stress assignment was set by applying new methods and by making use of a known theory about rules for stress assignment in Slovene. The upgraded data mining methods outperformed expert-defined rules on practically all subtasks, thus showing that data mining can more than compete with humans when constructing formal knowledge about stress assignment is concerned. Unfortunately, compared to humans directly, the data mining methods still failed to achieve as good results as humans on assigning stress to unknown words.},
  author = {Marin\v{c}i\v{c}, Domen and Tu\v{s}ar, Tea and Gams, Matja\v{z} and \v{S}ef, Toma\v{z}},
  citeulike-article-id = {10102290},
  citeulike-linkout-0 = {http://dblp.uni-trier.de/db/journals/informaticaLT/informaticaLT20.html\#MarincicTGS09},
  citeulike-linkout-1 = {http://www.mii.lt/informatica/pdf/INFO748.pdf},
  journal = {Informatica},
  number = {1},
  pages = {35--50},
  posted-at = {2011-12-07 09:30:37},
  priority = {2},
  title = {Analysis of automatic stress assignment in Slovene},
  url = {http://dblp.uni-trier.de/db/journals/informaticaLT/informaticaLT20.html\#MarincicTGS09},
  volume = {20},
  year = {2009}
  }

• M. Luštrek and B. Kaluža, “Fall detection and activity recognition with machine learning,” Informatica, vol. 33, iss. 2, pp. 197-204, 2009.
  [Bibtex]

  @article{journals/informaticaSI/LustrekK09,
  abstract = {Due to the rapid aging of the European population, an effort needs to be made to ensure that the elderly can live longer independently with minimal support of the working-age population. The Confidence project aims to do this by unobtrusively monitoring their activity to recognize falls and other health problems. This is achieved by equipping the user with radio tags, from which the locations of body parts are determined, thus enabling posture and movement reconstruction. In the paper we first give a general overview of the research on fall detection and activity recognition. We proceed to describe the machine learning approach to activity recognition to be used in the Confidence project. In this approach, the attributes characterizing the user's behavior and a machine learning algorithm must be selected. The attributes we consider are the locations of body parts in the reference coordinate system (fixed with respect to the environment), the locations of body parts in a body coordinate system (affixed to the user's body) and the angles between adjacent body parts. Eight machine learning algorithms are compared. The highest classification accuracy of over 95 \% is achieved by Support Vector Machine used on the reference attributes and angles.},
  author = {Lu\v{s}trek, Mitja and Kalu\v{z}a, Bo\v{s}tjan},
  citeulike-article-id = {10102288},
  citeulike-linkout-0 = {http://dblp.uni-trier.de/db/journals/informaticaSI/informaticaSI33.html\#LustrekK09},
  citeulike-linkout-1 = {http://dis.ijs.si/mitjal/documents/Fall\_detection\_and\_activity\_recognition\_with\_machine\_learning-Informatica-09.pdf},
  journal = {Informatica},
  number = {2},
  pages = {197--204},
  posted-at = {2011-12-07 09:27:59},
  priority = {2},
  title = {Fall detection and activity recognition with machine learning},
  url = {http://dblp.uni-trier.de/db/journals/informaticaSI/informaticaSI33.html\#LustrekK09},
  volume = {33},
  year = {2009}
  }

2008

• A. Cundrič, T. Kern, and V. Rajkovič, “A qualitative model for road investment appraisal,” Transport policy, vol. 15, iss. 4, pp. 225-231, 2008.
  [Bibtex]

  @article{citeulike:5330698,
  abstract = {Recent research in transport appraisal has been predominantly performed by using quantitative linear additive methods such as {AHP} and {MAUT}. This paper presents a qualitative model for road investment appraisal based on the {DEX} method. Qualitative modelling and ability to handle inaccurate and/or incomplete data about options make the {DEX} method particularly well suited for decision problems involving qualitative concepts and a great deal of expert judgement as is the case in the field of transport. Introduced is a novel and practical way of road appraisal based on the road appraisal framework aimed to support transport policy development in Slovenia.},
  author = {Cundri\v{c}, A. and Kern, T. and Rajkovi\v{c}, V.},
  citeulike-article-id = {5330698},
  citeulike-linkout-0 = {http://www.omegaconsult.si/omegastara/docs/ddCundric\_\%C4\%8Dlanek.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1016/j.tranpol.2008.05.003},
  doi = {10.1016/j.tranpol.2008.05.003},
  issn = {0967070X},
  journal = {Transport Policy},
  month = jul,
  number = {4},
  pages = {225--231},
  posted-at = {2012-02-16 10:55:20},
  priority = {2},
  title = {A qualitative model for road investment appraisal},
  url = {http://www.omegaconsult.si/omegastara/docs/ddCundric\_\%C4\%8Dlanek.pdf},
  volume = {15},
  year = {2008}
  }

• M. Možina, M. Guid, J. Krivec, A. Sadikov, and I. Bratko, “Fighting knowledge acquisition bottleneck with argument based machine learning,” in European conference on artificial intelligence, 2008, pp. 234-238.
  [Bibtex]

  @inproceedings{conf/ecai/MozinaGKSB08,
  abstract = {Knowledge elicitation is known to be a difficult task and thus a major bottleneck in building a knowledge base. Machine learning has long ago been proposed as a way to alleviate this problem. Machine learning usually helps the domain expert to uncover some of the more tacit concepts. However, the learned concepts are often hard to understand and hard to extend. A common view is that a combination of a domain expert and machine learning would yield the best results. Recently, argument based machine learning ({ABML}) has been introduced as a combination of argumentation and machine learning. Through argumentation, {ABML} enables the expert to articulate his knowledge easily and in a very natural way. {ABML} was shown to significantly improve the comprehensibility and accuracy of the learned concepts. This makes {ABML} a most natural tool for constructing a knowledge base. The present paper shows how this is accomplished through a case study of building a knowledge base of an expert system used in a chess tutoring application.},
  author = {Mo\v{z}ina, Martin and Guid, Matej and Krivec, Jana and Sadikov, Aleksander and Bratko, Ivan},
  booktitle = {European Conference on Artificial Intelligence},
  citeulike-article-id = {10103281},
  citeulike-linkout-0 = {http://www.ailab.si/martin/abml/abml\_expert\_system\_for\_web.pdf},
  editor = {Ghallab, Malik and Spyropoulos, Constantine D. and Fakotakis, Nikos and Avouris, Nikolaos M.},
  isbn = {978-1-58603-891-5},
  pages = {234--238},
  posted-at = {2011-12-07 14:33:55},
  priority = {2},
  publisher = {IOS Press},
  series = {Frontiers in Artificial Intelligence and Applications},
  title = {Fighting knowledge acquisition bottleneck with argument based machine learning},
  url = {http://www.ailab.si/martin/abml/abml\_expert\_system\_for\_web.pdf},
  volume = {178},
  year = {2008}
  }

• M. Guid, M. Možina, J. Krivec, A. Sadikov, and I. Bratko, “Learning positional features for annotating chess games: a case study,” in Computers and games, Berlin, Heidelberg, 2008, pp. 192-204.
  [Bibtex]

  @inproceedings{conf/cg/GuidMKSB08,
  abstract = {By developing an intelligent computer system that will provide commentary of chess moves in a comprehensible, user-friendly, and instructive way, we are trying to use the power demonstrated by the current chess engines for tutoring chess and for annotating chess games. In this paper, we point out certain differences between the computer programs which are specialized for playing chess and our program which is aimed at providing quality commentary. Through a case study, we present an application of argument-based machine learning, which combines the techniques of machine learning and expert knowledge, to the construction of more complex positional features, in order to provide our annotating system with an ability to comment on various positional intricacies of positions in the game of chess.},
  address = {Berlin, Heidelberg},
  author = {Guid, Matej and Mo\v{z}ina, Martin and Krivec, Jana and Sadikov, Aleksander and Bratko, Ivan},
  booktitle = {Computers and Games},
  chapter = {18},
  citeulike-article-id = {10102280},
  citeulike-linkout-0 = {http://www.ailab.si/matej/doc/Learning\_Positional\_Features-Case\_Study.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1007/978-3-540-87608-3\_18},
  citeulike-linkout-2 = {http://www.springerlink.com/content/ck006q330j283357},
  doi = {10.1007/978-3-540-87608-3\_18},
  editor = {van den Herik, H. and Xu, Xinhe and Ma, Zongmin and Winands, Mark},
  isbn = {978-3-540-87607-6},
  issn = {0302-9743},
  pages = {192--204},
  posted-at = {2011-12-07 09:23:57},
  priority = {2},
  publisher = {Springer Berlin / Heidelberg},
  series = {Lecture notes in computer science},
  title = {Learning positional features for annotating chess games: a case study},
  url = {http://www.ailab.si/matej/doc/Learning\_Positional\_Features-Case\_Study.pdf},
  volume = {5131},
  year = {2008}
  }

• G. Leban, J. Žabkar, and I. Bratko, “An experiment in robot discovery with ILP,” in Inductive logic programming, Berlin, Heidelberg, 2008, pp. 77-90.
  [Bibtex]

  @inproceedings{conf/ilp/LebanZB08,
  abstract = {We describe an experiment in the application of {ILP} to autonomous discovery in a robotic domain. An autonomous robot is performing experiments in its world, collecting data and formulating predictive theories about this world. In particular, we are interested in the robot's ” gaining insights” through predicate invention. In the first experimental scenario in a pushing blocks domain, the robot discovers the notion of objects' movability. The second scenario is about discovering the notion of obstacle. We describe experiments with a simulated robot, as well as an experiment with a real robot when robot's observations contain noise.},
  address = {Berlin, Heidelberg},
  author = {Leban, Gregor and \v{Z}abkar, Jure and Bratko, Ivan},
  booktitle = {Inductive Logic Programming},
  chapter = {10},
  citeulike-article-id = {10102274},
  citeulike-linkout-0 = {http://www.xpero.org/wiki/images/6/6c/Ilp2008.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1007/978-3-540-85928-4\_10},
  citeulike-linkout-2 = {http://www.springerlink.com/content/24483700w440x035},
  doi = {10.1007/978-3-540-85928-4\_10},
  editor = {\v{Z}elezn\'{y}, Filip and Lavrac, Nada},
  isbn = {978-3-540-85927-7},
  issn = {0302-9743},
  pages = {77--90},
  posted-at = {2011-12-07 09:20:51},
  priority = {2},
  publisher = {Springer Berlin / Heidelberg},
  series = {Lecture notes in computer science},
  title = {An experiment in robot discovery with {ILP}},
  url = {http://www.xpero.org/wiki/images/6/6c/Ilp2008.pdf},
  volume = {5194},
  year = {2008}
  }

• V. Bulitko, M. Luštrek, J. Schaeffer, Y. Björnsson, and S. Sigmundarson, “Dynamic control in real-time heuristic search,” Journal of artificial intelligence research, vol. 32, pp. 419-452, 2008.
  [Bibtex]

  @article{journals/jair/BulitkoLSBS08,
  abstract = {Real-time heuristic search is a challenging type of agent-centered search because the agents planning time per action is bounded by a constant independent of problem size. Acommon problem that imposes such restrictions is pathfinding in modern computer games where a large number of units must plan their paths simultaneously over large maps. Common search algorithms (e.g., A, {IDA}, D, {ARA}, {AD}) are inherently not real-time and may lose completeness when a constant bound is imposed on per-action planning time. Real-time search algorithms retain completeness but frequently produce unacceptably suboptimal solutions. In this paper, we extend classic and modern real-time search algorithms with an automated mechanism for dynamic depth and subgoal selection. The new algorithms remain real-time and complete. On large computer game maps, they find paths within 7\% of optimal while on average expanding roughly a single state per action. This is nearly a three-fold improvement in suboptimality over the existing state-of-the-art algorithms and, at the same time, a 15-fold improvement in the amount of planning per action.},
  author = {Bulitko, Vadim and Lu\v{s}trek, Mitja and Schaeffer, Jonathan and Bj\"{o}rnsson, Yngvi and Sigmundarson, Sverrir},
  citeulike-article-id = {10102263},
  citeulike-linkout-0 = {http://www.aaai.org/Papers/JAIR/Vol32/JAIR-3210.pdf},
  citeulike-linkout-1 = {http://dblp.uni-trier.de/db/journals/jair/jair32.html\#BulitkoLSBS08},
  journal = {Journal of Artificial Intelligence Research},
  pages = {419--452},
  posted-at = {2011-12-07 09:18:23},
  priority = {2},
  title = {Dynamic control in real-time heuristic search},
  url = {http://www.aaai.org/Papers/JAIR/Vol32/JAIR-3210.pdf},
  volume = {32},
  year = {2008}
  }

• M. Gams and J. Krivec, “Demographic analysis of fertility using data mining tools,” Informatica, vol. 32, iss. 2, pp. 147-156, 2008.
  [Bibtex]

  @article{journals/informaticaSI/GamsK08,
  abstract = {This paper used data mining techniques to discover which attributes have the highest impact on country fertility rates. The data was analyzed in various ways; altogether and joined in smaller, meaningful groups, such as sociological, economical, philosophical, biological, etc. The paper separately analyzed different groups of countries, current state and fertility trends, and tested several class schemas. Most relevant decision trees are presented and interpreted showing some known and some new conclusions. The iterative use of data mining techniques again proved to be successful in finding complex relations, but still needing expert interpretation as any computer method.},
  author = {Gams, Matja\v{z} and Krivec, Jana},
  citeulike-article-id = {10099486},
  citeulike-linkout-0 = {http://dblp.uni-trier.de/db/journals/informaticaSI/informaticaSI32.html\#GamsK08},
  citeulike-linkout-1 = {http://www.informatica.si/PDF/32-2/05\_Gams-Demographic\%20Analysis\%20of\%20Fertility\%20Using\%20Data\%20Mining\%20Tools.pdf},
  journal = {Informatica},
  number = {2},
  pages = {147--156},
  posted-at = {2011-12-06 15:40:43},
  priority = {2},
  title = {Demographic analysis of fertility using data mining tools},
  url = {http://dblp.uni-trier.de/db/journals/informaticaSI/informaticaSI32.html\#GamsK08},
  volume = {32},
  year = {2008}
  }

• M. Guid, A. Perez, and I. Bratko, “How trustworthy is CRAFTY’s analysis of world chess champions?,” Icga journal, vol. 31, pp. 131-144, 2008.
  [Bibtex]

  @article{citeulike:10099481,
  abstract = {In 2006, Guid and Bratko carried out a computer analysis of games played by World Chess Champions in an attempt to assess as objective as possible one aspect of the playing strength of chess players of different times. The chess program {CRAFTY} was used in the analysis. Given that {CRAFTY}'s official chess rating is lower than the rating of many of the players analysed, the question arises to what degree that analysis could be trusted. In this paper, we investigate this question and other aspects of the trustworthiness of those results. Our study shows that, at least for pairs of the players whose scores differ significantly, it is not very likely that their relative rankings would change if (1) a stronger chess program was used, or (2) if the program would search more deeply, or (3) larger sets of positions were available for the analysis. Experimental results and theoretical explanations are provided to show that, in order to obtain a sensible ranking of the players according to the criterion considered, it is not necessary to use a computer that is stronger than the players themselves.},
  author = {Guid, Matej and Perez, Aritz and Bratko, Ivan},
  citeulike-article-id = {10099481},
  citeulike-linkout-0 = {http://www.ailab.si/matej/doc/How\_Trustworthy\_is\_Craftys\_Analysis.pdf},
  journal = {ICGA journal},
  month = sep,
  pages = {131--144},
  posted-at = {2011-12-06 15:37:43},
  priority = {2},
  title = {How trustworthy is {CRAFTY}'S analysis of world chess champions?},
  url = {http://www.ailab.si/matej/doc/How\_Trustworthy\_is\_Craftys\_Analysis.pdf},
  volume = {31},
  year = {2008}
  }

• I. Fister, M. Mernik, and B. Filipič, “Optimization of markers in clothing industry,” Engineering applications of artificial intelligence, vol. 21, iss. 4, pp. 669-678, 2008.
  [Bibtex]

  @article{journals/eaai/FisterMF08,
  abstract = {The optimization of markers is one of the most important preparatory steps for production in the clothing industry. It determines the sizes of clothes to be laid and cut together. Markers are built on a work order basis. The work order is a matrix of sizes by colors that have to be covered by markers in an optimal way. The optimal way can be defined in a number of ways: it can be the minimum number of markers to accomplish the work order, or the least time for fulfilling the work order, or the minimal amount of cloth used. In this article, the problem of marker optimization is treated formally. The problem is transformed into the 0/1 knapsack problem and solved using evolutionary algorithms. The results obtained on ten real-world work orders show an important improvement over the previously best known solutions.},
  author = {Fister, Iztok and Mernik, Marjan and Filipi\v{c}, Bogdan},
  citeulike-article-id = {10099465},
  citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.engappai.2007.06.002},
  doi = {10.1016/j.engappai.2007.06.002},
  issn = {09521976},
  journal = {Engineering Applications of Artificial Intelligence},
  month = jun,
  number = {4},
  pages = {669--678},
  posted-at = {2011-12-06 15:31:16},
  priority = {2},
  title = {Optimization of markers in clothing industry},
  url = {http://dx.doi.org/10.1016/j.engappai.2007.06.002},
  volume = {21},
  year = {2008}
  }

• M. Luštrek, “Pathology in heuristic search,” Ai communications, vol. 21, iss. 2, pp. 211-213, 2008.
  [Bibtex]

  @article{journals/aicom/Lustrek08,
  abstract = {Practice shows that game-playing programs using minimax search perform better when searching deeper. Mathematical analyses, however, showed the opposite. This paradox was termed minimax pathology. Our real-valued minimax model demonstrates that appropriate modeling of the heuristic error is enough to eliminate the pathology. We examine the conditions under which the pathology appears and explain the mechanism that makes minimax otherwise beneficial. The reasons for the pathology in single-agent search are also addressed.},
  author = {Lu\v{s}trek, Mitja},
  citeulike-article-id = {10099459},
  citeulike-linkout-0 = {http://dis.ijs.si/mitjal/documents/Pathology\_in\_Heuristic\_Search-AI\_Communications-08.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.3233/aic-2008-0420},
  citeulike-linkout-2 = {http://iospress.metapress.com/content/u676507k1781g891},
  day = {1},
  doi = {10.3233/aic-2008-0420},
  journal = {AI Communications},
  month = jan,
  number = {2},
  pages = {211--213},
  posted-at = {2011-12-06 15:29:11},
  priority = {2},
  title = {Pathology in heuristic search},
  url = {http://dis.ijs.si/mitjal/documents/Pathology\_in\_Heuristic\_Search-AI\_Communications-08.pdf},
  volume = {21},
  year = {2008}
  }

2007

• V. Rajkovič, L. Dečman, and A. Stare, “Internet communication by students of secondary education,” New media in education (nme): selected topics, pp. 159-165, 2007.
  [Bibtex]

  @article{citeulike:10359448,
  author = {Rajkovi\v{c}, Vladislav and De\v{c}man, Lina and Stare, Ana},
  citeulike-article-id = {10359448},
  journal = {New media in education (NME): selected topics},
  pages = {159--165},
  posted-at = {2012-02-16 11:38:26},
  priority = {2},
  title = {Internet communication by students of secondary education},
  year = {2007}
  }

• U. Rajkovič and V. Rajkovič, “Team-work in the context of technological challenges,” New media in education (nme): selected topics, pp. 98-104, 2007.
  [Bibtex]

  @article{citeulike:10359447,
  author = {Rajkovi\v{c}, Uro\v{s} and Rajkovi\v{c}, Vladislav},
  citeulike-article-id = {10359447},
  journal = {New media in education (NME): selected topics},
  pages = {98--104},
  posted-at = {2012-02-16 11:37:10},
  priority = {2},
  title = {Team-work in the context of technological challenges},
  year = {2007}
  }

• G. Leban, M. Mramor, B. Zupan, J. Demšar, and I. Bratko, “Finding patterns in class-labeled data using data visualization,” Data mining patterns: new methods and applications, pp. 106-123, 2007.
  [Bibtex]

  @article{citeulike:10106869,
  abstract = {Data visualization plays a crucial role in data mining and knowledge discovery. Its use is, however, often difficult due to the large number of possible data projections. Manual search through such sets of projections can be prohibitively timely or even impossible, especially in the data analysis problems that comprise many data features. The chapter describes a method called {VizRank}, which can be used to automatically identify interesting data projections for multivariate visualizations of class-labeled data. {VizRank} assigns a score of interestingness to each considered projection based on the degree of separation of data instances with different class label. We demonstrate the usefulness of this approach on six cancer gene expression data sets, showing that the method can reveal interesting data patterns and can further be used for data classification and outlier detection.},
  author = {Leban, Gregor and Mramor, Minca and Zupan, Bla\v{z} and Dem\v{s}ar, Janez and Bratko, Ivan},
  booktitle = {Data Mining Patterns},
  chapter = {5},
  citeulike-article-id = {10106869},
  citeulike-linkout-0 = {http://www.irma-international.org/viewtitle/7562/},
  day = {31},
  editor = {Poncelet, Pascal and Masseglia, Florent and Teisseire, Maguelonne},
  isbn = {9781599041629},
  journal = {Data mining patterns: new methods and applications},
  month = aug,
  pages = {106--123},
  posted-at = {2011-12-08 13:21:50},
  priority = {2},
  publisher = {IGI Global},
  title = {Finding patterns in class-labeled data using data visualization},
  url = {http://www.irma-international.org/viewtitle/7562/},
  year = {2007}
  }

• A. Sadikov and I. Bratko, “Search versus knowledge revisited again,” in Computers and games, Berlin, Heidelberg, 2007, pp. 172-180.
  [Bibtex]

  @inproceedings{conf/cg/SadikovB06,
  abstract = {The questions focusing on diminishing returns for additional search effort have been a burning issue in computer chess. Despite a lot of research in this field, there are still some open questions, e.g., what happens at search depths beyond 12 plies, and what is the effect of the program's knowledge on diminishing returns? The paper presents an experiment that attempts to answer these questions. The results (a) confirm that diminishing returns in chess exist, and more importantly (b) show that the amount of knowledge a program has influences when diminishing returns will start to manifest themselves.},
  address = {Berlin, Heidelberg},
  author = {Sadikov, Aleksander and Bratko, Ivan},
  booktitle = {Computers and Games},
  chapter = {15},
  citeulike-article-id = {10099447},
  citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-3-540-75538-8\_15},
  citeulike-linkout-1 = {http://www.springerlink.com/content/n16842742u1422u7},
  doi = {10.1007/978-3-540-75538-8\_15},
  editor = {van den Herik, H. and Ciancarini, Paolo and Donkers, H.},
  isbn = {978-3-540-75537-1},
  journal = {Lecture notes in computer science},
  pages = {172--180},
  posted-at = {2011-12-06 15:25:28},
  priority = {2},
  publisher = {Springer Berlin / Heidelberg},
  series = {Lecture notes in computer science},
  title = {Search versus knowledge revisited again},
  url = {http://dx.doi.org/10.1007/978-3-540-75538-8\_15},
  volume = {4630},
  year = {2007}
  }

• A. Sadikov, M. Možina, M. Guid, J. Krivec, and I. Bratko, “Automated chess tutor,” in Computers and games, Berlin, Heidelberg, 2007, pp. 13-25.
  [Bibtex]

  @inproceedings{conf/cg/SadikovMGKB06,
  abstract = {While recently the strength of chess-playing programs has grown immensely, their capability of explaining in human understandable terms why some moves are good or bad has enjoyed little attention. Progress towards programs with an ability to provide intelligent commentary on chess games, either played by a program or by a human, has been negligible in comparison with the progress concerning playing strength. The typical style of a program's ” comments” (in terms of the best variations and their numerical scores) is of little use to a human who wants to learn important concepts behind the variations.
  In this paper, we present some core mechanisms for automated commenting in terms of relevant goals to be achieved or preserved in a given position. By combining these mechanisms with an actual chess engine we were able to transform this engine into a chess tutor/annotator that is capable of generating rather intelligent commentary. The main advantages of our work over related approaches are: (a) it has the ability to act as a tutor for the whole game of chess, and (b) it has a relatively solid chess understanding and is thus able to adequately comment on positional aspects.},
  address = {Berlin, Heidelberg},
  author = {Sadikov, Aleksander and Mo\v{z}ina, Martin and Guid, Matej and Krivec, Jana and Bratko, Ivan},
  booktitle = {Computers and Games},
  chapter = {2},
  citeulike-article-id = {10099441},
  citeulike-linkout-0 = {http://www.ailab.si/matej/doc/Automated\_Chess\_Tutor.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1007/978-3-540-75538-8\_2},
  citeulike-linkout-2 = {http://www.springerlink.com/content/v45jp22756487p70},
  doi = {10.1007/978-3-540-75538-8\_2},
  editor = {van den Herik, H. and Ciancarini, Paolo and Donkers, H.},
  isbn = {978-3-540-75537-1},
  journal = {Lecture notes in computer science},
  pages = {13--25},
  posted-at = {2011-12-06 15:22:37},
  priority = {2},
  publisher = {Springer Berlin / Heidelberg},
  series = {Lecture notes in computer science},
  title = {Automated chess tutor},
  url = {http://www.ailab.si/matej/doc/Automated\_Chess\_Tutor.pdf},
  volume = {4630},
  year = {2007}
  }

• M. Guid and I. Bratko, “Computer analysis of chess champions,” in Computers and games, Berlin, Heidelberg, 2007, pp. 1-12.
  [Bibtex]

  @inproceedings{conf/cg/GuidB06,
  abstract = {Who is the best chess player of all time? Chess players are often interested in this question that has never been answered authoritatively, because it requires a comparison between chess players of different eras who never met across the board. In this contribution, we attempt to make such a comparison. It is based on the evaluation of the games played by the World Chess Champions in their championship matches. The evaluation is performed by the chess-playing program Crafty. For this purpose we slightly adapted Crafty. Our analysis takes into account the differences in players' styles to compensate the fact that calm positional players in their typical games have less chance to commit gross tactical errors than aggressive tactical players. Therefore, we designed a method to assess the difficulty of positions. Some of the results of this computer analysis might be quite surprising. Overall, the results can be nicely interpreted by a chess expert.},
  address = {Berlin, Heidelberg},
  author = {Guid, Matej and Bratko, Ivan},
  booktitle = {Computers and Games},
  chapter = {1},
  citeulike-article-id = {10099424},
  citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-3-540-75538-8\_1},
  citeulike-linkout-1 = {http://www.springerlink.com/content/6247124552gg5065},
  doi = {10.1007/978-3-540-75538-8\_1},
  editor = {van den Herik, H. and Ciancarini, Paolo and Donkers, H.},
  isbn = {978-3-540-75537-1},
  journal = {Lecture notes in computer science},
  pages = {1--12},
  posted-at = {2011-12-06 15:19:11},
  priority = {2},
  publisher = {Springer Berlin / Heidelberg},
  series = {Lecture notes in computer science},
  title = {Computer analysis of chess champions},
  url = {http://dx.doi.org/10.1007/978-3-540-75538-8\_1},
  volume = {4630},
  year = {2007}
  }

• D. Vladušič, B. Kompare, and I. Bratko, “Use of qualitative constraints in modelling of the lake glumso,” International journal of environment and pollution, vol. 31, iss. 1/2, pp. 107-124, 2007.
  [Bibtex]

  @article{citeulike:10099412,
  abstract = {This paper describes modelling of time behaviour of phytoplankton and zooplankton in the Danish lake Glumso with a recently developed approach to machine learning in numerical domains, called Q2 learning. An essential part of this approach is qualitative constraints which were either handcrafted using knowledge from the {Lotka-Volterra} predator-prey model or induced directly from the collected data with a program called {QUIN}. The induced models were evaluated by a domain expert. We performed a comparison between numerical results of the Q2 learning approach and standard machine learning algorithms. The results suggest that use of qualitative constraints leads to more accurate quantitative predictions.},
  author = {Vladu\v{s}i\v{c}, Daniel and Kompare, Boris and Bratko, Ivan},
  citeulike-article-id = {10099412},
  citeulike-linkout-0 = {http://dx.doi.org/10.1504/ijep.2007.015668},
  doi = {10.1504/ijep.2007.015668},
  issn = {0957-4352},
  journal = {International Journal of Environment and Pollution},
  number = {1/2},
  pages = {107--124},
  posted-at = {2011-12-06 15:15:42},
  priority = {2},
  title = {Use of qualitative constraints in modelling of the Lake Glumso},
  url = {http://dx.doi.org/10.1504/ijep.2007.015668},
  volume = {31},
  year = {2007}
  }

• M. Gams and T. Tušar, “Intelligent high-security access control,” Informatica, vol. 31, iss. 4, pp. 469-477, 2007.
  [Bibtex]

  @article{journals/informaticaSI/GamsT07,
  abstract = {Access control is an important security issue in particular because of terrorist threats. Access points are increasingly becoming equipped with advanced input sensors often based on biometrics, and with advanced intelligent methods that learn from experience. We have designed a flexible modular system based on integration of arbitrary access sensors and an arbitrary number of stand-alone modules. The system was tested with four sensors (a door sensor, an identity card reader, a fingerprint reader and a camera) and four independent modules (expert-defined rules, micro learning, macro learning and visual learning). Preliminary tests of the designed prototype are encouraging.},
  author = {Gams, Matja\v{z} and Tu\v{s}ar, Tea},
  citeulike-article-id = {10099406},
  citeulike-linkout-0 = {http://dblp.uni-trier.de/db/journals/informaticaSI/informaticaSI31.html\#GamsT07},
  citeulike-linkout-1 = {http://www.informatica.si/PDF/31-4/13\_Gams-Intelligent.pdf},
  journal = {Informatica},
  number = {4},
  pages = {469--477},
  posted-at = {2011-12-06 15:13:51},
  priority = {2},
  title = {Intelligent high-security access control},
  url = {http://dblp.uni-trier.de/db/journals/informaticaSI/informaticaSI31.html\#GamsT07},
  volume = {31},
  year = {2007}
  }

• A. Dobnikar and A. Nemec, “eGovernment in Slovenia.,” Informatica, vol. 31, iss. 4, pp. 357-365, 2007.
  [Bibtex]

  @article{journals/informaticaSI/DobnikarN07,
  abstract = {In Slovenia, like elsewhere in the European Union, the {eGovernment} is one of the features of the modern face of the public administration. The other features at the forefront of the makeover are the reduction of administrative barriers, the improvement of services offered by the public administration (and subsequently the satisfaction of its users), the introduction of quality management and business excellence tools, and human resource management. What we are doing in Slovenia is by no means a reform of the public administration, as there are no revolutionary changes. Instead, we prefer to speak of a process of perpetual improvement, as that applied in successful businesses, with the aim of constantly improving operations.
  The {eGovernment} project in Slovenia represents the use of information and communication technologies as a tool to making the public administration better. Technology can help the public administration function more transparent and make it easier to manage, reducing its operating costs and improving the quality and accessibility of its services.},
  author = {Dobnikar, Ale\v{s} and Nemec, Alenka},
  citeulike-article-id = {10099398},
  citeulike-linkout-0 = {http://dblp.uni-trier.de/db/journals/informaticaSI/informaticaSI31.html\#DobnikarN07},
  citeulike-linkout-1 = {http://www.informatica.si/PDF/31-4/01\_Dobnikar-eGovernment.pdf},
  journal = {Informatica},
  number = {4},
  pages = {357--365},
  posted-at = {2011-12-06 15:09:57},
  priority = {2},
  title = {{eGovernment} in Slovenia.},
  url = {http://dblp.uni-trier.de/db/journals/informaticaSI/informaticaSI31.html\#DobnikarN07},
  volume = {31},
  year = {2007}
  }

• B. Filipič, E. Laitinen, and T. Tušar, “Preliminary numerical experiments in multiobjective optimization of a metallurgical production process,” Informatica, vol. 31, iss. 2, pp. 233-240, 2007.
  [Bibtex]

  @article{journals/informaticaSI/FilipicLT07,
  abstract = {This paper reports on preliminary numerical experiments in optimizing coolant flows in continuous casting of steel with respect to multiple objectives. For this purpose, Differential Evolution for Multiobjective Optimization ({DEMO}) coupled with a reliable numerical simulator of the casting process was applied. The algorithm parameters were initially tuned to balance between the quality of the expected results and the computational cost of the optimization process. Afterwards, suitable sets of coolant flow settings were calculated under conflicting requirements for minimum temperature deviations and predefined core length in the caster. In contrast to solutions produced in single-objective optimization, approximation sets of Pareto optimal fronts obtained in multiobjective optimization provide more information to metallurgists and allow for better insight into the casting process.},
  author = {Filipi\v{c}, Bogdan and Laitinen, Erkki and Tu\v{s}ar, Tea},
  citeulike-article-id = {10099388},
  citeulike-linkout-0 = {http://www.informatica.si/PDF/31-2/12\_Filipic-Preliminary\%20Numerical\%20Experiments\%20in...pdf},
  citeulike-linkout-1 = {http://dblp.uni-trier.de/db/journals/informaticaSI/informaticaSI31.html\#FilipicLT07},
  journal = {Informatica},
  number = {2},
  pages = {233--240},
  posted-at = {2011-12-06 15:06:04},
  priority = {2},
  title = {Preliminary numerical experiments in multiobjective optimization of a metallurgical production process},
  url = {http://www.informatica.si/PDF/31-2/12\_Filipic-Preliminary\%20Numerical\%20Experiments\%20in...pdf},
  volume = {31},
  year = {2007}
  }

• M. Guid and I. Bratko, “Factors affecting diminishing returns for searching deeper.,” Icga journal, vol. 30, iss. 2, pp. 75-84, 2007.
  [Bibtex]

  @article{journals/icga/GuidB07,
  abstract = {The phenomenon of diminishing returns for additional search effort has been observed by several researchers. We study experimentally additional factors which influence the behaviour of diminishing returns that manifest themselves in go-deep experiments. The results obtained on a large set of more than 40,000 positions from chess grandmaster games using the programs {CRAFTY}, {RYBKA}, and {SHREDDER} show that diminishing returns depend on (a) the values of the positions, (b) the quality of the evaluation function of the program used, and to some extent also on (c) the phase of the game, and the amount of material on the board.},
  author = {Guid, Matej and Bratko, Ivan},
  citeulike-article-id = {10099377},
  citeulike-linkout-0 = {http://www.ailab.si/matej/doc/Factors\_Affecting\_Diminishing\_Returns.pdf},
  citeulike-linkout-1 = {http://dblp.uni-trier.de/db/journals/icga/icga30.html\#GuidB07},
  journal = {ICGA Journal},
  number = {2},
  pages = {75--84},
  posted-at = {2011-12-06 14:59:08},
  priority = {2},
  title = {Factors affecting diminishing returns for searching deeper.},
  url = {http://www.ailab.si/matej/doc/Factors\_Affecting\_Diminishing\_Returns.pdf},
  volume = {30},
  year = {2007}
  }

• A. Pivk, P. Cimiano, Y. Sure, M. Gams, V. Rajkovič, and R. Studer, “Transforming arbitrary tables into logical form with TARTAR,” Data & knowledge engineering, vol. 60, iss. 3, pp. 567-595, 2007.
  [Bibtex]

  @article{journals/dke/PivkCSGRS07,
  abstract = {The tremendous success of the World Wide Web is countervailed by efforts needed to search and find relevant information. For tabular structures embedded in {HTML} documents, typical keyword or link-analysis based search fails. The Semantic Web relies on annotating resources such as documents by means of ontologies and aims to overcome the bottleneck of finding relevant information. Turning the current Web into a Semantic Web requires automatic approaches for annotation since manual approaches will not scale in general. Most efforts have been devoted to automatic generation of ontologies from text, but with quite limited success. However, tabular structures require additional efforts, mainly because understanding of table contents requires the comprehension of the logical structure of the table on the one hand, as well as its semantic interpretation on the other. The focus of this paper is on the automatic transformation and generation of semantic ({F-Logic}) frames from table-like structures. The presented work consists of a methodology, an accompanying implementation (called {TARTAR}) and a thorough evaluation. It is based on a grounded cognitive table model which is stepwise instantiated by the methodology. A typical application scenario is the automatic population of ontologies to enable query answering over arbitrary tables (e.g. {HTML} tables).},
  author = {Pivk, Aleksander and Cimiano, Philipp and Sure, York and Gams, Matja\v{z} and Rajkovi\v{c}, Vladislav and Studer, Rudi},
  citeulike-article-id = {10099364},
  citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.datak.2006.04.002},
  doi = {10.1016/j.datak.2006.04.002},
  issn = {0169023X},
  journal = {Data \& Knowledge Engineering},
  month = mar,
  number = {3},
  pages = {567--595},
  posted-at = {2011-12-06 14:54:14},
  priority = {2},
  title = {Transforming arbitrary tables into logical form with {TARTAR}},
  url = {http://dx.doi.org/10.1016/j.datak.2006.04.002},
  volume = {60},
  year = {2007}
  }

• A. Srdoč, I. Bratko, and A. Sluga, “Machine learning applied to quality management — a study in ship repair domain,” Computers in industry, vol. 58, iss. 5, pp. 464-473, 2007.
  [Bibtex]

  @article{journals/cii/SrdocBS07,
  abstract = {The awareness about the importance of knowledge within the quality management community is increasing. For example, the Malcolm Baldrige Criteria for Performance Excellence recently included knowledge management into one of its categories. However, the emphasis in research related to knowledge management is mostly on knowledge creation and dissemination, and not knowledge formalisation process. On the other hand, identifying the expert knowledge and experience as crucial for the output quality, especially in dynamic industries with high share of incomplete and unreliable information such as ship repair, this paper argues how important it is to have such knowledge formalised. The paper demonstrates by example of delivery time estimate how for that purpose the deep quality concept ({DQC})-a novel knowledge-focused quality management framework, and machine learning methodology could be effectively used. In the concluding part of the paper, the accuracy of the obtained prediction models is analysed, and the chosen model is discussed. The research indicates that standardisation of problem domain notions and expertly designed databases with possible interface to machine learning algorithms need to be considered as an integral part of any quality management system in the future, in addition to conventional quality management concepts.},
  author = {Srdo\v{c}, Alira and Bratko, Ivan and Sluga, Alojzij},
  citeulike-article-id = {10099351},
  citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.compind.2006.09.013},
  doi = {10.1016/j.compind.2006.09.013},
  issn = {01663615},
  journal = {Computers in Industry},
  month = jun,
  number = {5},
  pages = {464--473},
  posted-at = {2011-12-06 14:48:45},
  priority = {2},
  title = {Machine learning applied to quality management — A study in ship repair domain},
  url = {http://dx.doi.org/10.1016/j.compind.2006.09.013},
  volume = {58},
  year = {2007}
  }

• M. Možina, J. Žabkar, and I. Bratko, “Argument based machine learning,” Artificial intelligence, vol. 171, iss. 10-15, pp. 922-937, 2007.
  [Bibtex]

  @article{journals/ai/MozinaZB07,
  abstract = {We present a novel approach to machine learning, called {ABML} (argumentation based {ML}). This approach combines machine learning from examples with concepts from the field of argumentation. The idea is to provide expert's arguments, or reasons, for some of the learning examples. We require that the theory induced from the examples explains the examples in terms of the given reasons. Thus arguments constrain the combinatorial search among possible hypotheses, and also direct the search towards hypotheses that are more comprehensible in the light of expert's background knowledge. In this paper we realize the idea of {ABML} as rule learning. We implement {ABCN2}, an argument-based extension of the {CN2} rule learning algorithm, conduct experiments and analyze its performance in comparison with the original {CN2} algorithm.},
  address = {Essex, UK},
  author = {Mo\v{z}ina, Martin and \v{Z}abkar, Jure and Bratko, Ivan},
  citeulike-article-id = {6586261},
  citeulike-linkout-0 = {http://www.sciencedirect.com/science?\_ob=MiamiImageURL\&\#38;\_cid=271585\&\#38;\_user=10\&\#38;\_pii=S0004370207000690\&\#38;\_check=y\&\#38;\_origin=\&\#38;\_coverDate=31-Oct-2007\&\#38;view=c\&\#38;wchp=dGLzVlB-zSkWA\&\#38;md5=b3bb465f9dfcaaf71547199682b0f164/1-s2.0-S0004370207000690-main.pdf},
  citeulike-linkout-1 = {http://portal.acm.org/citation.cfm?id=1285100},
  citeulike-linkout-2 = {http://dx.doi.org/10.1016/j.artint.2007.04.007},
  doi = {10.1016/j.artint.2007.04.007},
  issn = {00043702},
  journal = {Artificial Intelligence},
  month = jul,
  number = {10-15},
  pages = {922--937},
  posted-at = {2011-12-06 14:45:26},
  priority = {2},
  publisher = {Elsevier Science Publishers Ltd.},
  title = {Argument based machine learning},
  url = {http://www.sciencedirect.com/science?\_ob=MiamiImageURL\&\#38;\_cid=271585\&\#38;\_user=10\&\#38;\_pii=S0004370207000690\&\#38;\_check=y\&\#38;\_origin=\&\#38;\_coverDate=31-Oct-2007\&\#38;view=c\&\#38;wchp=dGLzVlB-zSkWA\&\#38;md5=b3bb465f9dfcaaf71547199682b0f164/1-s2.0-S0004370207000690-main.pdf},
  volume = {171},
  year = {2007}
  }

• T. Tušar, P. Korošec, G. Papa, B. Filipič, and J. Šilc, “A comparative study of stochastic optimization methods in electric motor design,” Applied intelligence, vol. 27, iss. 2, pp. 101-111, 2007.
  [Bibtex]

  @article{journals/apin/TusarKPFS07,
  abstract = {The efficiency of universal electric motors that are widely used in home appliances can be improved by optimizing the geometry of the rotor and the stator. Expert designers traditionally approach this task by iteratively evaluating candidate designs and improving them according to their experience. However, the existence of reliable numerical simulators and powerful stochastic optimization techniques make it possible to automate the design procedure. We present a comparative study of six stochastic optimization algorithms in designing optimal rotor and stator geometries of a universal electric motor where the primary objective is to minimize the motor power losses. We compare three methods from the domain of evolutionary computation, generational evolutionary algorithm, steady-state evolutionary algorithm and differential evolution, two particle-based methods, particle-swarm optimization and electromagnetism-like algorithm, and a recently proposed multilevel ant stigmergy algorithm. By comparing their performance, the most efficient method for solving the problem is identified and an explanation of its success is offered.},
  author = {Tu\v{s}ar, Tea and Koro\v{s}ec, Peter and Papa, Gregor and Filipi\v{c}, Bogdan and \v{S}ilc, Jurij},
  citeulike-article-id = {989963},
  citeulike-linkout-0 = {http://dx.doi.org/10.1007/s10489-006-0022-2},
  citeulike-linkout-1 = {http://www.springerlink.com/content/y3512xg1q3pjq687},
  day = {1},
  doi = {10.1007/s10489-006-0022-2},
  issn = {0924-669X},
  journal = {Applied Intelligence},
  month = oct,
  number = {2},
  pages = {101--111},
  posted-at = {2011-12-06 14:41:35},
  priority = {2},
  publisher = {Springer Netherlands},
  title = {A comparative study of stochastic optimization methods in electric motor design},
  url = {http://dx.doi.org/10.1007/s10489-006-0022-2},
  volume = {27},
  year = {2007}
  }

2006

• A. Krapež and V. Rajkovič, “Model of teaching decision making in the frame of general education,” Comparative pedagogy: selected topics, pp. 195-204, 2006.
  [Bibtex]

  @article{citeulike:10359446,
  author = {Krape\v{z}, Alenka and Rajkovi\v{c}, Vladislav},
  citeulike-article-id = {10359446},
  journal = {Comparative pedagogy: selected topics},
  pages = {195--204},
  posted-at = {2012-02-16 11:35:34},
  priority = {2},
  title = {Model of teaching decision making in the frame of general education},
  year = {2006}
  }

• M. Možina, J. Žabkar, and I. Bratko, “Argument based rule learning,” in European conference on artificial intelligence, 2006, pp. 504-508.
  [Bibtex]

  @inproceedings{conf/ecai/MozinaZB06,
  abstract = {We present a novel approach to machine learning, called {ABML} (argumentation based {ML}). This approach combines machine learning from examples with concepts from the field of argumentation. The idea is to provide expert's arguments, or reasons, for some of the learning examples. We require that the theory induced from the examples explains the examples in terms of the given reasons. Thus arguments constrain the combinatorial search among possible hypotheses, and also direct the search towards hypotheses that are more comprehensible in the light of expert's background knowledge. In this paper we implement {ABCN2} as an extension of the {CN2} rule learning algorithm, and analyze its advantages in comparison with the original {CN2} algorithm.},
  author = {Mo\v{z}ina, Martin and \v{Z}abkar, Jure and Bratko, Ivan},
  booktitle = {European Conference on Artificial Intelligence},
  citeulike-article-id = {10103266},
  citeulike-linkout-0 = {http://robolab.cse.unsw.edu.au/conferences/ECAI-2006/ecai/papers/ECAI06\_102.pdf},
  editor = {Brewka, Gerhard and Coradeschi, Silvia and Perini, Anna and Traverso, Paolo},
  isbn = {1-58603-642-4},
  pages = {504--508},
  posted-at = {2011-12-07 14:29:50},
  priority = {2},
  publisher = {IOS Press},
  series = {Frontiers in Artificial Intelligence and Applications},
  title = {Argument based rule learning},
  url = {http://robolab.cse.unsw.edu.au/conferences/ECAI-2006/ecai/papers/ECAI06\_102.pdf},
  volume = {141},
  year = {2006}
  }

• A. Sadikov and I. Bratko, “Pessimistic heuristics beat optimistic ones in real-time search,” in European conference on artificial intelligence, 2006.
  [Bibtex]

  @inproceedings{conf/ecai/SadikovB06,
  abstract = {Admissibility is a desired property of heuristic evaluation functions, because when these heuristics are used with complete search methods, such as A* and {RBFS}, they guarantee that an optimal solution will be found. Since every optimistic heuristic function is admissible, optimistic functions are widely used. We show, however, that with incomplete, real-time search, optimistic functions lose their appeal, and in fact they may hinder the search under quite reasonable conditions. Under these conditions the exact opposite is to be preferred, i.e. pessimistic heuristic functions that never underestimate the difficulty of the problem. We demonstrate that such heuristics behave better than optimistic ones of equal quality on a standard testbed using {RTA}* search method.},
  author = {Sadikov, Aleksander and Bratko, Ivan},
  booktitle = {European Conference on Artificial Intelligence},
  citeulike-article-id = {10103227},
  citeulike-linkout-0 = {http://unh-ai.pbworks.com/f/pessimistic-ecai06.pdf},
  editor = {Brewka, Gerhard and Coradeschi, Silvia and Perini, Anna and Traverso, Paolo},
  isbn = {1-58603-642-4},
  posted-at = {2011-12-07 14:24:25},
  priority = {2},
  series = {Frontiers in Artificial Intelligence and Applications},
  title = {Pessimistic heuristics beat optimistic ones in real-time search},
  url = {http://unh-ai.pbworks.com/f/pessimistic-ecai06.pdf},
  volume = {141},
  year = {2006}
  }

• A. Bežek, M. Gams, and I. Bratko, “Multi-agent strategic modeling in a robotic soccer domain,” in Proceedings of the fifth international joint conference on autonomous agents and multiagent systems, New York, NY, USA, 2006, pp. 457-464.
  [Bibtex]

  @inproceedings{conf/atal/BezekGB06,
  abstract = {This paper presents an algorithm for multi-agent strategic modeling ({MASM}) applied in a robotic soccer domain. It transforms a multi-agent action sequence into a set of strategic action descriptions in a graphical and symbolic form. By using hierarchically ordered domain knowledge, the algorithm is able to generate graphic and symbolic strategic action descriptions together with corresponding rules at different levels of abstraction. The method was evaluated on the {RoboCup} Soccer Server Internet League data.},
  address = {New York, NY, USA},
  author = {Be\v{z}ek, Andra\v{z} and Gams, Matja\v{z} and Bratko, Ivan},
  booktitle = {Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems},
  citeulike-article-id = {10103202},
  citeulike-linkout-0 = {http://jmvidal.cse.sc.edu/library/AAMAS-06/docs/P1ef198.pdf},
  citeulike-linkout-1 = {http://portal.acm.org/citation.cfm?id=1160633.1160717},
  citeulike-linkout-2 = {http://dx.doi.org/10.1145/1160633.1160717},
  doi = {10.1145/1160633.1160717},
  editor = {Nakashima, Hideyuki and Wellman, Michael P. and Weiss, Gerhard and Stone, Peter},
  isbn = {1-59593-303-4},
  location = {Hakodate, Japan},
  pages = {457--464},
  posted-at = {2011-12-07 14:17:42},
  priority = {2},
  publisher = {ACM},
  series = {AAMAS '06},
  title = {Multi-agent strategic modeling in a robotic soccer domain},
  url = {http://jmvidal.cse.sc.edu/library/AAMAS-06/docs/P1ef198.pdf},
  year = {2006}
  }

• D. Z. Pavlinić, J. Geršak, J. Demšar, and I. Bratko, “Predicting seam appearance quality,” Textile research journal, vol. 76, iss. 3, pp. 235-242, 2006.
  [Bibtex]

  @article{citeulike:10099334,
  abstract = {The appearance of a garment is affected by the quality of the fabrics used in its manufacture, as well as a number of factors determined by the technology of the garment manufacturing process. Since fabric quality, as the most important element of garment appearance, is determined by its mechanical properties, it is obvious that these properties directly impact fabric processing properties. It can be seen through various forms of fabric behavior under the loads that occur in sewing. Investigations of the correlations of the stress and fabric behavior are aimed at constructing a system to predict fabric behavior in garment manufacturing processes, as well as to predict the appearance of the garment to be manufactured. The investigation presented here deals with the impact of fabric mechanical properties on the quality of seam appearance, as defined by seam puckering and work-piece flotation. Machine learning methods included in the Orange software package were used to establish the importance of mechanical properties with respect to fabric behavior.},
  author = {Pavlini\'{c}, Daniela Z. and Ger\v{s}ak, Jelka and Dem\v{s}ar, Janez and Bratko, Ivan},
  citeulike-article-id = {10099334},
  citeulike-linkout-0 = {http://dx.doi.org/10.1177/0040517506061533},
  citeulike-linkout-1 = {http://trj.sagepub.com/content/76/3/235.abstract},
  citeulike-linkout-2 = {http://trj.sagepub.com/content/76/3/235.full.pdf},
  day = {01},
  doi = {10.1177/0040517506061533},
  issn = {1746-7748},
  journal = {Textile Research Journal},
  month = mar,
  number = {3},
  pages = {235--242},
  posted-at = {2011-12-06 14:37:16},
  priority = {2},
  publisher = {SAGE Publications},
  title = {Predicting seam appearance quality},
  url = {http://dx.doi.org/10.1177/0040517506061533},
  volume = {76},
  year = {2006}
  }

• A. Sadikov and I. Bratko, “Learning long-term chess strategies from databases,” Machine learning, vol. 63, iss. 3, pp. 329-340, 2006.
  [Bibtex]

  @article{citeulike:688907,
  abstract = {We propose an approach to the learning of long-term plans for playing chess endgames. We assume that a computer-generated database for an endgame is available, such as the king and rook vs. king, or king and queen vs. king and rook endgame. For each position in the endgame, the database gives the "value" of the position in terms of the minimum number of moves needed by the stronger side to win given that both sides play optimally. We propose a method for automatically dividing the endgame into stages characterised by different objectives of play. For each stage of such a game plan, a stage-specific evaluation function is induced, to be used by minimax search when playing the endgame. We aim at learning playing strategies that give good insight into the principles of playing specific endgames. Games played by these strategies should resemble human expert's play in achieving goals and subgoals reliably, but not necessarily as quickly as possible.},
  author = {Sadikov, Aleksander and Bratko, Ivan},
  citeulike-article-id = {688907},
  citeulike-linkout-0 = {http://www.springerlink.com/content/215h644792102p15/fulltext.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1007/s10994-006-6747-7},
  citeulike-linkout-2 = {http://www.ingentaconnect.com/content/klu/ml/2006/00000063/00000003/00006747},
  citeulike-linkout-3 = {http://www.springerlink.com/content/215h644792102p15},
  day = {1},
  doi = {10.1007/s10994-006-6747-7},
  issn = {0885-6125},
  journal = {Machine Learning},
  month = jun,
  number = {3},
  pages = {329--340},
  posted-at = {2011-12-06 14:34:45},
  priority = {2},
  publisher = {Springer Netherlands},
  title = {Learning long-term chess strategies from databases},
  url = {http://www.springerlink.com/content/215h644792102p15/fulltext.pdf},
  volume = {63},
  year = {2006}
  }

• M. Možina, J. Demšar, J. Žabkar, and I. Bratko, “Why is rule learning optimistic and how to correct it,” in Ecml 2006, Berlin, Heidelberg, 2006, pp. 330-340.
  [Bibtex]

  @inproceedings{conf/ecml/MozinaDZB06,
  abstract = {In their search through a huge space of possible hypotheses, rule induction algorithms compare estimations of qualities of a large number of rules to find the one that appears to be best. This mechanism can easily find random patterns in the data which will – even though the estimating method itself may be unbiased (such as relative frequency) – have optimistically high quality estimates. It is generally believed that the problem, which eventually leads to overfitting, can be alleviated by using m-estimate of probability. We show that this can only partially mend the problem, and propose a novel solution to making the common rule evaluation functions account for multiple comparisons in the search. Experiments on artificial data sets and data sets from the {UCI} repository show a large improvement in accuracy of probability predictions and also a decent gain in {AUC} of the constructed models.},
  address = {Berlin, Heidelberg},
  author = {Mo\v{z}ina, Martin and Dem\v{s}ar, Janez and \v{Z}abkar, Jure and Bratko, Ivan},
  booktitle = {ECML 2006},
  chapter = {33},
  citeulike-article-id = {10099292},
  citeulike-linkout-0 = {http://dx.doi.org/10.1007/11871842\_33},
  citeulike-linkout-1 = {http://www.springerlink.com/content/n637h277851u77h2},
  doi = {10.1007/11871842\_33},
  editor = {F\"{u}rnkranz, Johannes and Scheffer, Tobias and Spiliopoulou, Myra},
  isbn = {978-3-540-45375-8},
  journal = {Lecture notes in computer science},
  pages = {330--340},
  posted-at = {2011-12-06 14:29:43},
  priority = {2},
  publisher = {Springer Berlin / Heidelberg},
  series = {Lecture notes in computer science},
  title = {Why is rule learning optimistic and how to correct it},
  url = {http://dx.doi.org/10.1007/11871842\_33},
  volume = {4212},
  year = {2006}
  }

• I. Bratko, M. Možina, and J. Žabkar, “Argument-based machine learning,” in Ecai 2006, 2006, pp. 11-17.
  [Bibtex]

  @inproceedings{conf/ismis/BratkoMZ06,
  author = {Bratko, Ivan and Mo\v{z}ina, Martin and \v{Z}abkar, Jure},
  booktitle = {ECAI 2006},
  citeulike-article-id = {10099283},
  editor = {Esposito, Floriana and Ras, Zbigniew W. and Malerba, Donato and Semeraro, Giovanni},
  journal = {Lecture notes in computer science},
  pages = {11--17},
  posted-at = {2011-12-06 14:28:28},
  priority = {2},
  publisher = {Springer},
  title = {Argument-based machine learning},
  volume = {4203},
  year = {2006}
  }

• A. Bratko, G. V. Cormack, B. Filipič, T. R. Lynam, and B. Zupan, “Spam filtering using statistical data compression models,” Journal of machine learning research, vol. 6, pp. 2673-2698, 2006.
  [Bibtex]

  @article{journals/jmlr/BratkoCFLZ06,
  abstract = {Spam filtering poses a special problem in text categorization, of which the defining characteristic is that filters face an active adversary, which constantly attempts to evade filtering. Since spam evolves continuously and most practical applications are based on online user feedback, the task calls for fast, incremental and robust learning algorithms. In this paper, we investigate a novel approach to spam filtering based on adaptive statistical data compression models. The nature of these models allows them to be employed as probabilistic text classifiers based on character-level or binary sequences. By modeling messages as sequences, tokenization and other error-prone preprocessing steps are omitted altogether, resulting in a method that is very robust. The models are also fast to construct and incrementally updateable. We evaluate the filtering performance of two different compression algorithms; dynamic Markov compression and prediction by partial matching. The results of our empirical evaluation indicate that compression models outperform currently established spam filters, as well as a number of methods proposed in previous studies.},
  author = {Bratko, Andrej and Cormack, Gordon V. and Filipi\v{c}, Bogdan and Lynam, Thomas R. and Zupan, Bla\v{z}},
  citeulike-article-id = {10099244},
  citeulike-linkout-0 = {http://dblp.uni-trier.de/db/journals/jmlr/jmlr7.html\#BratkoCFLZ06},
  citeulike-linkout-1 = {http://jmlr.csail.mit.edu/papers/volume7/bratko06a/bratko06a.pdf},
  journal = {Journal of Machine Learning Research},
  pages = {2673--2698},
  posted-at = {2011-12-06 14:17:08},
  priority = {2},
  title = {Spam filtering using statistical data compression models},
  url = {http://dblp.uni-trier.de/db/journals/jmlr/jmlr7.html\#BratkoCFLZ06},
  volume = {6},
  year = {2006}
  }

• A. Bratko and B. Filipič, “Exploiting structural information for semi-structured document categorization,” Information processing & management, vol. 42, iss. 3, pp. 679-694, 2006.
  [Bibtex]

  @article{journals/ipm/BratkoF06,
  abstract = {This paper examines several different approaches to exploiting structural information in semi-structured document categorization. The methods under consideration are designed for categorization of documents consisting of a collection of fields, or arbitrary tree-structured documents that can be adequately modeled with such a flat structure. The approaches range from trivial modifications of text modeling to more elaborate schemes, specifically tailored to structured documents. We combine these methods with three different text classification algorithms and evaluate their performance on four standard datasets containing different types of semi-structured documents. The best results were obtained with stacking, an approach in which predictions based on different structural components are combined by a meta classifier. A further improvement of this method is achieved by including the flat text model in the final prediction.},
  author = {Bratko, Andrej and Filipi\v{c}, Bogdan},
  citeulike-article-id = {10099236},
  citeulike-linkout-0 = {http://ai.ijs.si/andrej/papers/ipm2005.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1016/j.ipm.2005.06.003},
  doi = {10.1016/j.ipm.2005.06.003},
  issn = {03064573},
  journal = {Information Processing \& Management},
  month = may,
  number = {3},
  pages = {679--694},
  posted-at = {2011-12-06 14:13:16},
  priority = {2},
  title = {Exploiting structural information for semi-structured document categorization},
  url = {http://ai.ijs.si/andrej/papers/ipm2005.pdf},
  volume = {42},
  year = {2006}
  }

• D. Marinčič, M. Gams, and M. Luštrek, “Knowledge vs. simulation for bidding in tarok.,” Informatica, vol. 30, iss. 4, pp. 467-476, 2006.
  [Bibtex]

  @article{journals/informaticaSI/MarincicGL06,
  abstract = {Two approaches for bidding in games are presented: knowledge-based approach and simulation-based approach. A general knowledge-based decision model for bidding in games with its strategy encoded in a Bayesian network was designed. A program for playing four-player tarok was implemented incorporating a specialised instance of the decision model and a simulation module for bidding. Both approaches were compared. The knowledge-based decision model was further compared to human experts, showing that it performs on par with them.},
  author = {Marin\v{c}i\v{c}, Domen and Gams, Matja\v{z} and Lu\v{s}trek, Mitja},
  citeulike-article-id = {10099233},
  citeulike-linkout-0 = {http://dblp.uni-trier.de/db/journals/informaticaSI/informaticaSI30.html\#MarincicGL06},
  citeulike-linkout-1 = {http://dis.ijs.si/domen/filez/Marincic\_tarok\_informatica.pdf},
  journal = {Informatica},
  number = {4},
  pages = {467--476},
  posted-at = {2011-12-06 14:08:58},
  priority = {2},
  title = {Knowledge vs. simulation for bidding in tarok.},
  url = {http://dblp.uni-trier.de/db/journals/informaticaSI/informaticaSI30.html\#MarincicGL06},
  volume = {30},
  year = {2006}
  }

• A. Pivk, M. Gams, and M. Luštrek, “Semantic search in tabular structures,” Informatica, vol. 30, iss. 2, pp. 143-152, 2006.
  [Bibtex]

  @article{journals/informaticaSI/PivkGL06,
  abstract = {The Semantic Web search aims to overcome the bottleneck of finding relevant information using formal knowledge models, e.g. ontologies. The focus of this paper is to extend a typical search engine with semantic search over tabular structures. We categorize {HTML} documents into topics and genres. Using the {TARTAR} system, tabular structures in the documents are then automatically transformed into ontologies and annotated to build a knowledge base. When posting queries, users receive responses not just as lists of links and description extracts, but also enhanced with replies in the form of detailed structured data.},
  author = {Pivk, Aleksander and Gams, Matja\v{z} and Lu\v{s}trek, Mitja},
  citeulike-article-id = {10099230},
  citeulike-linkout-0 = {http://dblp.uni-trier.de/db/journals/informaticaSI/informaticaSI30.html\#PivkGL06},
  citeulike-linkout-1 = {http://ai.ijs.si/sandi/docs/Informatica-submitted.pdf},
  journal = {Informatica},
  number = {2},
  pages = {143--152},
  posted-at = {2011-12-06 14:06:21},
  priority = {2},
  title = {Semantic search in tabular structures},
  url = {http://dblp.uni-trier.de/db/journals/informaticaSI/informaticaSI30.html\#PivkGL06},
  volume = {30},
  year = {2006}
  }

• M. Guid and I. Bratko, “Computer analysis of world chess champions,” Icga journal, vol. 29, iss. 2, pp. 65-73, 2006.
  [Bibtex]

  @article{journals/icga/GuidB06,
  abstract = {Who is the best chess player of all time? Chess players are often interested in this question that has never been answered authoritatively, because it requires a comparison between chess players of different eras who never met across the board. In this contribution, we attempt to make such a comparison. It is based on the evaluation of the games played by the World Chess Champions in
  their championship matches. The evaluation is performed by the chess-playing program {CRAFTY}. For this purpose we slightly adapted {CRAFTY}. Our analysis takes into account the differences in
  players' styles to compensate the fact that calm positional players in their typical games have less chance to commit gross tactical errors than aggressive tactical players. Therefore, we designed a
  method to assess the difficulty of positions. Some of the results of this computer analysis might be quite surprising. Overall, the results can be nicely interpreted by a chess expert.},
  author = {Guid, Matej and Bratko, Ivan},
  citeulike-article-id = {10099221},
  citeulike-linkout-0 = {http://dblp.uni-trier.de/db/journals/icga/icga29.html\#GuidB06},
  citeulike-linkout-1 = {http://www.ailab.si/matej/doc/Computer\_Analysis\_of\_World\_Chess\_Champions.pdf},
  journal = {ICGA Journal},
  number = {2},
  pages = {65--73},
  posted-at = {2011-12-06 14:00:14},
  priority = {2},
  title = {Computer analysis of World Chess Champions},
  url = {http://dblp.uni-trier.de/db/journals/icga/icga29.html\#GuidB06},
  volume = {29},
  year = {2006}
  }

• D. Vladušič, B. Kompare, and I. Bratko, “Modelling lake glumso with q^2 learning,” Ecological modelling, vol. 191, iss. 1, pp. 33-46, 2006.
  [Bibtex]

  @article{citeulike:10099212,
  abstract = {In this paper, we describe an application of Q2 learning, a recently developed approach to machine learning in numerical domains, to the automated modelling of an aquatic ecosystem from measured data. We modelled the time behaviour of phytoplankton and zooplankton in Danish Lake Glums{\o} using data collected by {S.E}. J{\o}rgensen. The novelty of Q2 learning is in its paying attention to the qualitative correctness of induced numerical models. We assessed the results by, first, performing a comparison of numerical accuracy between our approach and some state-of-the-art numerical machine learning algorithms applied to the Glums{\o} data, and second, we obtained expert evaluation of the induced models. The results show that Q2 approach is at least comparable to competing methods in terms of numerical accuracy and gives good insight into domain phenomena.},
  author = {Vladu\v{s}i\v{c}, Daniel and Kompare, Boris and Bratko, Ivan},
  citeulike-article-id = {10099212},
  citeulike-linkout-0 = {http://www-ai.ijs.si/SasoDzeroski/ECEMEAML04/presentations/087-Vladusic.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1016/j.ecolmodel.2005.08.005},
  day = {27},
  doi = {10.1016/j.ecolmodel.2005.08.005},
  issn = {03043800},
  journal = {Ecological Modelling},
  month = jan,
  number = {1},
  pages = {33--46},
  posted-at = {2011-12-06 13:55:51},
  priority = {2},
  title = {Modelling lake Glumso with Q^2 learning},
  url = {http://www-ai.ijs.si/SasoDzeroski/ECEMEAML04/presentations/087-Vladusic.pdf},
  volume = {191},
  year = {2006}
  }

• J. Žabkar, R. Žabkar, D. Vladušič, D. Čemas, D. Šuc, and I. Bratko, “Q^2 prediction of ozone concentrations,” Ecological modelling, vol. 191, iss. 1, pp. 68-82, 2006.
  [Bibtex]

  @article{citeulike:10099185,
  abstract = {We describe a case study in which we applied Q2 learning (qualitatively faithful quantitative learning) to the analysis and prediction of ozone concentrations in the cities of Ljubljana and Nova Gorica, Slovenia. We used program {QUIN} to induce a qualitative model from numerical data that include the measurements of several meteorological and chemical variables. The resulting qualitative model consists of tree-structured monotonic qualitative constraints. We show how this model for Nova Gorica enables a nice interpretation of complex meteorological and chemical processes that affect the level of ozone concentration. In addition to inducing a qualitative model from data, we extended the qualitative model to also enable numerical prediction for both cities. In this case, we used in addition to measured data also data from the European meteorological prognostic model {ALADIN} which itself does not model pollutants. The results suggest that the qualitatively constrained numerical model tends to improve numerical prediction in comparison with some standard numerical learning methods.},
  author = {\v{Z}abkar, Jure and \v{Z}abkar, Rahela and Vladu\v{s}i\v{c}, Daniel and \v{C}emas, Danijel and \v{S}uc, Dorian and Bratko, Ivan},
  citeulike-article-id = {10099185},
  citeulike-linkout-0 = {http://www.ailab.si/jure/Q2Ozone\_Zabkar\_etal.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1016/j.ecolmodel.2005.08.013},
  day = {27},
  doi = {10.1016/j.ecolmodel.2005.08.013},
  issn = {03043800},
  journal = {Ecological Modelling},
  month = jan,
  number = {1},
  pages = {68--82},
  posted-at = {2011-12-06 13:50:54},
  priority = {2},
  title = {Q^2 prediction of ozone concentrations},
  url = {http://www.ailab.si/jure/Q2Ozone\_Zabkar\_etal.pdf},
  volume = {191},
  year = {2006}
  }

• G. Leban, B. Zupan, G. Vidmar, and I. Bratko, “VizRank: data visualization guided by machine learning,” Data mining and knowledge discovery, vol. 13, iss. 2, pp. 119-136, 2006.
  [Bibtex]

  @article{journals/datamine/LebanZVB06,
  abstract = {Data visualization plays a crucial role in identifying interesting patterns in exploratory data analysis. Its use is, however, made difficult by the large number of possible data projections showing different attribute subsets that must be evaluated by the data analyst. In this paper, we introduce a method called {VizRank}, which is applied on classified data to automatically select the most useful data projections. {VizRank} can be used with any visualization method that maps attribute values to points in a two-dimensional visualization space. It assesses possible data projections and ranks them by their ability to visually discriminate between classes. The quality of class separation is estimated by computing the predictive accuracy of k-nearest neighbor classifier on the data set consisting of x and y positions of the projected data points and their class information. The paper introduces the method and presents experimental results which show that {VizRank}'s ranking of projections highly agrees with subjective rankings by data analysts. The practical use of {VizRank} is also demonstrated by an application in the field of functional genomics.},
  author = {Leban, Gregor and Zupan, Bla\v{z} and Vidmar, Gaj and Bratko, Ivan},
  booktitle = {Data Mining and Knowledge Discovery},
  citeulike-article-id = {10090347},
  citeulike-linkout-0 = {http://eprints.fri.uni-lj.si/210/2/1.\_G.\_Leban\%2C\_B.\_Zupan\%2C\_G.\_Vidmar\%2C\_I.\_Bratko\%2C\_Data\_Mining\_and\_Knowledge\_Discovery\_13\%2C\_119-36\_\%282006\%29..pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1007/s10618-005-0031-5},
  citeulike-linkout-2 = {http://www.springerlink.com/content/d276180771354157},
  citeulike-linkout-3 = {http://link.springer.com/article/10.1007/s10618-005-0031-5},
  day = {1},
  doi = {10.1007/s10618-005-0031-5},
  issn = {1384-5810},
  journal = {Data Mining and Knowledge Discovery},
  month = sep,
  number = {2},
  pages = {119--136},
  posted-at = {2011-12-06 12:10:37},
  priority = {2},
  publisher = {Springer US},
  title = {{VizRank}: data visualization guided by machine learning},
  url = {http://eprints.fri.uni-lj.si/210/2/1.\_G.\_Leban\%2C\_B.\_Zupan\%2C\_G.\_Vidmar\%2C\_I.\_Bratko\%2C\_Data\_Mining\_and\_Knowledge\_Discovery\_13\%2C\_119-36\_\%282006\%29..pdf},
  volume = {13},
  year = {2006}
  }

• A. Bežek and M. Gams, “Comparing a traditional and a multi-agent load-balancing system,” Computers and artificial intelligence, vol. 25, iss. 1, pp. 17-42, 2006.
  [Bibtex]

  @article{journals/cai/BezekG06,
  abstract = {This article presents a comparison between agent and non-agent based approaches to building network-load-balancing systems. In particular, two large software systems are compared, one traditional and the other agent-base, both performing the same balancing functions. Due to the two different architectures, several differences emerge. The differences are analyzed theoretically and practically in terms of design, scalability and fault-torerance. The advantages and disadvantages of both approaches are presented by combining an analysis of the system and gathering the experience of designers, developers and users. Traditionally, designers specify rigid software structure, while for multi-agent systems the emphasis is on specifying the different task and roles, as well as the interconnections between the agents that cooperate autonomously and simultaneously. The major advantages of the multi-agent approach are the introduced abstract design laters and, as a consequence, the more comprehendible top-level design, the increased redundancy, and the improved fault tolerance. The major imrpovement in performance due to the agent architecture is observed in the case of one or more failed computers. Although the agent-oriented design might not be a silver bullet for building large distributed systems, our analysis and application confirm that it does have a number of advantages over non-agent approaches.},
  author = {Be\v{z}ek, Andra\v{z} and Gams, Matja\v{z}},
  citeulike-article-id = {10098739},
  citeulike-linkout-0 = {http://dblp.uni-trier.de/db/journals/cai/cai25.html\#BezekG06},
  journal = {Computers and Artificial Intelligence},
  keywords = {dblp},
  number = {1},
  pages = {17--42},
  posted-at = {2011-12-06 12:07:18},
  priority = {2},
  title = {Comparing a traditional and a multi-agent load-balancing system},
  url = {http://dblp.uni-trier.de/db/journals/cai/cai25.html\#BezekG06},
  volume = {25},
  year = {2006}
  }

• M. Luštrek, M. Gams, and I. Bratko, “Is real-valued minimax pathological?,” Artificial intelligence, vol. 170, iss. 6-7, pp. 620-642, 2006.
  [Bibtex]

  @article{journals/ai/LustrekGB06,
  abstract = {Deeper searches in game-playing programs relying on the minimax principle generally produce better results. Theoretical analyses, however, suggest that in many cases minimaxing amplifies the noise introduced by the heuristic function used to evaluate the leaves of the game tree, leading to what is known as pathological behavior, where deeper searches produce worse results. In most minimax models analyzed in previous research, positions' true values and sometimes also heuristic values were only losses and wins. In contrast to this, a model is proposed in this paper that uses real numbers for both true and heuristic values. This model did not behave pathologically in the experiments performed. The mechanism that causes deeper searches to produce better evaluations is explained. A comparison with chess is made, indicating that the model realistically reflects position evaluations in chess-playing programs. Conditions under which the pathology might appear in a real-value model are also examined. The essential difference between our real-value model and the common two-value model, which causes the pathology in the two-value model, is identified. Most previous research reports that the pathology tends to disappear when there are dependences between the values of sibling nodes in a game tree. In this paper, another explanation is presented which indicates that in the two-value models the error of the heuristic evaluation was not modeled realistically.},
  author = {Lu\v{s}trek, Mitja and Gams, Matja\v{z} and Bratko, Ivan},
  citeulike-article-id = {10098669},
  citeulike-linkout-0 = {http://www.sciencedirect.com/science?\_ob=MiamiImageURL\&\#38;\_cid=271585\&\#38;\_user=10\&\#38;\_pii=S0004370206000117\&\#38;\_check=y\&\#38;\_origin=\&\#38;\_coverDate=31-May-2006\&\#38;view=c\&\#38;wchp=dGLbVlV-zSkWb\&\#38;md5=484c0bda05383d803b8c8f8ff50de39f/1-s2.0-S0004370206000117-main.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1016/j.artint.2006.01.006},
  doi = {10.1016/j.artint.2006.01.006},
  issn = {00043702},
  journal = {Artificial Intelligence},
  month = may,
  number = {6-7},
  pages = {620--642},
  posted-at = {2011-12-06 11:39:26},
  priority = {2},
  title = {Is real-valued minimax pathological?},
  url = {http://www.sciencedirect.com/science?\_ob=MiamiImageURL\&\#38;\_cid=271585\&\#38;\_user=10\&\#38;\_pii=S0004370206000117\&\#38;\_check=y\&\#38;\_origin=\&\#38;\_coverDate=31-May-2006\&\#38;view=c\&\#38;wchp=dGLbVlV-zSkWb\&\#38;md5=484c0bda05383d803b8c8f8ff50de39f/1-s2.0-S0004370206000117-main.pdf},
  volume = {170},
  year = {2006}
  }

• D. Vladušič, D. Šuc, I. Bratko, and W. Rulka, “Q^2 learning and its application to car modelling,” Applied artificial intelligence, vol. 20, iss. 8, pp. 675-701, 2006.
  [Bibtex]

  @article{journals/aai/VladusicSBR06,
  abstract = {In this paper we describe an application of Q2 learning, a recently developed approach to machine learning in numerical domains (Scaronuc et al., 2003, 2004) to the automated modeling of a complex, industrially relevant mechanical system: the four wheel suspension and steering system of a car. In this experiment, first a qualitative model of this dynamic system was induced from data, and then this model was reified into a quantitative model. The induced qualitative models enable explanation of relations among the variables in the system and, when reified into quantitative models, enable accurate numerical prediction. Furthermore, the qualitative guidance of the quantitative modeling process leads to predictions that are significantly more accurate than those obtained by state-of-the-art numerical learning methods.},
  author = {Vladu\v{s}i\v{c}, Daniel and \v{S}uc, Dorian and Bratko, Ivan and Rulka, Wolfgang},
  citeulike-article-id = {839020},
  citeulike-linkout-0 = {http://dx.doi.org/10.1080/08839510600847238},
  citeulike-linkout-1 = {http://www.ingentaconnect.com/content/tandf/uaai/2006/00000020/00000008/art00003},
  citeulike-linkout-2 = {http://www.tandfonline.com/doi/abs/10.1080/08839510600847238},
  day = {1},
  doi = {10.1080/08839510600847238},
  issn = {0883-9514},
  journal = {Applied Artificial Intelligence},
  month = oct,
  number = {8},
  pages = {675--701},
  posted-at = {2011-12-06 11:35:27},
  priority = {2},
  publisher = {Taylor \& Francis},
  title = {Q^2 learning and its application to car modelling},
  url = {http://dx.doi.org/10.1080/08839510600847238},
  volume = {20},
  year = {2006}
  }

• A. Pivk, “Automatic ontology generation from web tabular structures,” Ai communications, vol. 19, iss. 1, pp. 83-85, 2006.
  [Bibtex]

  @article{journals/aicom/Pivk06,
  abstract = {Turning the current Web into a Semantic Web requires automatic approaches for document annotation, since manual approaches will not scale in general. The focus of the thesis is on automatic transformation of arbitrary table-like structures into knowledge models, i.e. ontologies. The presented work is based on Hurst's table model and consists of a methodology, an accompanying implementation named {TAR}-{TAR}, and a thorough evaluation. The evaluation showed over 80 \% success rate of automatic transformation of tables into semantic representations and 100\% accuracy in the task of query answering over the table contents.},
  author = {Pivk, Aleksander},
  citeulike-article-id = {10098627},
  citeulike-linkout-0 = {http://dblp.uni-trier.de/db/journals/aicom/aicom19.html\#Pivk06},
  citeulike-linkout-1 = {http://ai.ijs.si/sandi/docs/AICOMM-submitted.pdf},
  journal = {AI Communications},
  number = {1},
  pages = {83--85},
  posted-at = {2011-12-06 11:28:15},
  priority = {2},
  title = {Automatic ontology generation from web tabular structures},
  url = {http://dblp.uni-trier.de/db/journals/aicom/aicom19.html\#Pivk06},
  volume = {19},
  year = {2006}
  }

2005

• U. Rajkovič and V. Rajkovič, “Team-work in the context of technological expectations,” Personnel and management: selected topics, pp. 331-339, 2005.
  [Bibtex]

  @article{citeulike:10359442,
  author = {Rajkovi\v{c}, Uro\v{s} and Rajkovi\v{c}, Vladislav},
  citeulike-article-id = {10359442},
  journal = {Personnel and management: selected topics},
  location = {Frankfurt am Main [etc.]},
  pages = {331--339},
  posted-at = {2012-02-16 11:34:00},
  priority = {2},
  publisher = {P. Lang},
  title = {Team-work in the context of technological expectations},
  year = {2005}
  }

• M. Bernik, I. Bernik, and V. Rajkovič, “Using knowledge discovery in databases for human resource management decisions,” Personnel and management: selected topics, pp. 97-103, 2005.
  [Bibtex]

  @article{citeulike:10359436,
  author = {Bernik, Mojca and Bernik, Igor and Rajkovi\v{c}, Vladislav},
  citeulike-article-id = {10359436},
  journal = {Personnel and management: selected topics},
  location = {Frankfurt am Main [etc.]},
  pages = {97--103},
  posted-at = {2012-02-16 11:32:08},
  priority = {2},
  publisher = {P. Lang},
  title = {Using knowledge discovery in databases for human resource management decisions},
  year = {2005}
  }

• T. Murn and V. Rajkovič, “Multi-attribute decision making models and the system DEXi for schools,” Learning for the future: dimensions of the new role of the teacher, pp. 329-343, 2005.
  [Bibtex]

  @article{citeulike:10359427,
  author = {Murn, Toma\v{z} and Rajkovi\v{c}, Vladislav},
  citeulike-article-id = {10359427},
  journal = {Learning for the future: dimensions of the new role of the teacher},
  pages = {329--343},
  posted-at = {2012-02-16 11:29:06},
  priority = {2},
  title = {Multi-attribute decision making models and the system {DEXi} for schools},
  year = {2005}
  }

• E. Jereb, U. Rajkovič, and V. Rajkovič, “A hierarchical multi-attribute system approach to personnel selection,” International journal of selection and assessment, vol. 13, iss. 3, pp. 198-205, 2005.
  [Bibtex]

  @article{citeulike:314679,
  abstract = {In this paper, an approach to decision making in managing human resources that integrates multi-attribute decision making techniques with expert systems is described. The approach is based on the explicit articulation of qualitative decision knowledge which is represented by a tree of attributes and decision rules. The decision making process is supported by {DEXi}, a specialized expert system shell for interactive construction of the knowledge base, evaluation of options, and explanation of the results. Practical use of the shell is illustrated by an application in the field of personnel selection for a top manager position.},
  author = {Jereb, Eva and Rajkovi\v{c}, Uro\v{s} and Rajkovi\v{c}, Vladislav},
  citeulike-article-id = {314679},
  citeulike-linkout-0 = {http://www.numerons.in/files/documents/Hierarchical-Multi-Attribute-System-for-Personnel-Selection.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1111/j.1468-2389.2005.00315.x},
  citeulike-linkout-2 = {http://www.ingentaconnect.com/content/bpl/ijsa/2005/00000013/00000003/art00003},
  doi = {10.1111/j.1468-2389.2005.00315.x},
  issn = {0965-075X},
  journal = {International Journal of Selection and Assessment},
  month = sep,
  number = {3},
  pages = {198--205},
  posted-at = {2012-02-16 10:46:04},
  priority = {2},
  publisher = {Blackwell Publishing},
  title = {A hierarchical multi-attribute system approach to personnel selection},
  url = {http://www.numerons.in/files/documents/Hierarchical-Multi-Attribute-System-for-Personnel-Selection.pdf},
  volume = {13},
  year = {2005}
  }

• A. Žibert, V. Batagelj, and V. Rajkovič, “Comparative analysis of educational networks,” Informatica, vol. 29, iss. 4, pp. 477-482, 2005.
  [Bibtex]

  @article{DBLP:journals/informaticaSI/ZibertBR05,
  abstract = {Educational networks and portals are a formation of thematically gathered data on the web. Structure of national educational networks and portals depends on environment of their origin. In the paper, selected educational networks are analysed according to the following criteria: content-services, navigation, search, user interface, help, credibility, validity and target groups. The criteria were identified by a group of experts and final users (students and teachers) on the basis of web survey. The importance of criteria was articulated by using the Analytical Hierarchical Method and program Saaty. For the evaluation was selected Slovene National Educational Network ({SIO}) as well as educational networks of Canada, Ireland, United Kingdom, Europe, Germany, Africa, Australia and America. Based on the results of the comparative analysis a concept and guidelines for improvements of our national educational network {SIO} were prepared.},
  author = {\v{Z}ibert, Alenka and Batagelj, Vladimir and Rajkovi\v{c}, Vladislav},
  citeulike-article-id = {10359365},
  citeulike-linkout-0 = {http://www.informatica.si/PDF/29-4/11\_Zibert-Comparative\%20Analysis....pdf},
  journal = {Informatica},
  number = {4},
  pages = {477--482},
  posted-at = {2012-02-16 10:41:17},
  priority = {2},
  title = {Comparative analysis of educational networks},
  url = {http://www.informatica.si/PDF/29-4/11\_Zibert-Comparative\%20Analysis....pdf},
  volume = {29},
  year = {2005}
  }

• G. Leban, M. Mramor, I. Bratko, and B. Zupan, “Simple and effective visual models for gene expression cancer diagnostics,” in 11th acm sigkdd international conference on knowledge discovery in data mining, New York, NY, USA, 2005, pp. 167-176.
  [Bibtex]

  @inproceedings{conf/kdd/LebanMBZ05,
  abstract = {In the paper we show that diagnostic classes in cancer gene expression data sets, which most often include thousands of features (genes), may be effectively separated with simple two-dimensional plots such as scatterplot and radviz graph. The principal innovation proposed in the paper is a method called {VizRank}, which is able to score and identify the best among possibly millions of candidate projections for visualizations. Compared to recently much applied techniques in the field of cancer genomics that include neural networks, support vector machines and various ensemble-based approaches, {VizRank} is fast and finds visualization models that can be easily examined and interpreted by domain experts. Our experiments on a number of gene expression data sets show that {VizRank} was always able to find data visualizations with a small number of (two to seven) genes and excellent class separation. In addition to providing grounds for gene expression cancer diagnosis, {VizRank} and its visualizations also identify small sets of relevant genes, uncover interesting gene interactions and point to outliers and potential misclassifications in cancer data sets.},
  address = {New York, NY, USA},
  author = {Leban, Gregor and Mramor, Minca and Bratko, Ivan and Zupan, Bla\v{z}},
  booktitle = {11th ACM SIGKDD international conference on Knowledge discovery in data mining},
  citeulike-article-id = {10103197},
  citeulike-linkout-0 = {http://eprints.fri.uni-lj.si/211/1/415-leban.pdf},
  citeulike-linkout-1 = {http://portal.acm.org/citation.cfm?id=1081870.1081892},
  citeulike-linkout-2 = {http://dx.doi.org/10.1145/1081870.1081892},
  doi = {10.1145/1081870.1081892},
  isbn = {1-59593-135-X},
  location = {Chicago, Illinois, USA},
  pages = {167--176},
  posted-at = {2011-12-07 14:15:22},
  priority = {2},
  publisher = {ACM},
  series = {KDD '05},
  title = {Simple and effective visual models for gene expression cancer diagnostics},
  url = {http://eprints.fri.uni-lj.si/211/1/415-leban.pdf},
  year = {2005}
  }

• A. Jakulin, M. Možina, J. Demšar, I. Bratko, and B. Zupan, “Nomograms for visualizing support vector machines,” in 11th acm sigkdd international conference on knowledge discovery in data mining, New York, NY, USA, 2005, pp. 108-117.
  [Bibtex]

  @inproceedings{conf/kdd/JakulinMDBZ05,
  abstract = {We propose a simple yet potentially very effective way of visualizing trained support vector machines. Nomograms are an established model visualization technique that can graphically encode the complete model on a single page. The dimensionality of the visualization does not depend on the number of attributes, but merely on the properties of the kernel. To represent the effect of each predictive feature on the log odds ratio scale as required for the nomograms, we employ logistic regression to convert the distance from the separating hyperplane into a probability. Case studies on selected data sets show that for a technique thought to be a black-box, nomograms can clearly expose its internal structure. By providing an easy-to-interpret visualization the analysts can gain insight and study the effects of predictive factors.},
  address = {New York, NY, USA},
  author = {Jakulin, Aleks and Mo\v{z}ina, Martin and Dem\v{s}ar, Janez and Bratko, Ivan and Zupan, Bla\v{z}},
  booktitle = {11th ACM SIGKDD international conference on Knowledge discovery in data mining},
  citeulike-article-id = {10103178},
  citeulike-linkout-0 = {http://eprints.fri.uni-lj.si/214/1/f309-jakulin.pdf},
  citeulike-linkout-1 = {http://portal.acm.org/citation.cfm?id=1081870.1081886},
  citeulike-linkout-2 = {http://dx.doi.org/10.1145/1081870.1081886},
  doi = {10.1145/1081870.1081886},
  isbn = {1-59593-135-X},
  location = {Chicago, Illinois, USA},
  pages = {108--117},
  posted-at = {2011-12-07 14:12:46},
  priority = {2},
  publisher = {ACM},
  series = {KDD '05},
  title = {Nomograms for visualizing support vector machines},
  url = {http://eprints.fri.uni-lj.si/214/1/f309-jakulin.pdf},
  year = {2005}
  }

• D. Šuc and I. Bratko, “Combining learning constraints and numerical regression,” in International joint conferences on artificial intelligence, 2005, pp. 596-602.
  [Bibtex]

  @inproceedings{conf/ijcai/SucB05,
  abstract = {Usual numerical learning methods are primarily concerned with finding a good numerical fit to data and often make predictions that do not correspond to qualitative laws in the domain of modelling or expert intuition. In contrast, the idea of Q^2 learning is to induce qualitative constraints from training data, and use the constraints to guide numerical regression. The resulting numerical predictions are consistent with a learned qualitative model which is beneficial in terms of explanation of phenomena in the modelled domain, and can also improve numerical accuracy. This paper proposes a method for combining the learning of qualitative constraints with an arbitrary numerical learner and explores the accuracy and explanation benefits of learning monotonic qualitative constraints in a number of domains. We show that Q^2 learning can correct for errors caused by the bias of the learning algorithm and discuss the potentials of similar hierarchical learning schemes.},
  author = {\v{S}uc, Dorian and Bratko, Ivan},
  booktitle = {International Joint Conferences on Artificial Intelligence},
  citeulike-article-id = {10103160},
  citeulike-linkout-0 = {http://eprints.fri.uni-lj.si/179/1/SucIJCAI05www.pdf},
  editor = {Kaelbling, Leslie P. and Saffiotti, Alessandro},
  pages = {596--602},
  posted-at = {2011-12-07 14:08:44},
  priority = {2},
  title = {Combining learning constraints and numerical regression},
  url = {http://eprints.fri.uni-lj.si/179/1/SucIJCAI05www.pdf},
  year = {2005}
  }

• M. Luštrek, M. Gams, and I. Bratko, “Why minimax works: an alternative explanation,” in International joint conferences on artificial intelligence, 2005, pp. 212-217.
  [Bibtex]

  @inproceedings{conf/ijcai/LustrekGB05,
  abstract = {In game-playing programs relying on the minimax principle, deeper searches generally produce better evaluations. Theoretical analyses, however, suggest that in many cases minimaxing amplifies the noise introduced by the heuristic function used to evaluate the leaves of the game tree, leading to what is known as pathological behavior, where deeper searches produce worse evaluations. In most of the previous research, positions were evaluated as losses or wins. Dependence between the values of positions close to each other was identified as the property of realistic game trees that eliminates the pathology and explains why minimax is successful in practice. In this paper we present an alternative explanation that does not rely on value dependence. We show that if real numbers are used for position values, position values tend to be further apart at lower levels of the game tree, which leads to a larger proportion of more extreme positions, where error is less probable. Decreased probability of error in searches to greater depths is sufficient to eliminate the pathology and no additional properties of game trees are required.},
  author = {Lu\v{s}trek, Mitja and Gams, Matja\v{z} and Bratko, Ivan},
  booktitle = {International Joint Conferences on Artificial Intelligence},
  citeulike-article-id = {10103150},
  citeulike-linkout-0 = {http://www.ijcai.org/papers/1223.pdf},
  editor = {Kaelbling, Leslie P. and Saffiotti, Alessandro},
  pages = {212--217},
  posted-at = {2011-12-07 14:03:19},
  priority = {2},
  publisher = {Professional Book Center},
  title = {Why minimax works: an alternative explanation},
  url = {http://www.ijcai.org/papers/1223.pdf},
  year = {2005}
  }

• T. Robič and B. Filipič, “DEMO: differential evolution for multiobjective optimization,” , C. Coello Coello, A. Hernández Aguirre, and E. Zitzler, Eds., Berlin, Heidelberg: Springer Berlin / Heidelberg, 2005, vol. 3410, pp. 520-533.
  [Bibtex]

  @inbook{conf/emo/RobicF05,
  abstract = {Differential Evolution ({DE}) is a simple but powerful evolutionary optimization algorithm with many successful applications. In this paper we propose Differential Evolution for Multiobjective Optimization ({DEMO}) – a new approach to multiobjective optimization based on {DE}. {DEMO} combines the advantages of {DE} with the mechanisms of Pareto-based ranking and crowding distance sorting, used by state-of-the-art evolutionary algorithms for multiobjective optimization. {DEMO} is implemented in three variants that achieve competitive results on five {ZDT} test problems.},
  address = {Berlin, Heidelberg},
  author = {Robi\v{c}, Tea and Filipi\v{c}, Bogdan},
  chapter = {36},
  citeulike-article-id = {10103123},
  citeulike-linkout-0 = {http://dis.ijs.si/tea/Publications/Robic05Demo.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1007/978-3-540-31880-4\_36},
  citeulike-linkout-2 = {http://www.springerlink.com/content/5tpy47gjvj8rub1a},
  doi = {10.1007/978-3-540-31880-4\_36},
  editor = {Coello Coello, Carlos and Hern\'{a}ndez Aguirre, Arturo and Zitzler, Eckart},
  isbn = {978-3-540-24983-2},
  pages = {520--533},
  posted-at = {2011-12-07 13:56:14},
  priority = {2},
  publisher = {Springer Berlin / Heidelberg},
  series = {Lecture notes in computer science},
  title = {{DEMO}: differential evolution for multiobjective optimization},
  url = {http://dis.ijs.si/tea/Publications/Robic05Demo.pdf},
  volume = {3410},
  year = {2005}
  }

• A. Sadikov, I. Bratko, and I. Kononenko, “Bias and pathology in minimax search,” Theoretical computer science, vol. 349, iss. 2, pp. 268-281, 2005.
  [Bibtex]

  @article{journals/tcs/SadikovBK05,
  abstract = {This article presents the results of experiments designed to gain insight into the effect of the minimax algorithm on the error of a heuristic evaluation function. Two types of effect of minimax are considered: (a) evaluation accuracy (Are the minimax backed-up values more accurate than the heuristic values themselves?), and (b) decision accuracy (Are moves played by deeper minimax search better than those by shallower search?). The experiments were performed in the {King–Rook}–King ({KRK}) chess endgame and in randomly generated game trees. The results show that, counter-intuitively, evaluation accuracy may decline with search depth, whereas at the same time decision accuracy improves with depth. In the article, this is explained by the fact that minimax in combination with a noisy evaluation function introduces a bias into the backed-up evaluations, which masks the evaluation effectiveness of minimax, but this bias still permits decision accuracy to improve with depth. This observed behaviour of minimax in the {KRK} endgame is discussed in the light of previous studies of pathology in minimax. It is shown that explaining the behaviour of minimax in an actual chess endgame in terms of previously known results requires special care.},
  author = {Sadikov, Aleksander and Bratko, Ivan and Kononenko, Igor},
  citeulike-article-id = {10098614},
  citeulike-linkout-0 = {http://lkm.fri.uni-lj.si/xaigor/slo/clanki/Sadikov\_final.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1016/j.tcs.2005.09.073},
  day = {14},
  doi = {10.1016/j.tcs.2005.09.073},
  issn = {03043975},
  journal = {Theoretical Computer Science},
  month = dec,
  number = {2},
  pages = {268--281},
  posted-at = {2011-12-06 11:23:04},
  priority = {2},
  title = {Bias and pathology in minimax search},
  url = {http://lkm.fri.uni-lj.si/xaigor/slo/clanki/Sadikov\_final.pdf},
  volume = {349},
  year = {2005}
  }

• A. Pivk, P. Cimiano, and Y. Sure, “From tables to frames,” Elsevier’s journal of web semantics: science, services and agents on the world wide web, vol. 3, iss. 2-3, pp. 132-146, 2005.
  [Bibtex]

  @article{2005_t2f_wsj,
  abstract = {Turning the current Web into a Semantic Web requires automatic approaches for annotation of existing data since manual approaches will not scale in general. We here present an approach for automatic generation of {F-Logic} frames out of tables which subsequently supports the automatic population of ontologies from table-like structures. The approach consists of a methodology, an accompanying implemen- tation and a thorough evaluation. It is based on a grounded cognitive table model which is stepwise instantiated by our methodology.},
  author = {Pivk, Aleksander and Cimiano, Philipp and Sure, York},
  citeulike-article-id = {10098597},
  citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.websem.2005.06.003},
  citeulike-linkout-1 = {http://www.websemanticsjournal.org/index.php/ps/article/view/68/66.pdf},
  comment = {Selected Papers from the International Semantic Web Conference (ISWC) 2004, Hiroshima, Japan, 07-11 November 2004},
  doi = {10.1016/j.websem.2005.06.003},
  journal = {Elsevier's Journal of Web Semantics: Science, Services and Agents on the World Wide Web},
  month = oct,
  number = {2-3},
  pages = {132--146},
  posted-at = {2011-12-06 11:15:55},
  priority = {2},
  title = {From tables to frames},
  url = {http://www.websemanticsjournal.org/index.php/ps/article/view/68/66.pdf},
  volume = {3},
  year = {2005}
  }

• G. Gantar, K. Kuzman, and B. Filipič, “Increasing the stability of the deep drawing process by simulation-based optimization,” Journal of materials processing technology, vol. 164-165, pp. 1343-1350, 2005.
  [Bibtex]

  @article{citeulike:10098585,
  abstract = {The paper deals with the possibilities of evaluating and increasing the stability of the deep drawing process. Not only the size of technological windows but also the stability of production processes is studied by means of numerical simulation based on the finite element method. An approach for optimization of the deep drawing processes is presented. It is capable of determining the optimal values of input parameters for the highest stability of the deep drawing process. As an example, deep drawing of rectangular boxes is studied.},
  author = {Gantar, Ga\v{s}per and Kuzman, Karl and Filipi\v{c}, Bogdan},
  citeulike-article-id = {10098585},
  citeulike-linkout-0 = {http://www.journalamme.org/papers\_amme05/1372.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1016/j.jmatprotec.2005.02.099},
  day = {15},
  doi = {10.1016/j.jmatprotec.2005.02.099},
  issn = {09240136},
  journal = {Journal of Materials Processing Technology},
  month = may,
  pages = {1343--1350},
  posted-at = {2011-12-06 11:11:29},
  priority = {2},
  title = {Increasing the stability of the deep drawing process by simulation-based optimization},
  url = {http://www.journalamme.org/papers\_amme05/1372.pdf},
  volume = {164-165},
  year = {2005}
  }

• A. A. Kavalenka, B. Filipič, M. A. Hemminga, and J. Štrancar, “Speeding up a genetic algorithm for EPR-based spin label characterization of biosystem complexity,” Journal of chemical information and modeling, vol. 45, iss. 6, pp. 1628-1635, 2005.
  [Bibtex]

  @article{journals/jcisd/KavalenkaFHS05,
  abstract = {Complexity of biological systems is one of the toughest problems for any experimental technique. Complex biochemical composition and a variety of biophysical interactions governing the evolution of a state of a biological system imply that the experimental response of the system would be superimposed of many different responses. To obtain a reliable characterization of such a system based on spin-label Electron Paramagnetic Resonance ({EPR}) spectroscopy, multiple Hybrid Evolutionary Optimization ({HEO}) combined with spectral simulation can be applied. Implemented as the {GHOST} algorithm this approach is capable of handling the huge solution space and provides an insight into the "quasicontinuous" distribution of parameters that describe the biophysical properties of an experimental system. However, the analysis procedure requires several hundreds of runs of the evolutionary optimization routine making this algorithm extremely computationally demanding. As only the best parameter sets from each run are assumed to contribute into the final solution, this algorithm appears far from being optimized. The goal of this study is to modify the optimization routine in a way that 20-40 runs would be enough to obtain qualitatively the same characterization. However, to keep the solution diversity throughout the {HEO} run, fitness sharing and newly developed shaking mechanisms are applied and tested on various test {EPR} spectra. In addition, other evolutionary optimization parameters such as population size and probability of genetic operators were also varied to tune the algorithm. According to the testing examples a speed-up factor of 5-7 was achieved.},
  author = {Kavalenka, Aleh A. and Filipi\v{c}, Bogdan and Hemminga, Marcus A. and \v{S}trancar, Janez},
  booktitle = {Journal of Chemical Information and Modeling},
  citeulike-article-id = {10098506},
  citeulike-linkout-0 = {http://www.mf.wau.nl/hemminga/online\_articles/hemmingagroup/kavalenkajcheminfmodel\%282005\%2945,1628-1635.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1021/ci0501589},
  citeulike-linkout-2 = {http://pubs.acs.org/doi/abs/10.1021/ci0501589},
  day = {23},
  doi = {10.1021/ci0501589},
  journal = {Journal of Chemical Information and Modeling},
  month = aug,
  number = {6},
  pages = {1628--1635},
  posted-at = {2011-12-06 11:00:07},
  priority = {2},
  publisher = {American Chemical Society},
  title = {Speeding up a genetic algorithm for {EPR}-based spin label characterization of biosystem complexity},
  url = {http://www.mf.wau.nl/hemminga/online\_articles/hemmingagroup/kavalenkajcheminfmodel\%282005\%2945,1628-1635.pdf},
  volume = {45},
  year = {2005}
  }

• J. Štrancar, T. Koklič, Z. Arsov, B. Filipič, D. Stopar, and M. A. Hemminga, “Spin label EPR-based characterization of biosystem complexity,” Journal of chemical information and modeling, vol. 45, iss. 2, pp. 394-406, 2005.
  [Bibtex]

  @article{journals/jcisd/StrancarKAFSH05,
  abstract = {Following the widely spread {EPR} spin-label applications for biosystem characterization, a novel approach is proposed for {EPR}-based characterization of biosystem complexity. Hereto a computational method based on a hybrid evolutionary optimization ({HEO}) is introduced. The enormous volume of information obtained from multiple {HEO} runs is reduced with a novel so-called {GHOST} condensation method for automatic detection of the degree of system complexity through the construction of two-dimensional solution distributions. The {GHOST} method shows the ability of automatic quantitative characterization of groups of solutions, e.g. the determination of average spectral parameters and group contributions. The application of the {GHOST} condensation algorithm is demonstrated on four synthetic examples of different complexity and applied to two physiologically relevant examples- the determination of domains in biomembranes (lateral heterogeneity) and the study of the low-resolution structure of membrane proteins.},
  author = {\v{S}trancar, Janez and Kokli\v{c}, Tilen and Arsov, Zoran and Filipi\v{c}, Bogdan and Stopar, David and Hemminga, Marcus A.},
  booktitle = {Journal of Chemical Information and Modeling},
  citeulike-article-id = {10098478},
  citeulike-linkout-0 = {http://dx.doi.org/10.1021/ci049748h},
  citeulike-linkout-1 = {http://pubs.acs.org/doi/abs/10.1021/ci049748h},
  day = {22},
  doi = {10.1021/ci049748h},
  journal = {Journal of Chemical Information and Modeling},
  month = jan,
  number = {2},
  pages = {394--406},
  posted-at = {2011-12-06 10:52:28},
  priority = {2},
  publisher = {American Chemical Society},
  title = {Spin label {EPR}-based characterization of biosystem complexity},
  url = {http://dx.doi.org/10.1021/ci049748h},
  volume = {45},
  year = {2005}
  }

• B. Filipič and E. Laitinen, “Model-based tuning of process parameters for steady-state steel casting,” Informatica, vol. 29, iss. 4, pp. 491-496, 2005.
  [Bibtex]

  @article{journals/informaticaSI/FilipicL05,
  abstract = {We present an empirical study of process parameter tuning in industrial continuous casting of steel where
  the goal is to assure the highest possible quality of the cast steel through proper parameter setting. The
  process is assumed to be under steady-state conditions and the considered optimization task is to set 18
  coolant flows in the caster secondary cooling zone to achieve the target surface temperatures along the slab.
  A numerical model of the casting process was employed to first investigate the properties of the parameter
  search space, and then iteratively improve parameter settings. For this purpose, two stochastic optimization
  algorithms were used: a steady-state evolutionary algorithm and next-descent local optimization. The
  results indicate the difficulty of the optimization task arises not from a complicated fitness landscape but
  rather from high dimensionality of the problem.},
  author = {Filipi\v{c}, Bogdan and Laitinen, Erkki},
  citeulike-article-id = {10098471},
  citeulike-linkout-0 = {http://dblp.uni-trier.de/db/journals/informaticaSI/informaticaSI29.html\#FilipicL05},
  citeulike-linkout-1 = {http://www.informatica.si/PDF/29-4/13\_Filipic-Model-Based\%20Tuning\%20of\%20Process\%20Parameters....pdf},
  journal = {Informatica},
  number = {4},
  pages = {491--496},
  posted-at = {2011-12-06 10:46:31},
  priority = {2},
  title = {Model-based tuning of process parameters for steady-state steel casting},
  url = {http://dblp.uni-trier.de/db/journals/informaticaSI/informaticaSI29.html\#FilipicL05},
  volume = {29},
  year = {2005}
  }

• A. Bežek and M. Gams, “From basic agent behavior to strategic patterns in a robotic soccer domain,” Informatica, vol. 29, iss. 4, pp. 461-468, 2005.
  [Bibtex]

  @article{journals/informaticaSI/BezekG05,
  abstract = {The paper presents an algorithm for multi-agent strategic modeling ({MASM}). The method applies domain knowledge and transforms sequences of basic multi-agent actions into a set of strategic action descriptions in the form of graph paths, agent actions, roles and corresponding rules. The rules, constructed by machine learning, enrich the graphical strategic patterns, which are presented in the form of graph paths. The method was evaluated on the {RoboCup} Soccer Server Internet League data. Tests showed that the constructed rules successfully captured some decisive offensive moves and some major defense flaws, although the description itself was a bit awkward and needed interpretation by a human expert.},
  author = {Be\v{z}ek, Andra\v{z} and Gams, Matja\v{z}},
  citeulike-article-id = {10098459},
  citeulike-linkout-0 = {http://dblp.uni-trier.de/db/journals/informaticaSI/informaticaSI29.html\#BezekG05},
  citeulike-linkout-1 = {http://www.informatica.si/pdf/29-4/09\_bezek-improving\%20study\%20planning\%20with\%20an\%20agent....pdf},
  journal = {Informatica},
  number = {4},
  pages = {461--468},
  posted-at = {2011-12-06 10:39:56},
  priority = {2},
  title = {From basic agent behavior to strategic patterns in a robotic soccer domain},
  url = {http://dblp.uni-trier.de/db/journals/informaticaSI/informaticaSI29.html\#BezekG05},
  volume = {29},
  year = {2005}
  }

• T. Curk, J. Demšar, Q. Xu, G. Leban, U. Petrovič, I. Bratko, G. Shaulsky, and B. Zupan, “Microarray data mining with visual programming,” Bioinformatics, vol. 21, iss. 3, pp. 396-398, 2005.
  [Bibtex]

  @article{citeulike:86108,
  abstract = {Visual programming offers an intuitive means of combining known analysis and visualization methods into powerful applications. The system presented here enables users who are not programmers to manage microarray and genomic data flow and to customize their analyses by combining common data analysis tools to fit their needs.},
  author = {Curk, Toma\v{z} and Dem\v{s}ar, Janez and Xu, Qikai and Leban, Gregor and Petrovi\v{c}, Uro\v{s} and Bratko, Ivan and Shaulsky, Gad and Zupan, Bla\v{z}},
  citeulike-article-id = {86108},
  citeulike-linkout-0 = {http://dx.doi.org/10.1093/bioinformatics/bth474},
  citeulike-linkout-1 = {http://bioinformatics.oxfordjournals.org/content/21/3/396.abstract},
  citeulike-linkout-2 = {http://bioinformatics.oxfordjournals.org/content/21/3/396.full.pdf},
  citeulike-linkout-3 = {http://bioinformatics.oxfordjournals.org/cgi/content/abstract/21/3/396},
  citeulike-linkout-4 = {http://www.ingentaconnect.com/content/oup/cabios/2005/00000021/00000003/art00396},
  citeulike-linkout-5 = {http://view.ncbi.nlm.nih.gov/pubmed/15308546},
  citeulike-linkout-6 = {http://www.hubmed.org/display.cgi?uids=15308546},
  day = {01},
  doi = {10.1093/bioinformatics/bth474},
  issn = {1460-2059},
  journal = {Bioinformatics},
  month = feb,
  number = {3},
  pages = {396--398},
  pmid = {15308546},
  posted-at = {2011-12-06 10:32:46},
  priority = {2},
  publisher = {Oxford University Press},
  title = {Microarray data mining with visual programming},
  url = {http://dx.doi.org/10.1093/bioinformatics/bth474},
  volume = {21},
  year = {2005}
  }

2004

• V. Rajkovič and B. Zupan, “Knowledge management as a challenge for public administration reengineering,” Informatics and management: selected topics, pp. 129-138, 2004.
  [Bibtex]

  @article{citeulike:10359422,
  author = {Rajkovi\v{c}, Vladislav and Zupan, Bla\v{z}},
  citeulike-article-id = {10359422},
  journal = {Informatics and management: selected topics},
  location = {Frankfurt am Main [etc.]},
  pages = {129--138},
  posted-at = {2012-02-16 11:26:09},
  priority = {2},
  publisher = {P. Lang},
  title = {Knowledge management as a challenge for public administration reengineering},
  year = {2004}
  }

• A. Pivk, P. Cimiano, and Y. Sure, “From tables to frames,” in International semantic web conference, 2004, pp. 166-181.
  [Bibtex]

  @inproceedings{conf/semweb/PivkCS04,
  abstract = {Turning the current Web into a Semantic Web requires automatic approaches for annotation of existing data since manual approaches will not scale in general. We here present an approach for automatic generation of {F-Logic} frames out of tables which subsequently supports the automatic population of ontologies from table-like structures. The approach consists of a methodology, an accompanying implementation and a thorough evaluation. It is based on a grounded cognitive table model which is stepwise instantiated by our methodology.},
  author = {Pivk, Aleksander and Cimiano, Philipp and Sure, York},
  booktitle = {International Semantic Web Conference},
  citeulike-article-id = {10103117},
  citeulike-linkout-0 = {http://ai.ijs.si/sandi/docs/ISWC\_paper.pdf},
  editor = {McIlraith, Sheila A. and Plexousakis, Dimitris and van Harmelen, Frank},
  pages = {166--181},
  posted-at = {2011-12-07 13:51:45},
  priority = {2},
  publisher = {Springer},
  series = {Lecture notes in computer science},
  title = {From tables to frames},
  url = {http://ai.ijs.si/sandi/docs/ISWC\_paper.pdf},
  volume = {3298},
  year = {2004}
  }

• A. Jakulin and I. Bratko, “Testing the significance of attribute interactions,” in 21st international conference on machine learning, New York, NY, USA, 2004.
  [Bibtex]

  @inproceedings{conf/icml/JakulinB04,
  abstract = {Attribute interactions are the irreducible dependencies between attributes. Interactions underlie feature relevance and selection, the structure of joint probability and classification models: if and only if the attributes interact, they should be connected. While the issue of 2-way interactions, especially of those between an attribute and the label, has already been addressed, we introduce an operational definition of a generalized n-way interaction by highlighting two models: the reductionistic part-to-whole approximation, where the model of the whole is reconstructed from models of the parts, and the holistic reference model, where the whole is modelled directly. An interaction is deemed significant if these two models are significantly different. In this paper, we propose the Kirkwood superposition approximation for constructing part-to-whole approximations. To model data, we do not assume a particular structure of interactions, but instead construct the model by testing for the presence of interactions. The resulting map of significant interactions is a graphical model learned from the data. We confirm that the P-values computed with the assumption of the asymptotic X2 distribution closely match those obtained with the boot-strap.},
  address = {New York, NY, USA},
  author = {Jakulin, Aleks and Bratko, Ivan},
  booktitle = {21st international conference on Machine learning},
  citeulike-article-id = {10103103},
  citeulike-linkout-0 = {http://www.stat.columbia.edu/\~{}jakulin/Int/jakulin-bratko-ICML2004.pdf},
  citeulike-linkout-1 = {http://portal.acm.org/citation.cfm?id=1015330.1015377},
  citeulike-linkout-2 = {http://dx.doi.org/10.1145/1015330.1015377},
  doi = {10.1145/1015330.1015377},
  isbn = {1-58113-838-5},
  location = {Banff, Alberta, Canada},
  posted-at = {2011-12-07 13:43:53},
  priority = {2},
  publisher = {ACM},
  series = {ICML '04},
  title = {Testing the significance of attribute interactions},
  url = {http://www.stat.columbia.edu/\~{}jakulin/Int/jakulin-bratko-ICML2004.pdf},
  year = {2004}
  }

• D. Šuc, I. Bratko, and C. Sammut, “Learning to fly simple and robust,” in Ecml 2004, Berlin, Heidelberg, 2004, pp. 407-418.
  [Bibtex]

  @inproceedings{citeulike:10098413,
  abstract = {We report on new experiments with machine learning in the reconstruction of human sub-cognitive skill. The particular problem considered is to generate a clone of a human pilot performing a flying task on a simulated aircraft. The work presented here uses the human behaviour to create constraints for a search process that results in a controller – pilot's clone. Experiments in this paper indicate that this approach, called ” indirect controllers”, results in pilot clones that are, in comparison with those obtained with traditional ” direct controllers”, simpler, more robust and easier to understand. An important feature of indirect controllers in this paper is the use of qualitative constraints.},
  address = {Berlin, Heidelberg},
  author = {\v{S}uc, Dorian and Bratko, Ivan and Sammut, Claude},
  booktitle = {ECML 2004},
  chapter = {38},
  citeulike-article-id = {10098413},
  citeulike-linkout-0 = {http://eprints.fri.uni-lj.si/180/1/SucECML04www.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1007/978-3-540-30115-8\_38},
  citeulike-linkout-2 = {http://www.springerlink.com/content/pflda7vbmbuwlbhe},
  doi = {10.1007/978-3-540-30115-8\_38},
  editor = {Boulicaut, Jean-Fran\c{c}ois and Esposito, Floriana and Giannotti, Fosca and Pedreschi, Dino},
  isbn = {978-3-540-23105-9},
  journal = {Lecture notes in computer science},
  month = sep,
  pages = {407--418},
  posted-at = {2011-12-06 10:23:01},
  priority = {2},
  publisher = {Springer Berlin / Heidelberg},
  series = {Lecture notes in computer science},
  title = {Learning to fly simple and robust},
  url = {http://eprints.fri.uni-lj.si/180/1/SucECML04www.pdf},
  volume = {3201},
  year = {2004}
  }

• J. Ferlež and M. Gams, “Shortest-path semantic distance measure in WordNet v2.0,” Informatica, vol. 28, pp. 381-386, 2004.
  [Bibtex]

  @article{citeulike:10098406,
  abstract = {This paper analyses a measure of semantic relatedness between two words. Our measure is based on shortest path between synsets in {WordNet} v2.0. It uses all available links in {WordNet} v2.0 and is implemented by a bidirectional breadth-first algorithm. Experimental evaluation and comparison with a benchmark set of human similarity judgments demonstrates that the simple measure applied on {WordNet} v2.0 performs better than the more complicated approaches mostly combining an {IS}-A taxonomy with the notion of shared information content extracted from corpora. One explanation is that our pretty basic method efficiently exploits all the available links in {WordNet} v2.0, while other measures, although more complicated and advanced, do not make good use of the new derivational links added to {WordNet} in the latest version 2.0.},
  author = {Ferle\v{z}, Jure and Gams, Matja\v{z}},
  citeulike-article-id = {10098406},
  citeulike-linkout-0 = {http://www.informatica.si/PDF/Informatica\_2004\_4.pdf\#page=49},
  journal = {Informatica},
  pages = {381--386},
  posted-at = {2011-12-06 10:14:31},
  priority = {2},
  title = {Shortest-path semantic distance measure in {WordNet} v2.0},
  url = {http://www.informatica.si/PDF/Informatica\_2004\_4.pdf\#page=49},
  volume = {28},
  year = {2004}
  }

• B. Filipič, “Optimizing production schedules and energy consumption with an evolutionary algorithm,” Informatica, vol. 28, pp. 353-357, 2004.
  [Bibtex]

  @article{citeulike:10098394,
  abstract = {We present an evolutionary algorithm approach to schedule optimization for a group of production lines in a car factory. Schedules are evaluated with respect to the energy consumption over peak demand periods, while the task is to minimize the energy costs by appropriately scheduling the interruptions of processes on the lines. Tests on real problem instances show this approach gives near-optimal schedules in acceptable time.},
  author = {Filipi\v{c}, Bogdan},
  citeulike-article-id = {10098394},
  citeulike-linkout-0 = {http://www.informatica.si/PDF/Informatica\_2004\_4.pdf\#page=21},
  journal = {Informatica},
  pages = {353--357},
  posted-at = {2011-12-06 10:09:42},
  priority = {2},
  title = {Optimizing production schedules and energy consumption with an evolutionary algorithm},
  url = {http://www.informatica.si/PDF/Informatica\_2004\_4.pdf\#page=21},
  volume = {28},
  year = {2004}
  }

• D. Šuc, D. Vladušič, and I. Bratko, “Qualitatively faithful quantitative prediction,” Artificial intelligence, vol. 158, iss. 2, pp. 189-214, 2004.
  [Bibtex]

  @article{citeulike:10098332,
  abstract = {We describe an approach to machine learning from numerical data that combines both qualitative and numerical learning. This approach is carried out in two stages: (1) induction of a qualitative model from numerical examples of the behaviour of a physical system, and (2) induction of a numerical regression function that both respects the qualitative constraints and fits the training data numerically. We call this approach Q2 learning, which stands for Qualitatively faithful Quantitative learning. Induced numerical models are "qualitatively faithful" in the sense that they respect qualitative trends in the learning data. Advantages of Q2 learning are that the induced qualitative model enables a (possibly causal) explanation of relations among the variables in the modelled system, and that numerical predictions are guaranteed to be qualitatively consistent with the qualitative model which alleviates the interpretation of the predictions. Moreover, as we show experimentally the qualitative model's guidance of the quantitative modelling process leads to predictions that may be considerably more accurate than those obtained by state-of-the-art numerical learning methods. The experiments include an application of Q2 learning to the identification of a car wheel suspension system-a complex, industrially relevant mechanical system.},
  author = {\v{S}uc, Dorian and Vladu\v{s}i\v{c}, Daniel and Bratko, Ivan},
  citeulike-article-id = {10098332},
  citeulike-linkout-0 = {http://www.ailab.si/dorian/pub/SucAIJPreprint.pdf},
  citeulike-linkout-1 = {http://dx.doi.org/10.1016/j.artint.2004.05.002},
  doi = {10.1016/j.artint.2004.05.002},
  issn = {00043702},
  journal = {Artificial Intelligence},
  month = oct,
  number = {2},
  pages = {189--214},
  posted-at = {2011-12-06 09:57:53},
  priority = {2},
  title = {Qualitatively faithful quantitative prediction},
  url = {http://www.ailab.si/dorian/pub/SucAIJPreprint.pdf},
  volume = {158},
  year = {2004}
  }

• T. Šef and M. Gams, “Data mining for creating accentuation rules,” Applied artificial intelligence, vol. 17, pp. 395-410, 2004.
  [Bibtex]

  @article{citeulike:10098308,
  abstract = {One of the important tasks in language analysis, speech synthesis, and recognition is stress assignment within words. The task is particularly difficult in languages where lexical stress can be located almost arbitrarily on every syllable in the word, such as in the Slovenian language. Although humans may pronounce very well even words they have never heard before, human experts have not been able to synthesize accurate rules for accentuation in phonetically complex languages. We have performed several experiments with different machine-learning and data-mining tools to create accentuation rules for the Slovenian language. We wanted to find out if it is possible to design better accentuation rules than the ones defined by the experts, and to test if these rules are complex or compact. The {MULTEXT}-East Slovene Lexicon was used for data sets, supplemented with lexical stress marks. The accuracy achieved by decision trees significantly surpassed all previous results. However, the sizes of the trees indicate that accentuation in Slovene is a very complex problem. We were not able to find a simple solution in the form of relatively compact rules using several {ML} and {DM} systems. It also indicates that creating accurate accentuation rules is a task that might require artificial intelligence ({AI}).},
  author = {\v{S}ef, Toma\v{z} and Gams, Matja\v{z}},
  citeulike-article-id = {10098308},
  journal = {Applied Artificial Intelligence},
  pages = {395--410},
  posted-at = {2011-12-06 09:52:03},
  priority = {2},
  title = {Data mining for creating accentuation rules},
  volume = {17},
  year = {2004}
  }

• C. C. Barca and M. Luštrek, “Medical expert support tool (MEST) : a person-centric approach for healthcare management,” Lect, vol. 7251, pp. 99-115.
  [Bibtex]

  @article{citeulike:11522221,
  author = {Barca, Carlos C. and Lu\v{s}trek, Mitja},
  citeulike-article-id = {11522221},
  journal = {Lect},
  pages = {99--115},
  posted-at = {2012-10-22 10:15:23},
  priority = {2},
  title = {Medical expert support tool ({MEST}) : a person-centric approach for healthcare management},
  volume = {7251}
  }

• E. Dovgan, T. Tušar, M. Javorski, and B. Filipič, “Discovering comfortable driving strategies using simulation-based multiobjective optimization,” Informatica, vol. 36, iss. 3, pp. 319-326.
  [Bibtex]

  @article{citeulike:11522097,
  author = {Dovgan, Erik and Tu\v{s}ar, Tea and Javorski, Matija and Filipi\v{c}, Bogdan},
  citeulike-article-id = {11522097},
  journal = {Informatica},
  number = {3},
  pages = {319--326},
  posted-at = {2012-10-22 09:58:45},
  priority = {2},
  title = {Discovering comfortable driving strategies using simulation-based multiobjective optimization},
  volume = {36}
  }