User Tools

Site Tools


softwareprojekt08:geda

Project: A Graph-based Event Detection Approach

Tutor: Ling Chen

Office: L3S Research Center, Appelstr. 4, Room 212

Email: lchen@L3S.de

casinos en ligne Next Meeting: 31.10.2008 @ 17:00 ^ Name ^ Email ^ Responsibility | | Ling | lchen@L3S.de | Tutor | | Felix| felix.nuesser@web.de | Team Leader| | Sebastian| swp@sebastianschaper.net| System Architect| | Martin| martin-lemke@gmx.net| Quality Officer (documentation)| | JianKang| kang30@hotmail.com| Quality Officer (testing) | | Friedrich|fritz.hat@gmx.de | Quality Officer (source code) | | Long| tenglong1268@hotmail.com| Researcher| ===== Project Description ===== ===== Schedule ===== ===== Meeting Minutes ===== ==== Thursday, 16.10.2008 ==== === Agenda === * Define Roles: * Team Leader: Contact person, Planning, Presentation * System architect: Class architecture, Libraries, Diagrams * Quality officer: Documentation (English), Pictures, User manual * Quality officer Tests: (Planning, Processing, Evaluation) * Quality officer Source Code: (Re-usability, Understandability, Consequence) * Researcher:** Information investigation (Algorithms, Publications)

  • Register to gforge (http://swpdev.l3s.uni-hannover.de)
  • Register to project
  • Select group for presentation (Friedrich, Long –> Eclipse, Felix, Sebastian –> Java, Jiankang, Martin –> Database)
  • Add your information to the wiki participants
  • Next meeting date: 23.10.2008 @ 17:00

Thursday, 23.10.2008

Agenda

  • Tasks of next week:
    • Read the paper
    • Setup the connection from Eclipse to swpdev via svn
    • Install MySQL
  • Think about the following issues:
    • Come up with an implementation architecture based on the paper
    • Search for available packages
  • Next meeting date: 31.10.2008 @ 17:00

Friday, 31.10.2008

Agenda

  • Questions on the text
    • Input is a textfile
    • Use for testing the smaller textfile
    • The output should be a textfile
  • Tasks of next week:
    • Import the database
    • Include basic database functions
    • Create the dualgraph
  • Next meeting date: 07.11.2008 @ 15:00

Friday, 07.11.2008

Agenda

  • Changes of the DB-Structure:
    • Put the strengths as vector in one field
    • Give the vertices IDs
    • Create another table for the edges (2 fields with the corresponding vertex IDs)
  • Tasks of next week:
    • Felix, Fritz and Long: Do the changes in the DB-Structure and implement the Dual Graph
    • JianKang, Martin and Sebastian: Think about ways to implement the Point Number 4 of the paper
  • Next meeting date: 13.11.2008 @ 16:00

Thursday 13.11.2008

Agenda

  • Changes of the DB-Structure:
    • create a new table for similarty, like table “edges”
  • Task for next week
    • search for implementation for Semantik-based Graph and Similarity from Internet(with keyword simrank)
    • search for implementation for Evolution based Graph and Similarity from Internet(with keyword time warping)
    • read the next chapter(chapter 5) of the paper
  • Next meeting date:20.11.2008 @ 16:00

Thursday 27.11.2008

Agenda

  • A search window size for DTW should be an optional parameter
  • The number of graph cuts should be set as a parameter
  • Tasks for next week:
    • JianKang, Long, Fritz & Martin: Finish the implementation of DTW and test SimRank and DTW
    • Felix, Sebastian & Fritz: Think of a way to implement the normalized graph cut and find helpful packages
  • Next meeting date: 4.12.2008 @ 17.00

Thursday 04.12.2008

Agenda

  • SQL queries involving “join” operations are inefficient. Replace them with alternative solutions
  • Independent query-page pair nodes should not be constructed into the graph to compute SimRank
  • Tasks for the next week:
    • Long, Felix and Jiankang are responsible for revising the “WriteStrength” method.
    • Martin and Sebastian work on graph cutting.
  • Next meeting date: 11.12.2008 @ 17.00

Materials

softwareprojekt08/geda.txt · Last modified: 2010/07/17 00:13 by 119.111.124.194