Public demonstration lecture for the title of docent: Classifier Evaluation

Lecturer : 
Researcher Indre Zliobaite
Event type: 
Public demonstration lesson
Doctoral dissertation
Respondent: 
Opponent: 
Custos: 
Event time: 
2016-03-01 12:15 to 13:15
Place: 
Exactum C129, Kumpula Campus
Description: 

Researcher Indre Zliobaite has applied for the title of docent at the Department and will give a public demonstration lecture on Tuesday 1 March at 2:15 pm at Exactum C129. The title of the lecture is "Classifier Evaluation". 

Welcome all!

Indre Zliobaite’s main research interests and expertise are in predictive modeling with evolving data, adaptation, transparency and accountability in machine learning and data mining. She defended her PhD in 2010. She has been working in Helsinki for the three years, including at ALGODAN center of excellence. Last year she was a Journal Track Chair/Guest Editor for ECMLPKDD in Data Mining and Knowledge Discovery, and Machine Learning journals. Currently she is affiliated with University of Helsinki and HIIT.

Zliobaite's portfolio

Helsinki Algorithms Seminar: Reliability and verifiability in parallel hardware and algorithm design

Lecturer : 
Petteri Kaski
Event type: 
HIIT seminar
Event time: 
2016-02-04 16:15 to 17:00
Place: 
Exactum B119
Description: 

Helsinki Algorithms Seminar

TIME: Thursday 4 February, 16:15–17:00

PLACE: Exactum B119, Kumpula

SPEAKER: Petteri Kaski

TITLE: Reliability and verifiability in parallel hardware and algorithm design

Computer Science Matchmaking Event

Event type: 
Event
Event time: 
2016-03-03 13:00 to 16:00
Place: 
Aalto University Otaniemi Campus
Description: 

The Computer Science Matchmaking Event brings together experts from Aalto University and industry to discuss the hottest research topics, opportunities and innovations in computer science.

Participants will have the opportunity

  • to discuss topical research projects & results
  • to find out about ways to take part in education and meet with computer science students
  • to network with professors, researchers, teachers and business colleagues

Program:

13.00-14.00
Opening seminar including short keynote presentations from research, education and business, e.g.

  • Professor, Director Jouko Lampinen, Computer Science
  • Professor Jaakko Lehtinen, Computer Graphics
  • Director Harri Kiljander, F-Secure

14.30-15.00
Examples of successful teaching cases

15.00-15.30
Doctoral student pitches

14.00-16.00
Networking and discussion over stands and demo cases

The program will be updated during January.

For practical arrangements, please register here.

Welcome!

Helsinki Algorithms Seminar: Fast zeta transform in semimodular lattices -- the art of taking many related sums

Lecturer : 
Jukka Kohonen
Event type: 
HIIT seminar
Doctoral dissertation
Respondent: 
Opponent: 
Custos: 
Event time: 
2016-01-21 16:15 to 17:00
Place: 
Room B119, Exactum, Kumpula Campus
Description: 

TIME: Thursday 21 January, 16.15–17.00

PLACE: Room B119, Exactum, Kumpula

SPEAKER: Jukka Kohonen

TITLE: Fast zeta transform in semimodular lattices -- the art of taking many related sums

ABSTRACT:

Many algebraic and combinatorial problems involve partially ordered sets or "posets", for example, the collection of subsets of a given set. A lattice is a kind of a poset. The structure can be visualized as a directed acyclic graph (DAG). Each element of a lattice may have an associated number or "value", and one wishes to take sums of these values over many different large collections of elements efficiently. This simultaneous computation of the different sums is called the zeta transform. Counting problems in combinatorics are often of this type.

I will describe some recent advances in the algorithmics of this problem. For certain kinds of lattice and posets we now know zeta transform algorithms that are as fast as theoretically possible, namely, exactly e elementary additions if the lattice or poset has e edges. I will also discuss some open problems, such as: Are there any lattices where the zeta transform is very difficult? There are lattices where 2e additions are needed, but is there an upper bound?

More information about Helsinki Algorithms Seminar.

 

14th Bioinformatics Research and Education Workshop BREW

Event type: 
Workshop
Event time: 
2016-05-19 08:00 to 2016-05-20 16:00
Place: 
Exactum building, Kumpula Campus
Description: 

14th Bioinformatics Research and Education Workshop BREW will take place in Helsinki, May 19-20, 2016.

BREW is a workshop for PhD students in bioinformatics and computational biology, which aims to give an introduction to scientific conferences, including submission, peer review and presentation of scientific papers. All participants must submit a paper and take part in reviewing papers from other participants in order to attend the workshop. After the review deadline, students have a chance to make alterations to their paper and deliver a final version. Review, research or project plan papers will be accepted.

Please register by sending a 100-200 word abstract to brew2016-org-list@cs.helsinki.fi.
The deadline is February 8.
The workshop is free of charge! The PROGRAM consists of the talks given by the participating students and one or two invited speakers. Additionally, social events are offered. 

Please find more information at BREW webpage.

Also in Facebook.

Pages